./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 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7786c4a2-93ec-4bf5-80fb-48d9bd08abd3/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7786c4a2-93ec-4bf5-80fb-48d9bd08abd3/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7786c4a2-93ec-4bf5-80fb-48d9bd08abd3/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7786c4a2-93ec-4bf5-80fb-48d9bd08abd3/bin/uautomizer-DQz5hQGWxF/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_7786c4a2-93ec-4bf5-80fb-48d9bd08abd3/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7786c4a2-93ec-4bf5-80fb-48d9bd08abd3/bin/uautomizer-DQz5hQGWxF --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e4e522f7269f01a0f0108ec2341cf17a6d715eaf63b892b25236d9e51e23a874 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 06:26:22,725 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 06:26:22,729 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 06:26:22,808 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 06:26:22,809 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 06:26:22,810 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 06:26:22,813 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 06:26:22,816 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 06:26:22,819 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 06:26:22,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 06:26:22,822 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 06:26:22,824 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 06:26:22,825 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 06:26:22,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 06:26:22,829 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 06:26:22,831 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 06:26:22,833 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 06:26:22,835 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 06:26:22,838 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 06:26:22,841 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 06:26:22,844 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 06:26:22,847 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 06:26:22,849 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 06:26:22,850 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 06:26:22,856 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 06:26:22,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 06:26:22,857 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 06:26:22,859 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 06:26:22,860 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 06:26:22,862 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 06:26:22,862 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 06:26:22,864 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 06:26:22,865 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 06:26:22,867 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 06:26:22,869 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 06:26:22,869 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 06:26:22,870 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 06:26:22,871 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 06:26:22,872 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 06:26:22,873 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 06:26:22,874 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 06:26:22,876 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7786c4a2-93ec-4bf5-80fb-48d9bd08abd3/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-20 06:26:22,909 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 06:26:22,909 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 06:26:22,910 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 06:26:22,910 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 06:26:22,911 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 06:26:22,912 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 06:26:22,913 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 06:26:22,913 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 06:26:22,914 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 06:26:22,914 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 06:26:22,915 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 06:26:22,915 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 06:26:22,916 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-20 06:26:22,916 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 06:26:22,917 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-20 06:26:22,917 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 06:26:22,917 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 06:26:22,917 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-20 06:26:22,918 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 06:26:22,918 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 06:26:22,918 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 06:26:22,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 06:26:22,919 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 06:26:22,919 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 06:26:22,920 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-20 06:26:22,920 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-20 06:26:22,920 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 06:26:22,920 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-20 06:26:22,921 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-20 06:26:22,921 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-20 06:26:22,921 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 06:26:22,922 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7786c4a2-93ec-4bf5-80fb-48d9bd08abd3/bin/uautomizer-DQz5hQGWxF/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_7786c4a2-93ec-4bf5-80fb-48d9bd08abd3/bin/uautomizer-DQz5hQGWxF Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e4e522f7269f01a0f0108ec2341cf17a6d715eaf63b892b25236d9e51e23a874 [2021-11-20 06:26:23,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 06:26:23,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 06:26:23,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 06:26:23,261 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 06:26:23,262 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 06:26:23,264 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7786c4a2-93ec-4bf5-80fb-48d9bd08abd3/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2021-11-20 06:26:23,357 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7786c4a2-93ec-4bf5-80fb-48d9bd08abd3/bin/uautomizer-DQz5hQGWxF/data/c24262995/1a6f9722224d443d9f90cff308542da8/FLAG3f7dbea24 [2021-11-20 06:26:24,246 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 06:26:24,246 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7786c4a2-93ec-4bf5-80fb-48d9bd08abd3/sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2021-11-20 06:26:24,275 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7786c4a2-93ec-4bf5-80fb-48d9bd08abd3/bin/uautomizer-DQz5hQGWxF/data/c24262995/1a6f9722224d443d9f90cff308542da8/FLAG3f7dbea24 [2021-11-20 06:26:24,362 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7786c4a2-93ec-4bf5-80fb-48d9bd08abd3/bin/uautomizer-DQz5hQGWxF/data/c24262995/1a6f9722224d443d9f90cff308542da8 [2021-11-20 06:26:24,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 06:26:24,371 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 06:26:24,373 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 06:26:24,373 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 06:26:24,376 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 06:26:24,376 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:26:24" (1/1) ... [2021-11-20 06:26:24,378 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ab73bc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:24, skipping insertion in model container [2021-11-20 06:26:24,378 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:26:24" (1/1) ... [2021-11-20 06:26:24,386 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 06:26:24,498 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 06:26:25,422 WARN L230 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_7786c4a2-93ec-4bf5-80fb-48d9bd08abd3/sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i[71148,71161] [2021-11-20 06:26:25,465 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:26:25,500 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 06:26:25,777 WARN L230 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_7786c4a2-93ec-4bf5-80fb-48d9bd08abd3/sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i[71148,71161] [2021-11-20 06:26:25,799 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:26:25,853 INFO L208 MainTranslator]: Completed translation [2021-11-20 06:26:25,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:25 WrapperNode [2021-11-20 06:26:25,856 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 06:26:25,858 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 06:26:25,858 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 06:26:25,858 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 06:26:25,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:25" (1/1) ... [2021-11-20 06:26:25,937 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:25" (1/1) ... [2021-11-20 06:26:26,023 INFO L137 Inliner]: procedures = 102, calls = 421, calls flagged for inlining = 48, calls inlined = 43, statements flattened = 1101 [2021-11-20 06:26:26,024 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 06:26:26,025 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 06:26:26,025 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 06:26:26,025 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 06:26:26,038 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:25" (1/1) ... [2021-11-20 06:26:26,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:25" (1/1) ... [2021-11-20 06:26:26,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:25" (1/1) ... [2021-11-20 06:26:26,069 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:25" (1/1) ... [2021-11-20 06:26:26,159 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:25" (1/1) ... [2021-11-20 06:26:26,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:25" (1/1) ... [2021-11-20 06:26:26,175 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:25" (1/1) ... [2021-11-20 06:26:26,189 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 06:26:26,191 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 06:26:26,191 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 06:26:26,191 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 06:26:26,192 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:25" (1/1) ... [2021-11-20 06:26:26,216 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 06:26:26,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7786c4a2-93ec-4bf5-80fb-48d9bd08abd3/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:26:26,248 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7786c4a2-93ec-4bf5-80fb-48d9bd08abd3/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 06:26:26,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7786c4a2-93ec-4bf5-80fb-48d9bd08abd3/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 06:26:26,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-20 06:26:26,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-20 06:26:26,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-20 06:26:26,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-20 06:26:26,310 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-11-20 06:26:26,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-11-20 06:26:26,311 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-11-20 06:26:26,311 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-11-20 06:26:26,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-20 06:26:26,311 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2021-11-20 06:26:26,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2021-11-20 06:26:26,312 INFO L130 BoogieDeclarations]: Found specification of procedure extract_value [2021-11-20 06:26:26,312 INFO L138 BoogieDeclarations]: Found implementation of procedure extract_value [2021-11-20 06:26:26,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-20 06:26:26,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 06:26:26,313 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_destroy_user [2021-11-20 06:26:26,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_destroy_user [2021-11-20 06:26:26,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-20 06:26:26,313 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion [2021-11-20 06:26:26,313 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion [2021-11-20 06:26:26,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-20 06:26:26,314 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-20 06:26:26,315 INFO L130 BoogieDeclarations]: Found specification of procedure ibmpex_bmc_delete [2021-11-20 06:26:26,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ibmpex_bmc_delete [2021-11-20 06:26:26,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-20 06:26:26,315 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2021-11-20 06:26:26,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2021-11-20 06:26:26,316 INFO L130 BoogieDeclarations]: Found specification of procedure ibmpex_send_message [2021-11-20 06:26:26,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ibmpex_send_message [2021-11-20 06:26:26,317 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2021-11-20 06:26:26,317 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2021-11-20 06:26:26,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 06:26:26,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-20 06:26:26,317 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2021-11-20 06:26:26,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2021-11-20 06:26:26,318 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2021-11-20 06:26:26,318 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2021-11-20 06:26:26,319 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2021-11-20 06:26:26,319 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2021-11-20 06:26:26,319 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2021-11-20 06:26:26,320 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2021-11-20 06:26:26,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-20 06:26:26,320 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2021-11-20 06:26:26,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2021-11-20 06:26:26,321 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_free_recv_msg [2021-11-20 06:26:26,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_free_recv_msg [2021-11-20 06:26:26,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-20 06:26:26,322 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2021-11-20 06:26:26,322 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2021-11-20 06:26:26,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 06:26:26,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 06:26:26,783 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 06:26:26,785 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 06:26:28,153 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 06:26:28,182 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 06:26:28,183 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-20 06:26:28,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:26:28 BoogieIcfgContainer [2021-11-20 06:26:28,188 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 06:26:28,193 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 06:26:28,193 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 06:26:28,199 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 06:26:28,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:26:24" (1/3) ... [2021-11-20 06:26:28,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4770eef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:26:28, skipping insertion in model container [2021-11-20 06:26:28,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:25" (2/3) ... [2021-11-20 06:26:28,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4770eef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:26:28, skipping insertion in model container [2021-11-20 06:26:28,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:26:28" (3/3) ... [2021-11-20 06:26:28,204 INFO L111 eAbstractionObserver]: Analyzing ICFG m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2021-11-20 06:26:28,210 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 06:26:28,211 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-20 06:26:28,295 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 06:26:28,308 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 06:26:28,309 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-20 06:26:28,362 INFO L276 IsEmpty]: Start isEmpty. Operand has 275 states, 209 states have (on average 1.2966507177033493) internal successors, (271), 214 states have internal predecessors, (271), 47 states have call successors, (47), 17 states have call predecessors, (47), 17 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2021-11-20 06:26:28,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-11-20 06:26:28,398 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:26:28,399 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:26:28,400 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:26:28,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:26:28,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1527877958, now seen corresponding path program 1 times [2021-11-20 06:26:28,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:26:28,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315977893] [2021-11-20 06:26:28,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:26:28,423 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:26:28,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:29,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 06:26:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:29,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 06:26:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:29,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 06:26:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:29,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:29,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:29,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-20 06:26:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:29,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-20 06:26:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:29,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-20 06:26:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:29,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-20 06:26:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:29,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-20 06:26:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:29,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-20 06:26:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:29,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-20 06:26:29,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:29,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-20 06:26:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:29,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:29,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:29,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:29,452 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-11-20 06:26:29,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:26:29,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315977893] [2021-11-20 06:26:29,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315977893] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:26:29,457 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:26:29,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 06:26:29,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227912726] [2021-11-20 06:26:29,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:26:29,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 06:26:29,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:26:29,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 06:26:29,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 06:26:29,522 INFO L87 Difference]: Start difference. First operand has 275 states, 209 states have (on average 1.2966507177033493) internal successors, (271), 214 states have internal predecessors, (271), 47 states have call successors, (47), 17 states have call predecessors, (47), 17 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-11-20 06:26:31,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:26:31,283 INFO L93 Difference]: Finished difference Result 678 states and 930 transitions. [2021-11-20 06:26:31,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 06:26:31,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 122 [2021-11-20 06:26:31,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:26:31,313 INFO L225 Difference]: With dead ends: 678 [2021-11-20 06:26:31,319 INFO L226 Difference]: Without dead ends: 375 [2021-11-20 06:26:31,334 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-20 06:26:31,340 INFO L933 BasicCegarLoop]: 426 mSDtfsCounter, 325 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-20 06:26:31,342 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 1484 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-20 06:26:31,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2021-11-20 06:26:31,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 263. [2021-11-20 06:26:31,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 201 states have (on average 1.2835820895522387) internal successors, (258), 204 states have internal predecessors, (258), 45 states have call successors, (45), 17 states have call predecessors, (45), 16 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2021-11-20 06:26:31,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 346 transitions. [2021-11-20 06:26:31,485 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 346 transitions. Word has length 122 [2021-11-20 06:26:31,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:26:31,487 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 346 transitions. [2021-11-20 06:26:31,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-11-20 06:26:31,487 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 346 transitions. [2021-11-20 06:26:31,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-11-20 06:26:31,492 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:26:31,493 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:26:31,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-20 06:26:31,497 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:26:31,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:26:31,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1747602214, now seen corresponding path program 1 times [2021-11-20 06:26:31,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:26:31,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105602662] [2021-11-20 06:26:31,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:26:31,499 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:26:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:31,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 06:26:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:31,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 06:26:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:31,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 06:26:31,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:31,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:31,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:31,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-20 06:26:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:31,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-20 06:26:31,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:31,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-20 06:26:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:31,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-20 06:26:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:31,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-20 06:26:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:31,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-20 06:26:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:31,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-20 06:26:31,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:31,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-20 06:26:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:31,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-20 06:26:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:31,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:31,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:31,900 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-11-20 06:26:31,900 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:26:31,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105602662] [2021-11-20 06:26:31,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105602662] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:26:31,901 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:26:31,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 06:26:31,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706100466] [2021-11-20 06:26:31,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:26:31,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 06:26:31,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:26:31,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 06:26:31,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 06:26:31,906 INFO L87 Difference]: Start difference. First operand 263 states and 346 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-20 06:26:32,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:26:32,922 INFO L93 Difference]: Finished difference Result 548 states and 728 transitions. [2021-11-20 06:26:32,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 06:26:32,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2021-11-20 06:26:32,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:26:32,928 INFO L225 Difference]: With dead ends: 548 [2021-11-20 06:26:32,928 INFO L226 Difference]: Without dead ends: 293 [2021-11-20 06:26:32,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-20 06:26:32,933 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 155 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-20 06:26:32,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 874 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-20 06:26:32,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-11-20 06:26:32,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 264. [2021-11-20 06:26:32,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 202 states have (on average 1.2821782178217822) internal successors, (259), 205 states have internal predecessors, (259), 45 states have call successors, (45), 17 states have call predecessors, (45), 16 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2021-11-20 06:26:32,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 347 transitions. [2021-11-20 06:26:32,971 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 347 transitions. Word has length 130 [2021-11-20 06:26:32,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:26:32,972 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 347 transitions. [2021-11-20 06:26:32,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-20 06:26:32,973 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 347 transitions. [2021-11-20 06:26:32,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-11-20 06:26:32,975 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:26:32,976 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:26:32,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-20 06:26:32,976 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:26:32,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:26:32,977 INFO L85 PathProgramCache]: Analyzing trace with hash -329734684, now seen corresponding path program 1 times [2021-11-20 06:26:32,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:26:32,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141268932] [2021-11-20 06:26:32,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:26:32,978 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:26:33,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:33,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 06:26:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:33,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 06:26:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:33,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 06:26:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:33,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:33,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:33,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:33,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-20 06:26:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:33,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-20 06:26:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:33,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-20 06:26:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:33,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-20 06:26:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:33,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-20 06:26:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:33,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-20 06:26:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:33,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-20 06:26:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:33,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-20 06:26:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:33,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-20 06:26:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:33,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:33,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:33,261 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-11-20 06:26:33,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:26:33,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141268932] [2021-11-20 06:26:33,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141268932] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:26:33,262 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:26:33,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 06:26:33,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697442625] [2021-11-20 06:26:33,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:26:33,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 06:26:33,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:26:33,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 06:26:33,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 06:26:33,266 INFO L87 Difference]: Start difference. First operand 264 states and 347 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-20 06:26:34,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:26:34,516 INFO L93 Difference]: Finished difference Result 627 states and 845 transitions. [2021-11-20 06:26:34,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 06:26:34,517 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2021-11-20 06:26:34,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:26:34,522 INFO L225 Difference]: With dead ends: 627 [2021-11-20 06:26:34,522 INFO L226 Difference]: Without dead ends: 371 [2021-11-20 06:26:34,524 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-20 06:26:34,525 INFO L933 BasicCegarLoop]: 419 mSDtfsCounter, 308 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:26:34,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 1364 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-20 06:26:34,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2021-11-20 06:26:34,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 266. [2021-11-20 06:26:34,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 204 states have (on average 1.2794117647058822) internal successors, (261), 207 states have internal predecessors, (261), 45 states have call successors, (45), 17 states have call predecessors, (45), 16 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2021-11-20 06:26:34,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 349 transitions. [2021-11-20 06:26:34,588 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 349 transitions. Word has length 130 [2021-11-20 06:26:34,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:26:34,589 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 349 transitions. [2021-11-20 06:26:34,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-20 06:26:34,590 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 349 transitions. [2021-11-20 06:26:34,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-11-20 06:26:34,596 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:26:34,596 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:26:34,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-20 06:26:34,596 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:26:34,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:26:34,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1056468710, now seen corresponding path program 1 times [2021-11-20 06:26:34,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:26:34,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154101286] [2021-11-20 06:26:34,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:26:34,598 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:26:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:34,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 06:26:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:34,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 06:26:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:34,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 06:26:34,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:34,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:34,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:34,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-20 06:26:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:34,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-20 06:26:34,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:34,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-20 06:26:34,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:35,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-20 06:26:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:35,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-20 06:26:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:35,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-20 06:26:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:35,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-20 06:26:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:35,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-20 06:26:35,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:35,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-20 06:26:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:35,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:35,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:35,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:35,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:35,085 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-11-20 06:26:35,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:26:35,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154101286] [2021-11-20 06:26:35,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154101286] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:26:35,086 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:26:35,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 06:26:35,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249027720] [2021-11-20 06:26:35,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:26:35,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 06:26:35,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:26:35,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 06:26:35,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-20 06:26:35,092 INFO L87 Difference]: Start difference. First operand 266 states and 349 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-20 06:26:37,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:26:37,230 INFO L93 Difference]: Finished difference Result 863 states and 1155 transitions. [2021-11-20 06:26:37,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-20 06:26:37,231 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2021-11-20 06:26:37,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:26:37,241 INFO L225 Difference]: With dead ends: 863 [2021-11-20 06:26:37,241 INFO L226 Difference]: Without dead ends: 859 [2021-11-20 06:26:37,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-11-20 06:26:37,244 INFO L933 BasicCegarLoop]: 408 mSDtfsCounter, 1105 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 486 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 1420 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 486 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-20 06:26:37,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1166 Valid, 1420 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [486 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-20 06:26:37,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2021-11-20 06:26:37,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 772. [2021-11-20 06:26:37,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 594 states have (on average 1.2811447811447811) internal successors, (761), 601 states have internal predecessors, (761), 129 states have call successors, (129), 49 states have call predecessors, (129), 48 states have return successors, (131), 127 states have call predecessors, (131), 127 states have call successors, (131) [2021-11-20 06:26:37,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1021 transitions. [2021-11-20 06:26:37,328 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1021 transitions. Word has length 130 [2021-11-20 06:26:37,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:26:37,329 INFO L470 AbstractCegarLoop]: Abstraction has 772 states and 1021 transitions. [2021-11-20 06:26:37,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-20 06:26:37,330 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1021 transitions. [2021-11-20 06:26:37,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-11-20 06:26:37,332 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:26:37,333 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:26:37,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-20 06:26:37,333 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:26:37,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:26:37,334 INFO L85 PathProgramCache]: Analyzing trace with hash 88761714, now seen corresponding path program 1 times [2021-11-20 06:26:37,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:26:37,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089535195] [2021-11-20 06:26:37,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:26:37,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:26:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:37,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 06:26:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:37,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 06:26:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:37,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 06:26:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:37,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:37,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:37,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:37,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-20 06:26:37,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:37,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-20 06:26:37,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:37,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-20 06:26:37,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:37,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-20 06:26:37,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:37,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-20 06:26:37,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:37,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-20 06:26:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:37,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-20 06:26:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:37,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-20 06:26:37,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:37,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-20 06:26:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:37,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:37,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:37,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-11-20 06:26:37,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:37,585 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-11-20 06:26:37,586 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:26:37,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089535195] [2021-11-20 06:26:37,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089535195] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:26:37,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823779990] [2021-11-20 06:26:37,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:26:37,587 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:26:37,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7786c4a2-93ec-4bf5-80fb-48d9bd08abd3/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:26:37,594 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7786c4a2-93ec-4bf5-80fb-48d9bd08abd3/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:26:37,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7786c4a2-93ec-4bf5-80fb-48d9bd08abd3/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-20 06:26:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:38,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 1269 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-20 06:26:38,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:26:38,574 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-11-20 06:26:38,575 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 06:26:38,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823779990] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:26:38,575 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 06:26:38,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-11-20 06:26:38,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493982728] [2021-11-20 06:26:38,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:26:38,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 06:26:38,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:26:38,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 06:26:38,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-20 06:26:38,579 INFO L87 Difference]: Start difference. First operand 772 states and 1021 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2021-11-20 06:26:38,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:26:38,690 INFO L93 Difference]: Finished difference Result 1538 states and 2037 transitions. [2021-11-20 06:26:38,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 06:26:38,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 140 [2021-11-20 06:26:38,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:26:38,704 INFO L225 Difference]: With dead ends: 1538 [2021-11-20 06:26:38,704 INFO L226 Difference]: Without dead ends: 1280 [2021-11-20 06:26:38,706 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-20 06:26:38,708 INFO L933 BasicCegarLoop]: 652 mSDtfsCounter, 326 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 06:26:38,709 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [326 Valid, 990 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 06:26:38,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2021-11-20 06:26:38,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1025. [2021-11-20 06:26:38,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 789 states have (on average 1.2801013941698351) internal successors, (1010), 798 states have internal predecessors, (1010), 171 states have call successors, (171), 65 states have call predecessors, (171), 64 states have return successors, (173), 169 states have call predecessors, (173), 169 states have call successors, (173) [2021-11-20 06:26:38,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1354 transitions. [2021-11-20 06:26:38,832 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1354 transitions. Word has length 140 [2021-11-20 06:26:38,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:26:38,834 INFO L470 AbstractCegarLoop]: Abstraction has 1025 states and 1354 transitions. [2021-11-20 06:26:38,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2021-11-20 06:26:38,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1354 transitions. [2021-11-20 06:26:38,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-11-20 06:26:38,840 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:26:38,840 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:26:38,890 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7786c4a2-93ec-4bf5-80fb-48d9bd08abd3/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-20 06:26:39,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7786c4a2-93ec-4bf5-80fb-48d9bd08abd3/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:26:39,062 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:26:39,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:26:39,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1821132084, now seen corresponding path program 1 times [2021-11-20 06:26:39,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:26:39,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089896082] [2021-11-20 06:26:39,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:26:39,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:26:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:39,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 06:26:39,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:39,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 06:26:39,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:39,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 06:26:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:39,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:39,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:39,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-20 06:26:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:39,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-20 06:26:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:39,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-20 06:26:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:39,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-20 06:26:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:39,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-20 06:26:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:39,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-20 06:26:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:39,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-20 06:26:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:39,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-20 06:26:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:39,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-20 06:26:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:39,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:39,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:39,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:39,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-20 06:26:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:39,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-11-20 06:26:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:39,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-11-20 06:26:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:39,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:39,382 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-11-20 06:26:39,383 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:26:39,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089896082] [2021-11-20 06:26:39,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089896082] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:26:39,384 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:26:39,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 06:26:39,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661924082] [2021-11-20 06:26:39,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:26:39,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 06:26:39,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:26:39,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 06:26:39,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 06:26:39,386 INFO L87 Difference]: Start difference. First operand 1025 states and 1354 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-20 06:26:40,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:26:40,795 INFO L93 Difference]: Finished difference Result 2698 states and 3689 transitions. [2021-11-20 06:26:40,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 06:26:40,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 184 [2021-11-20 06:26:40,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:26:40,813 INFO L225 Difference]: With dead ends: 2698 [2021-11-20 06:26:40,813 INFO L226 Difference]: Without dead ends: 1681 [2021-11-20 06:26:40,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-20 06:26:40,823 INFO L933 BasicCegarLoop]: 499 mSDtfsCounter, 291 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-20 06:26:40,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [331 Valid, 1699 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-20 06:26:40,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2021-11-20 06:26:40,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1033. [2021-11-20 06:26:40,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 797 states have (on average 1.2772898368883312) internal successors, (1018), 806 states have internal predecessors, (1018), 171 states have call successors, (171), 65 states have call predecessors, (171), 64 states have return successors, (173), 169 states have call predecessors, (173), 169 states have call successors, (173) [2021-11-20 06:26:40,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1362 transitions. [2021-11-20 06:26:40,964 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1362 transitions. Word has length 184 [2021-11-20 06:26:40,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:26:40,965 INFO L470 AbstractCegarLoop]: Abstraction has 1033 states and 1362 transitions. [2021-11-20 06:26:40,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-20 06:26:40,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1362 transitions. [2021-11-20 06:26:40,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-11-20 06:26:40,973 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:26:40,973 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:26:40,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-20 06:26:40,974 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:26:40,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:26:40,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1580348874, now seen corresponding path program 1 times [2021-11-20 06:26:40,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:26:40,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439904907] [2021-11-20 06:26:40,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:26:40,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:26:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:41,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 06:26:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:41,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 06:26:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:41,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 06:26:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:41,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:41,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:41,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:41,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-20 06:26:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:41,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-20 06:26:41,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:41,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-20 06:26:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:41,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-20 06:26:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:41,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-20 06:26:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:41,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-20 06:26:41,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:41,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-20 06:26:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:41,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-20 06:26:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:41,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-20 06:26:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:41,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:41,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:41,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:41,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-20 06:26:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:41,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-11-20 06:26:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:41,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-11-20 06:26:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:41,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:41,276 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-11-20 06:26:41,276 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:26:41,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439904907] [2021-11-20 06:26:41,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439904907] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:26:41,277 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:26:41,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 06:26:41,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788968814] [2021-11-20 06:26:41,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:26:41,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 06:26:41,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:26:41,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 06:26:41,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 06:26:41,282 INFO L87 Difference]: Start difference. First operand 1033 states and 1362 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-20 06:26:42,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:26:42,225 INFO L93 Difference]: Finished difference Result 2178 states and 2895 transitions. [2021-11-20 06:26:42,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 06:26:42,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 184 [2021-11-20 06:26:42,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:26:42,235 INFO L225 Difference]: With dead ends: 2178 [2021-11-20 06:26:42,235 INFO L226 Difference]: Without dead ends: 1153 [2021-11-20 06:26:42,238 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-20 06:26:42,239 INFO L933 BasicCegarLoop]: 319 mSDtfsCounter, 155 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-20 06:26:42,239 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 880 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-20 06:26:42,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2021-11-20 06:26:42,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1037. [2021-11-20 06:26:42,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 801 states have (on average 1.2759051186017478) internal successors, (1022), 810 states have internal predecessors, (1022), 171 states have call successors, (171), 65 states have call predecessors, (171), 64 states have return successors, (173), 169 states have call predecessors, (173), 169 states have call successors, (173) [2021-11-20 06:26:42,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1366 transitions. [2021-11-20 06:26:42,320 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1366 transitions. Word has length 184 [2021-11-20 06:26:42,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:26:42,321 INFO L470 AbstractCegarLoop]: Abstraction has 1037 states and 1366 transitions. [2021-11-20 06:26:42,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-20 06:26:42,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1366 transitions. [2021-11-20 06:26:42,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-11-20 06:26:42,327 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:26:42,327 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:26:42,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-20 06:26:42,328 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:26:42,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:26:42,328 INFO L85 PathProgramCache]: Analyzing trace with hash 347923828, now seen corresponding path program 1 times [2021-11-20 06:26:42,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:26:42,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528564061] [2021-11-20 06:26:42,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:26:42,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:26:42,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:42,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 06:26:42,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:42,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 06:26:42,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:42,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 06:26:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:42,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:42,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:42,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:42,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-20 06:26:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:42,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-20 06:26:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:42,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-20 06:26:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:42,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-20 06:26:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:42,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-20 06:26:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:42,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-20 06:26:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:42,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-20 06:26:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:42,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-20 06:26:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:42,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-20 06:26:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:42,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:42,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:42,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:42,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-20 06:26:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:42,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-11-20 06:26:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:42,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-11-20 06:26:42,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:42,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:42,646 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-11-20 06:26:42,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:26:42,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528564061] [2021-11-20 06:26:42,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528564061] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:26:42,647 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:26:42,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 06:26:42,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107584289] [2021-11-20 06:26:42,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:26:42,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 06:26:42,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:26:42,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 06:26:42,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 06:26:42,650 INFO L87 Difference]: Start difference. First operand 1037 states and 1366 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-20 06:26:44,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:26:44,330 INFO L93 Difference]: Finished difference Result 3838 states and 5391 transitions. [2021-11-20 06:26:44,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 06:26:44,331 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 184 [2021-11-20 06:26:44,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:26:44,359 INFO L225 Difference]: With dead ends: 3838 [2021-11-20 06:26:44,359 INFO L226 Difference]: Without dead ends: 2809 [2021-11-20 06:26:44,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-20 06:26:44,365 INFO L933 BasicCegarLoop]: 667 mSDtfsCounter, 636 mSDsluCounter, 1578 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 2245 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-20 06:26:44,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [709 Valid, 2245 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-20 06:26:44,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2809 states. [2021-11-20 06:26:44,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2809 to 1045. [2021-11-20 06:26:44,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 809 states have (on average 1.273176761433869) internal successors, (1030), 818 states have internal predecessors, (1030), 171 states have call successors, (171), 65 states have call predecessors, (171), 64 states have return successors, (173), 169 states have call predecessors, (173), 169 states have call successors, (173) [2021-11-20 06:26:44,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1374 transitions. [2021-11-20 06:26:44,527 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1374 transitions. Word has length 184 [2021-11-20 06:26:44,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:26:44,528 INFO L470 AbstractCegarLoop]: Abstraction has 1045 states and 1374 transitions. [2021-11-20 06:26:44,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-20 06:26:44,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1374 transitions. [2021-11-20 06:26:44,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-11-20 06:26:44,532 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:26:44,532 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:26:44,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-20 06:26:44,533 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:26:44,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:26:44,533 INFO L85 PathProgramCache]: Analyzing trace with hash 830531558, now seen corresponding path program 1 times [2021-11-20 06:26:44,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:26:44,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232805192] [2021-11-20 06:26:44,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:26:44,534 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:26:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:44,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 06:26:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:44,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 06:26:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:44,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 06:26:44,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:44,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:44,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:44,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-20 06:26:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:44,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-20 06:26:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:44,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-20 06:26:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:44,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-20 06:26:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:44,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-20 06:26:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:44,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-20 06:26:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:44,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-20 06:26:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:44,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-20 06:26:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:44,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-20 06:26:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:44,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:44,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:44,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-20 06:26:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:44,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-11-20 06:26:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:44,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-11-20 06:26:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:44,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:44,828 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-11-20 06:26:44,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:26:44,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232805192] [2021-11-20 06:26:44,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232805192] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:26:44,829 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:26:44,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 06:26:44,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990525016] [2021-11-20 06:26:44,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:26:44,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 06:26:44,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:26:44,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 06:26:44,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 06:26:44,832 INFO L87 Difference]: Start difference. First operand 1045 states and 1374 transitions. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-20 06:26:46,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:26:46,720 INFO L93 Difference]: Finished difference Result 3946 states and 5543 transitions. [2021-11-20 06:26:46,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 06:26:46,721 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 185 [2021-11-20 06:26:46,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:26:46,751 INFO L225 Difference]: With dead ends: 3946 [2021-11-20 06:26:46,751 INFO L226 Difference]: Without dead ends: 2909 [2021-11-20 06:26:46,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-20 06:26:46,759 INFO L933 BasicCegarLoop]: 607 mSDtfsCounter, 737 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 2119 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-20 06:26:46,759 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [807 Valid, 2119 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-20 06:26:46,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2909 states. [2021-11-20 06:26:46,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2909 to 1124. [2021-11-20 06:26:46,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 880 states have (on average 1.2761363636363636) internal successors, (1123), 889 states have internal predecessors, (1123), 179 states have call successors, (179), 65 states have call predecessors, (179), 64 states have return successors, (181), 177 states have call predecessors, (181), 177 states have call successors, (181) [2021-11-20 06:26:46,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1483 transitions. [2021-11-20 06:26:46,939 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1483 transitions. Word has length 185 [2021-11-20 06:26:46,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:26:46,939 INFO L470 AbstractCegarLoop]: Abstraction has 1124 states and 1483 transitions. [2021-11-20 06:26:46,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-20 06:26:46,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1483 transitions. [2021-11-20 06:26:46,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-11-20 06:26:46,945 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:26:46,945 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:26:46,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-20 06:26:46,946 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:26:46,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:26:46,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1883377874, now seen corresponding path program 1 times [2021-11-20 06:26:46,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:26:46,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403189278] [2021-11-20 06:26:46,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:26:46,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:26:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:47,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 06:26:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:47,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 06:26:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:47,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 06:26:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:47,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:47,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:47,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:47,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-20 06:26:47,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:47,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-20 06:26:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:47,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-20 06:26:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:47,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-20 06:26:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:47,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-20 06:26:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:47,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-20 06:26:47,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:47,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-20 06:26:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:47,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-20 06:26:47,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:47,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-20 06:26:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:47,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:47,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:47,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:47,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-20 06:26:47,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:47,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-11-20 06:26:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:47,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-11-20 06:26:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:47,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:47,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:47,269 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-11-20 06:26:47,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:26:47,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403189278] [2021-11-20 06:26:47,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403189278] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:26:47,270 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:26:47,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 06:26:47,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731422024] [2021-11-20 06:26:47,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:26:47,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 06:26:47,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:26:47,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 06:26:47,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 06:26:47,272 INFO L87 Difference]: Start difference. First operand 1124 states and 1483 transitions. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-20 06:26:49,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:26:49,176 INFO L93 Difference]: Finished difference Result 4208 states and 5903 transitions. [2021-11-20 06:26:49,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 06:26:49,177 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 185 [2021-11-20 06:26:49,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:26:49,206 INFO L225 Difference]: With dead ends: 4208 [2021-11-20 06:26:49,207 INFO L226 Difference]: Without dead ends: 3092 [2021-11-20 06:26:49,213 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-20 06:26:49,214 INFO L933 BasicCegarLoop]: 712 mSDtfsCounter, 686 mSDsluCounter, 1738 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 2450 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-20 06:26:49,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [761 Valid, 2450 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-20 06:26:49,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3092 states. [2021-11-20 06:26:49,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3092 to 1132. [2021-11-20 06:26:49,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 888 states have (on average 1.2736486486486487) internal successors, (1131), 897 states have internal predecessors, (1131), 179 states have call successors, (179), 65 states have call predecessors, (179), 64 states have return successors, (181), 177 states have call predecessors, (181), 177 states have call successors, (181) [2021-11-20 06:26:49,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1491 transitions. [2021-11-20 06:26:49,412 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1491 transitions. Word has length 185 [2021-11-20 06:26:49,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:26:49,416 INFO L470 AbstractCegarLoop]: Abstraction has 1132 states and 1491 transitions. [2021-11-20 06:26:49,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-20 06:26:49,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1491 transitions. [2021-11-20 06:26:49,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-11-20 06:26:49,421 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:26:49,421 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:26:49,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-20 06:26:49,422 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:26:49,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:26:49,422 INFO L85 PathProgramCache]: Analyzing trace with hash -124338905, now seen corresponding path program 1 times [2021-11-20 06:26:49,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:26:49,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849505376] [2021-11-20 06:26:49,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:26:49,423 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:26:49,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:49,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 06:26:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:49,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 06:26:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:49,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 06:26:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:49,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:49,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:49,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-20 06:26:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:49,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-20 06:26:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:49,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-20 06:26:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:49,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-20 06:26:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:49,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-20 06:26:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:49,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-20 06:26:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:49,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-20 06:26:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:49,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-20 06:26:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:49,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-20 06:26:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:49,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:49,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:49,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-20 06:26:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:49,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-11-20 06:26:49,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:49,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-11-20 06:26:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:49,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:49,687 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-11-20 06:26:49,688 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:26:49,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849505376] [2021-11-20 06:26:49,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849505376] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:26:49,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536479537] [2021-11-20 06:26:49,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:26:49,689 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:26:49,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7786c4a2-93ec-4bf5-80fb-48d9bd08abd3/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:26:49,694 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7786c4a2-93ec-4bf5-80fb-48d9bd08abd3/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:26:49,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7786c4a2-93ec-4bf5-80fb-48d9bd08abd3/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-20 06:26:50,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:50,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 1545 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-20 06:26:50,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:26:50,611 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-11-20 06:26:50,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:26:51,140 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-11-20 06:26:51,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536479537] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:26:51,141 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:26:51,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2021-11-20 06:26:51,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025727468] [2021-11-20 06:26:51,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:26:51,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-20 06:26:51,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:26:51,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-20 06:26:51,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-20 06:26:51,144 INFO L87 Difference]: Start difference. First operand 1132 states and 1491 transitions. Second operand has 8 states, 8 states have (on average 18.5) internal successors, (148), 6 states have internal predecessors, (148), 5 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2021-11-20 06:26:52,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:26:52,824 INFO L93 Difference]: Finished difference Result 3782 states and 5259 transitions. [2021-11-20 06:26:52,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 06:26:52,825 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.5) internal successors, (148), 6 states have internal predecessors, (148), 5 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 186 [2021-11-20 06:26:52,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:26:52,851 INFO L225 Difference]: With dead ends: 3782 [2021-11-20 06:26:52,851 INFO L226 Difference]: Without dead ends: 2658 [2021-11-20 06:26:52,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-11-20 06:26:52,858 INFO L933 BasicCegarLoop]: 503 mSDtfsCounter, 666 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-20 06:26:52,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [748 Valid, 1665 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-20 06:26:52,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2021-11-20 06:26:53,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 1508. [2021-11-20 06:26:53,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1508 states, 1216 states have (on average 1.278782894736842) internal successors, (1555), 1225 states have internal predecessors, (1555), 227 states have call successors, (227), 65 states have call predecessors, (227), 64 states have return successors, (229), 225 states have call predecessors, (229), 225 states have call successors, (229) [2021-11-20 06:26:53,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2011 transitions. [2021-11-20 06:26:53,107 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 2011 transitions. Word has length 186 [2021-11-20 06:26:53,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:26:53,108 INFO L470 AbstractCegarLoop]: Abstraction has 1508 states and 2011 transitions. [2021-11-20 06:26:53,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.5) internal successors, (148), 6 states have internal predecessors, (148), 5 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2021-11-20 06:26:53,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2011 transitions. [2021-11-20 06:26:53,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2021-11-20 06:26:53,115 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:26:53,116 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:26:53,164 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7786c4a2-93ec-4bf5-80fb-48d9bd08abd3/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-20 06:26:53,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7786c4a2-93ec-4bf5-80fb-48d9bd08abd3/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:26:53,342 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:26:53,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:26:53,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1741248058, now seen corresponding path program 1 times [2021-11-20 06:26:53,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:26:53,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599328139] [2021-11-20 06:26:53,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:26:53,343 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:26:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:53,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 06:26:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:53,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 06:26:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:53,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 06:26:53,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:53,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:53,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:53,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:53,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-20 06:26:53,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:53,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-20 06:26:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:53,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-20 06:26:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:53,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-20 06:26:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:53,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-20 06:26:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:53,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-20 06:26:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:53,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-20 06:26:53,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:53,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-20 06:26:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:53,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-20 06:26:53,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:53,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:53,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:53,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-20 06:26:53,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:53,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-11-20 06:26:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:53,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-11-20 06:26:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:53,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:53,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2021-11-20 06:26:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:53,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:53,678 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2021-11-20 06:26:53,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:26:53,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599328139] [2021-11-20 06:26:53,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599328139] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:26:53,679 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:26:53,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 06:26:53,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836330159] [2021-11-20 06:26:53,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:26:53,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 06:26:53,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:26:53,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 06:26:53,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 06:26:53,682 INFO L87 Difference]: Start difference. First operand 1508 states and 2011 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-20 06:26:55,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:26:55,262 INFO L93 Difference]: Finished difference Result 2373 states and 3203 transitions. [2021-11-20 06:26:55,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 06:26:55,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 198 [2021-11-20 06:26:55,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:26:55,275 INFO L225 Difference]: With dead ends: 2373 [2021-11-20 06:26:55,275 INFO L226 Difference]: Without dead ends: 1220 [2021-11-20 06:26:55,280 INFO L932 BasicCegarLoop]: 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 [2021-11-20 06:26:55,281 INFO L933 BasicCegarLoop]: 617 mSDtfsCounter, 439 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 1460 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-20 06:26:55,282 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [482 Valid, 1460 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-20 06:26:55,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2021-11-20 06:26:55,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1128. [2021-11-20 06:26:55,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 908 states have (on average 1.263215859030837) internal successors, (1147), 915 states have internal predecessors, (1147), 171 states have call successors, (171), 49 states have call predecessors, (171), 48 states have return successors, (171), 169 states have call predecessors, (171), 169 states have call successors, (171) [2021-11-20 06:26:55,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1489 transitions. [2021-11-20 06:26:55,464 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1489 transitions. Word has length 198 [2021-11-20 06:26:55,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:26:55,465 INFO L470 AbstractCegarLoop]: Abstraction has 1128 states and 1489 transitions. [2021-11-20 06:26:55,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-20 06:26:55,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1489 transitions. [2021-11-20 06:26:55,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2021-11-20 06:26:55,472 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:26:55,472 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:26:55,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-20 06:26:55,473 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:26:55,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:26:55,474 INFO L85 PathProgramCache]: Analyzing trace with hash -829148697, now seen corresponding path program 1 times [2021-11-20 06:26:55,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:26:55,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409394714] [2021-11-20 06:26:55,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:26:55,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:26:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:55,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 06:26:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:55,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 06:26:55,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:55,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 06:26:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:55,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:55,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:55,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:55,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-20 06:26:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:55,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-20 06:26:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:55,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-20 06:26:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:55,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-20 06:26:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:55,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-20 06:26:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:55,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-20 06:26:55,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:55,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-20 06:26:55,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:55,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-20 06:26:55,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:55,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-20 06:26:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:55,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:55,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:55,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-20 06:26:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:55,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-11-20 06:26:55,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:55,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-11-20 06:26:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:55,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:55,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:55,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2021-11-20 06:26:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:55,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:55,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2021-11-20 06:26:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:55,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:55,775 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2021-11-20 06:26:55,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:26:55,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409394714] [2021-11-20 06:26:55,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409394714] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:26:55,776 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:26:55,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 06:26:55,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503364050] [2021-11-20 06:26:55,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:26:55,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 06:26:55,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:26:55,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 06:26:55,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 06:26:55,779 INFO L87 Difference]: Start difference. First operand 1128 states and 1489 transitions. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-20 06:26:57,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:26:57,220 INFO L93 Difference]: Finished difference Result 3214 states and 4411 transitions. [2021-11-20 06:26:57,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 06:26:57,221 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 220 [2021-11-20 06:26:57,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:26:57,239 INFO L225 Difference]: With dead ends: 3214 [2021-11-20 06:26:57,240 INFO L226 Difference]: Without dead ends: 2094 [2021-11-20 06:26:57,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-20 06:26:57,246 INFO L933 BasicCegarLoop]: 546 mSDtfsCounter, 491 mSDsluCounter, 1279 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 1825 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-20 06:26:57,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [532 Valid, 1825 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-20 06:26:57,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2021-11-20 06:26:57,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 1134. [2021-11-20 06:26:57,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 914 states have (on average 1.2614879649890591) internal successors, (1153), 921 states have internal predecessors, (1153), 171 states have call successors, (171), 49 states have call predecessors, (171), 48 states have return successors, (171), 169 states have call predecessors, (171), 169 states have call successors, (171) [2021-11-20 06:26:57,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1495 transitions. [2021-11-20 06:26:57,459 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1495 transitions. Word has length 220 [2021-11-20 06:26:57,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:26:57,460 INFO L470 AbstractCegarLoop]: Abstraction has 1134 states and 1495 transitions. [2021-11-20 06:26:57,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-20 06:26:57,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1495 transitions. [2021-11-20 06:26:57,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2021-11-20 06:26:57,469 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:26:57,469 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:26:57,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-20 06:26:57,469 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:26:57,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:26:57,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1357206825, now seen corresponding path program 1 times [2021-11-20 06:26:57,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:26:57,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558874120] [2021-11-20 06:26:57,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:26:57,471 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:26:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:57,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 06:26:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:57,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 06:26:57,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:57,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 06:26:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:57,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:57,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:57,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:57,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-20 06:26:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:57,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-20 06:26:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:57,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-20 06:26:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:57,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-20 06:26:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:57,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-20 06:26:57,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:57,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-20 06:26:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:57,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-20 06:26:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:57,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-20 06:26:57,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:57,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-20 06:26:57,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:57,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:57,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:57,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:57,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-20 06:26:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:57,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-11-20 06:26:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:57,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-11-20 06:26:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:57,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:57,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2021-11-20 06:26:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:57,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:57,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2021-11-20 06:26:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:57,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:57,806 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2021-11-20 06:26:57,807 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:26:57,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558874120] [2021-11-20 06:26:57,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558874120] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:26:57,807 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:26:57,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 06:26:57,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777616385] [2021-11-20 06:26:57,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:26:57,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 06:26:57,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:26:57,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 06:26:57,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 06:26:57,814 INFO L87 Difference]: Start difference. First operand 1134 states and 1495 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2021-11-20 06:26:59,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:26:59,025 INFO L93 Difference]: Finished difference Result 2163 states and 2861 transitions. [2021-11-20 06:26:59,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 06:26:59,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 236 [2021-11-20 06:26:59,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:26:59,036 INFO L225 Difference]: With dead ends: 2163 [2021-11-20 06:26:59,037 INFO L226 Difference]: Without dead ends: 1037 [2021-11-20 06:26:59,041 INFO L932 BasicCegarLoop]: 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 [2021-11-20 06:26:59,042 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 529 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-20 06:26:59,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [552 Valid, 905 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-20 06:26:59,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2021-11-20 06:26:59,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 947. [2021-11-20 06:26:59,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 747 states have (on average 1.2449799196787148) internal successors, (930), 754 states have internal predecessors, (930), 151 states have call successors, (151), 49 states have call predecessors, (151), 48 states have return successors, (151), 149 states have call predecessors, (151), 149 states have call successors, (151) [2021-11-20 06:26:59,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1232 transitions. [2021-11-20 06:26:59,173 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1232 transitions. Word has length 236 [2021-11-20 06:26:59,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:26:59,174 INFO L470 AbstractCegarLoop]: Abstraction has 947 states and 1232 transitions. [2021-11-20 06:26:59,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2021-11-20 06:26:59,174 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1232 transitions. [2021-11-20 06:26:59,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2021-11-20 06:26:59,180 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:26:59,180 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:26:59,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-20 06:26:59,181 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:26:59,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:26:59,181 INFO L85 PathProgramCache]: Analyzing trace with hash 533574185, now seen corresponding path program 2 times [2021-11-20 06:26:59,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:26:59,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459024321] [2021-11-20 06:26:59,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:26:59,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:26:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:59,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 06:26:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:59,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 06:26:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:59,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 06:26:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:59,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:59,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:59,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:59,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-20 06:26:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:59,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-20 06:26:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:59,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-20 06:26:59,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:59,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-20 06:26:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:59,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-20 06:26:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:59,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-20 06:26:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:59,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-20 06:26:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:59,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-20 06:26:59,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:59,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-20 06:26:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:59,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:59,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:59,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-20 06:26:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:59,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-11-20 06:26:59,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:59,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-11-20 06:26:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:59,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:59,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2021-11-20 06:26:59,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:59,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:59,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:59,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2021-11-20 06:26:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:59,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:26:59,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:59,587 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-11-20 06:26:59,587 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:26:59,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459024321] [2021-11-20 06:26:59,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459024321] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:26:59,588 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:26:59,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 06:26:59,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555280012] [2021-11-20 06:26:59,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:26:59,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 06:26:59,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:26:59,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 06:26:59,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-20 06:26:59,590 INFO L87 Difference]: Start difference. First operand 947 states and 1232 transitions. Second operand has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 5 states have internal predecessors, (137), 5 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2021-11-20 06:27:00,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:27:00,978 INFO L93 Difference]: Finished difference Result 1373 states and 1820 transitions. [2021-11-20 06:27:00,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 06:27:00,979 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 5 states have internal predecessors, (137), 5 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 236 [2021-11-20 06:27:00,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:27:00,980 INFO L225 Difference]: With dead ends: 1373 [2021-11-20 06:27:00,980 INFO L226 Difference]: Without dead ends: 0 [2021-11-20 06:27:00,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2021-11-20 06:27:00,987 INFO L933 BasicCegarLoop]: 368 mSDtfsCounter, 863 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:27:00,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [932 Valid, 884 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-20 06:27:00,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-20 06:27:00,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-20 06:27:00,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:27:00,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-20 06:27:00,989 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 236 [2021-11-20 06:27:00,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:27:00,990 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-20 06:27:00,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 5 states have internal predecessors, (137), 5 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2021-11-20 06:27:00,990 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-20 06:27:00,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-20 06:27:00,993 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-20 06:27:00,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-20 06:27:00,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-20 06:29:05,482 WARN L227 SmtUtils]: Spent 6.16s on a formula simplification. DAG size of input: 219 DAG size of output: 171 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-11-20 06:31:01,224 INFO L858 garLoopResultBuilder]: For program point kfreeEXIT(lines 2594 2596) no Hoare annotation was computed. [2021-11-20 06:31:01,225 INFO L854 garLoopResultBuilder]: At program point kfreeENTRY(lines 2594 2596) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse2 (not (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (.cse1 (= |old(#valid)| |#valid|))) (and (or .cse0 (not (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) .cse1) (or .cse0 .cse2 .cse1) (or .cse3 (not (<= 6 ~ldv_count_1~0)) (not (= ~ldv_count_2~0 0)) .cse1) (or .cse3 (not (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) .cse2 .cse1))) [2021-11-20 06:31:01,225 INFO L858 garLoopResultBuilder]: For program point kfreeFINAL(lines 2594 2596) no Hoare annotation was computed. [2021-11-20 06:31:01,226 INFO L858 garLoopResultBuilder]: For program point ipmi_destroy_userEXIT(lines 2553 2555) no Hoare annotation was computed. [2021-11-20 06:31:01,226 INFO L861 garLoopResultBuilder]: At program point ipmi_destroy_userENTRY(lines 2553 2555) the Hoare annotation is: true [2021-11-20 06:31:01,226 INFO L858 garLoopResultBuilder]: For program point ipmi_destroy_userFINAL(lines 2553 2555) no Hoare annotation was computed. [2021-11-20 06:31:01,226 INFO L858 garLoopResultBuilder]: For program point ldv_device_create_file_dev_attr_of_sensor_device_attributeFINAL(lines 2470 2484) no Hoare annotation was computed. [2021-11-20 06:31:01,226 INFO L854 garLoopResultBuilder]: At program point L2478(line 2478) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (not (<= 1 |old(~ldv_call_dev_attr_of_sensor_device_attribute~0)|))) (.cse2 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)))) (and (or .cse0 .cse1 (not (<= (+ 5 |old(~ldv_count_2~0)|) ~ldv_count_1~0))) (or .cse0 (not (<= 6 ~ldv_count_1~0)) (not (= |old(~ldv_count_2~0)| 0))) (or .cse2 .cse1) (or .cse2 (not (<= (+ |old(~ldv_count_2~0)| 1) ~ldv_count_1~0))))) [2021-11-20 06:31:01,227 INFO L858 garLoopResultBuilder]: For program point L2476(lines 2476 2479) no Hoare annotation was computed. [2021-11-20 06:31:01,227 INFO L858 garLoopResultBuilder]: For program point L2473-1(lines 2473 2481) no Hoare annotation was computed. [2021-11-20 06:31:01,227 INFO L854 garLoopResultBuilder]: At program point ldv_device_create_file_dev_attr_of_sensor_device_attributeENTRY(lines 2470 2484) the Hoare annotation is: (let ((.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse2 (not (<= 1 |old(~ldv_call_dev_attr_of_sensor_device_attribute~0)|))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse1 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)))) (and (or (and .cse0 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) .cse1 .cse2 (not (<= (+ 5 |old(~ldv_count_2~0)|) ~ldv_count_1~0))) (or .cse3 (not (<= (+ |old(~ldv_count_2~0)| 1) ~ldv_count_1~0)) (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (or .cse3 .cse0 .cse2) (or (not (<= (+ 2 |old(~ldv_count_2~0)|) ~ldv_count_1~0)) .cse3 (<= (+ 2 ~ldv_count_2~0) ~ldv_count_1~0)) (or .cse1 (not (<= 6 ~ldv_count_1~0)) (not (= |old(~ldv_count_2~0)| 0)) (= ~ldv_count_2~0 0)))) [2021-11-20 06:31:01,227 INFO L858 garLoopResultBuilder]: For program point L2473(lines 2473 2481) no Hoare annotation was computed. [2021-11-20 06:31:01,228 INFO L858 garLoopResultBuilder]: For program point ldv_device_create_file_dev_attr_of_sensor_device_attributeEXIT(lines 2470 2484) no Hoare annotation was computed. [2021-11-20 06:31:01,228 INFO L861 garLoopResultBuilder]: At program point wait_for_completionENTRY(lines 2590 2592) the Hoare annotation is: true [2021-11-20 06:31:01,228 INFO L858 garLoopResultBuilder]: For program point wait_for_completionEXIT(lines 2590 2592) no Hoare annotation was computed. [2021-11-20 06:31:01,228 INFO L858 garLoopResultBuilder]: For program point wait_for_completionFINAL(lines 2590 2592) no Hoare annotation was computed. [2021-11-20 06:31:01,228 INFO L858 garLoopResultBuilder]: For program point hwmon_device_unregisterFINAL(lines 2545 2547) no Hoare annotation was computed. [2021-11-20 06:31:01,229 INFO L861 garLoopResultBuilder]: At program point hwmon_device_unregisterENTRY(lines 2545 2547) the Hoare annotation is: true [2021-11-20 06:31:01,229 INFO L858 garLoopResultBuilder]: For program point hwmon_device_unregisterEXIT(lines 2545 2547) no Hoare annotation was computed. [2021-11-20 06:31:01,229 INFO L858 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 2412 2417) no Hoare annotation was computed. [2021-11-20 06:31:01,229 INFO L861 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 2412 2417) the Hoare annotation is: true [2021-11-20 06:31:01,229 INFO L858 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2415) no Hoare annotation was computed. [2021-11-20 06:31:01,230 INFO L858 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 2412 2417) no Hoare annotation was computed. [2021-11-20 06:31:01,230 INFO L854 garLoopResultBuilder]: At program point L1662(line 1662) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse2 (not (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse1 (not (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0))) (or .cse3 (not (<= 6 ~ldv_count_1~0)) (not (= ~ldv_count_2~0 0)) .cse1) (or .cse3 (not (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) .cse1 .cse2))) [2021-11-20 06:31:01,230 INFO L858 garLoopResultBuilder]: For program point L1662-1(line 1662) no Hoare annotation was computed. [2021-11-20 06:31:01,230 INFO L858 garLoopResultBuilder]: For program point kzallocEXIT(lines 1658 1665) no Hoare annotation was computed. [2021-11-20 06:31:01,231 INFO L854 garLoopResultBuilder]: At program point kzallocENTRY(lines 1658 1665) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse2 (not (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse1 (not (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0))) (or .cse3 (not (<= 6 ~ldv_count_1~0)) (not (= ~ldv_count_2~0 0)) .cse1) (or .cse3 (not (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) .cse1 .cse2))) [2021-11-20 06:31:01,231 INFO L858 garLoopResultBuilder]: For program point kzallocFINAL(lines 1658 1665) no Hoare annotation was computed. [2021-11-20 06:31:01,231 INFO L854 garLoopResultBuilder]: At program point kmallocENTRY(lines 1649 1656) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse2 (not (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse1 (not (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0))) (or .cse3 (not (<= 6 ~ldv_count_1~0)) (not (= ~ldv_count_2~0 0)) .cse1) (or .cse3 (not (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) .cse1 .cse2))) [2021-11-20 06:31:01,231 INFO L854 garLoopResultBuilder]: At program point L1646(line 1646) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse2 (not (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse1 (not (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0))) (or .cse3 (not (<= 6 ~ldv_count_1~0)) (not (= ~ldv_count_2~0 0)) .cse1) (or .cse3 (not (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) .cse1 .cse2))) [2021-11-20 06:31:01,231 INFO L858 garLoopResultBuilder]: For program point L1646-1(line 1646) no Hoare annotation was computed. [2021-11-20 06:31:01,232 INFO L861 garLoopResultBuilder]: At program point L1646-2(lines 1644 1647) the Hoare annotation is: true [2021-11-20 06:31:01,232 INFO L858 garLoopResultBuilder]: For program point kmallocFINAL(lines 1649 1656) no Hoare annotation was computed. [2021-11-20 06:31:01,232 INFO L858 garLoopResultBuilder]: For program point kmallocEXIT(lines 1649 1656) no Hoare annotation was computed. [2021-11-20 06:31:01,232 INFO L861 garLoopResultBuilder]: At program point L1567(lines 1564 1569) the Hoare annotation is: true [2021-11-20 06:31:01,232 INFO L861 garLoopResultBuilder]: At program point L1583(lines 1578 1585) the Hoare annotation is: true [2021-11-20 06:31:01,233 INFO L858 garLoopResultBuilder]: For program point extract_valueFINAL(lines 1676 1683) no Hoare annotation was computed. [2021-11-20 06:31:01,233 INFO L858 garLoopResultBuilder]: For program point extract_valueEXIT(lines 1676 1683) no Hoare annotation was computed. [2021-11-20 06:31:01,233 INFO L861 garLoopResultBuilder]: At program point L1575(lines 1570 1577) the Hoare annotation is: true [2021-11-20 06:31:01,233 INFO L861 garLoopResultBuilder]: At program point extract_valueENTRY(lines 1676 1683) the Hoare annotation is: true [2021-11-20 06:31:01,233 INFO L858 garLoopResultBuilder]: For program point L2203-1(line 2203) no Hoare annotation was computed. [2021-11-20 06:31:01,234 INFO L861 garLoopResultBuilder]: At program point L2234(line 2234) the Hoare annotation is: true [2021-11-20 06:31:01,234 INFO L854 garLoopResultBuilder]: At program point L2203(line 2203) the Hoare annotation is: (= |old(#valid)| |#valid|) [2021-11-20 06:31:01,234 INFO L861 garLoopResultBuilder]: At program point L2232(line 2232) the Hoare annotation is: true [2021-11-20 06:31:01,234 INFO L861 garLoopResultBuilder]: At program point L2230(line 2230) the Hoare annotation is: true [2021-11-20 06:31:01,234 INFO L858 garLoopResultBuilder]: For program point L2232-1(line 2232) no Hoare annotation was computed. [2021-11-20 06:31:01,235 INFO L858 garLoopResultBuilder]: For program point ibmpex_bmc_deleteEXIT(lines 2197 2237) no Hoare annotation was computed. [2021-11-20 06:31:01,235 INFO L858 garLoopResultBuilder]: For program point L2230-1(line 2230) no Hoare annotation was computed. [2021-11-20 06:31:01,235 INFO L861 garLoopResultBuilder]: At program point L2226(lines 2201 2236) the Hoare annotation is: true [2021-11-20 06:31:01,235 INFO L861 garLoopResultBuilder]: At program point L2224(lines 2201 2236) the Hoare annotation is: true [2021-11-20 06:31:01,235 INFO L861 garLoopResultBuilder]: At program point L2220(lines 2201 2236) the Hoare annotation is: true [2021-11-20 06:31:01,236 INFO L861 garLoopResultBuilder]: At program point L2218(lines 2201 2236) the Hoare annotation is: true [2021-11-20 06:31:01,236 INFO L861 garLoopResultBuilder]: At program point L2216(lines 2201 2236) the Hoare annotation is: true [2021-11-20 06:31:01,236 INFO L861 garLoopResultBuilder]: At program point L2214(line 2214) the Hoare annotation is: true [2021-11-20 06:31:01,236 INFO L858 garLoopResultBuilder]: For program point L2214-1(line 2214) no Hoare annotation was computed. [2021-11-20 06:31:01,236 INFO L858 garLoopResultBuilder]: For program point L2210(lines 2210 2213) no Hoare annotation was computed. [2021-11-20 06:31:01,236 INFO L854 garLoopResultBuilder]: At program point L2202(line 2202) the Hoare annotation is: (= |old(#valid)| |#valid|) [2021-11-20 06:31:01,237 INFO L858 garLoopResultBuilder]: For program point L2233-1(line 2233) no Hoare annotation was computed. [2021-11-20 06:31:01,237 INFO L858 garLoopResultBuilder]: For program point L2202-1(line 2202) no Hoare annotation was computed. [2021-11-20 06:31:01,237 INFO L861 garLoopResultBuilder]: At program point L2233(line 2233) the Hoare annotation is: true [2021-11-20 06:31:01,237 INFO L861 garLoopResultBuilder]: At program point L2582(lines 2581 2583) the Hoare annotation is: true [2021-11-20 06:31:01,237 INFO L858 garLoopResultBuilder]: For program point L2231-1(line 2231) no Hoare annotation was computed. [2021-11-20 06:31:01,238 INFO L861 garLoopResultBuilder]: At program point L2231(line 2231) the Hoare annotation is: true [2021-11-20 06:31:01,238 INFO L858 garLoopResultBuilder]: For program point L2225(lines 2225 2228) no Hoare annotation was computed. [2021-11-20 06:31:01,238 INFO L854 garLoopResultBuilder]: At program point ibmpex_bmc_deleteENTRY(lines 2197 2237) the Hoare annotation is: (= |old(#valid)| |#valid|) [2021-11-20 06:31:01,238 INFO L858 garLoopResultBuilder]: For program point ibmpex_bmc_deleteFINAL(lines 2197 2237) no Hoare annotation was computed. [2021-11-20 06:31:01,238 INFO L858 garLoopResultBuilder]: For program point L2215-1(line 2215) no Hoare annotation was computed. [2021-11-20 06:31:01,239 INFO L861 garLoopResultBuilder]: At program point L2215(line 2215) the Hoare annotation is: true [2021-11-20 06:31:01,239 INFO L858 garLoopResultBuilder]: For program point ldv_handler_precallEXIT(lines 2578 2580) no Hoare annotation was computed. [2021-11-20 06:31:01,239 INFO L861 garLoopResultBuilder]: At program point ldv_handler_precallFINAL(lines 2578 2580) the Hoare annotation is: true [2021-11-20 06:31:01,239 INFO L858 garLoopResultBuilder]: For program point ldv_is_errEXIT(lines 2424 2429) no Hoare annotation was computed. [2021-11-20 06:31:01,239 INFO L861 garLoopResultBuilder]: At program point ldv_is_errENTRY(lines 2424 2429) the Hoare annotation is: true [2021-11-20 06:31:01,240 INFO L858 garLoopResultBuilder]: For program point ldv_is_errFINAL(lines 2424 2429) no Hoare annotation was computed. [2021-11-20 06:31:01,240 INFO L861 garLoopResultBuilder]: At program point ipmi_free_recv_msgENTRY(lines 2556 2558) the Hoare annotation is: true [2021-11-20 06:31:01,240 INFO L858 garLoopResultBuilder]: For program point ipmi_free_recv_msgEXIT(lines 2556 2558) no Hoare annotation was computed. [2021-11-20 06:31:01,240 INFO L858 garLoopResultBuilder]: For program point ipmi_free_recv_msgFINAL(lines 2556 2558) no Hoare annotation was computed. [2021-11-20 06:31:01,240 INFO L854 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 1634 1643) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse2 (not (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse1 (not (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0))) (or .cse3 (not (<= 6 ~ldv_count_1~0)) (not (= ~ldv_count_2~0 0)) .cse1) (or .cse3 (not (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) .cse1 .cse2))) [2021-11-20 06:31:01,241 INFO L858 garLoopResultBuilder]: For program point L1630(line 1630) no Hoare annotation was computed. [2021-11-20 06:31:01,241 INFO L858 garLoopResultBuilder]: For program point L1629(lines 1629 1631) no Hoare annotation was computed. [2021-11-20 06:31:01,241 INFO L858 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 1634 1643) no Hoare annotation was computed. [2021-11-20 06:31:01,241 INFO L861 garLoopResultBuilder]: At program point L1638(line 1638) the Hoare annotation is: true [2021-11-20 06:31:01,241 INFO L858 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 1634 1643) no Hoare annotation was computed. [2021-11-20 06:31:01,242 INFO L858 garLoopResultBuilder]: For program point L1638-1(line 1638) no Hoare annotation was computed. [2021-11-20 06:31:01,242 INFO L858 garLoopResultBuilder]: For program point L1636(lines 1636 1642) no Hoare annotation was computed. [2021-11-20 06:31:01,242 INFO L861 garLoopResultBuilder]: At program point L2561(lines 2560 2562) the Hoare annotation is: true [2021-11-20 06:31:01,242 INFO L858 garLoopResultBuilder]: For program point ibmpex_send_messageEXIT(lines 1695 1719) no Hoare annotation was computed. [2021-11-20 06:31:01,242 INFO L858 garLoopResultBuilder]: For program point ibmpex_send_messageFINAL(lines 1695 1719) no Hoare annotation was computed. [2021-11-20 06:31:01,243 INFO L854 garLoopResultBuilder]: At program point L2573(lines 2572 2574) the Hoare annotation is: (let ((.cse1 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse2 (not (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (.cse0 (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)))) (and (or .cse0 .cse1 (not (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0))) (or .cse0 .cse1 .cse2) (or .cse0 .cse3 (not (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) .cse2) (or .cse0 .cse3 (not (<= 6 ~ldv_count_1~0)) (not (= ~ldv_count_2~0 0))))) [2021-11-20 06:31:01,243 INFO L861 garLoopResultBuilder]: At program point L1708(lines 1698 1718) the Hoare annotation is: true [2021-11-20 06:31:01,243 INFO L858 garLoopResultBuilder]: For program point L1707(lines 1707 1710) no Hoare annotation was computed. [2021-11-20 06:31:01,243 INFO L854 garLoopResultBuilder]: At program point ibmpex_send_messageENTRY(lines 1695 1719) the Hoare annotation is: (let ((.cse1 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse2 (not (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (.cse0 (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)))) (and (or .cse0 .cse1 (not (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0))) (or .cse0 .cse1 .cse2) (or .cse0 .cse3 (not (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) .cse2) (or .cse0 .cse3 (not (<= 6 ~ldv_count_1~0)) (not (= ~ldv_count_2~0 0))))) [2021-11-20 06:31:01,244 INFO L854 garLoopResultBuilder]: At program point L1701(lines 1698 1718) the Hoare annotation is: (let ((.cse1 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse2 (not (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (.cse0 (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)))) (and (or .cse0 .cse1 (not (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0))) (or .cse0 .cse1 .cse2) (or .cse0 .cse3 (not (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) .cse2) (or .cse0 .cse3 (not (<= 6 ~ldv_count_1~0)) (not (= ~ldv_count_2~0 0))))) [2021-11-20 06:31:01,244 INFO L858 garLoopResultBuilder]: For program point L1700(lines 1700 1703) no Hoare annotation was computed. [2021-11-20 06:31:01,244 INFO L858 garLoopResultBuilder]: For program point device_remove_fileEXIT(lines 2539 2541) no Hoare annotation was computed. [2021-11-20 06:31:01,244 INFO L861 garLoopResultBuilder]: At program point device_remove_fileENTRY(lines 2539 2541) the Hoare annotation is: true [2021-11-20 06:31:01,244 INFO L858 garLoopResultBuilder]: For program point device_remove_fileFINAL(lines 2539 2541) no Hoare annotation was computed. [2021-11-20 06:31:01,244 INFO L858 garLoopResultBuilder]: For program point L2282(line 2282) no Hoare annotation was computed. [2021-11-20 06:31:01,245 INFO L854 garLoopResultBuilder]: At program point L2249-1(lines 2238 2252) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,245 INFO L854 garLoopResultBuilder]: At program point L2249(line 2249) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,245 INFO L858 garLoopResultBuilder]: For program point L2084(lines 2084 2087) no Hoare annotation was computed. [2021-11-20 06:31:01,245 INFO L858 garLoopResultBuilder]: For program point L1985(lines 1985 1988) no Hoare annotation was computed. [2021-11-20 06:31:01,246 INFO L854 garLoopResultBuilder]: At program point L2514(lines 2513 2515) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,246 INFO L861 garLoopResultBuilder]: At program point L2316(lines 2302 2320) the Hoare annotation is: true [2021-11-20 06:31:01,246 INFO L858 garLoopResultBuilder]: For program point L2349(lines 2349 2364) no Hoare annotation was computed. [2021-11-20 06:31:01,246 INFO L854 garLoopResultBuilder]: At program point L2184(lines 2138 2195) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,246 INFO L854 garLoopResultBuilder]: At program point L2118(lines 2024 2129) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse3 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0) .cse2) (and (<= 6 ~ldv_count_1~0) .cse3 (= ~ldv_count_2~0 0) .cse2))) [2021-11-20 06:31:01,247 INFO L854 garLoopResultBuilder]: At program point L2085(lines 2024 2129) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,247 INFO L858 garLoopResultBuilder]: For program point L1920(lines 1920 1923) no Hoare annotation was computed. [2021-11-20 06:31:01,247 INFO L858 garLoopResultBuilder]: For program point L2350(line 2350) no Hoare annotation was computed. [2021-11-20 06:31:01,247 INFO L858 garLoopResultBuilder]: For program point L2383-1(line 2383) no Hoare annotation was computed. [2021-11-20 06:31:01,247 INFO L854 garLoopResultBuilder]: At program point L2383(line 2383) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,248 INFO L854 garLoopResultBuilder]: At program point L2284(lines 2254 2286) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,248 INFO L858 garLoopResultBuilder]: For program point L1954(lines 1954 1957) no Hoare annotation was computed. [2021-11-20 06:31:01,248 INFO L854 garLoopResultBuilder]: At program point L2384(lines 2379 2386) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,248 INFO L858 garLoopResultBuilder]: For program point L2351-1(line 2351) no Hoare annotation was computed. [2021-11-20 06:31:01,249 INFO L854 garLoopResultBuilder]: At program point L2351(line 2351) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,249 INFO L858 garLoopResultBuilder]: For program point L2153(lines 2153 2158) no Hoare annotation was computed. [2021-11-20 06:31:01,249 INFO L858 garLoopResultBuilder]: For program point L1856(lines 1856 1859) no Hoare annotation was computed. [2021-11-20 06:31:01,249 INFO L854 garLoopResultBuilder]: At program point L2550(lines 2549 2551) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,249 INFO L854 garLoopResultBuilder]: At program point L2517(lines 2516 2518) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,250 INFO L861 garLoopResultBuilder]: At program point L2319(lines 2295 2321) the Hoare annotation is: true [2021-11-20 06:31:01,250 INFO L858 garLoopResultBuilder]: For program point L1989(lines 1989 1995) no Hoare annotation was computed. [2021-11-20 06:31:01,250 INFO L854 garLoopResultBuilder]: At program point L2122(lines 2024 2129) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,250 INFO L858 garLoopResultBuilder]: For program point L2089(lines 2089 2092) no Hoare annotation was computed. [2021-11-20 06:31:01,250 INFO L854 garLoopResultBuilder]: At program point L1726(line 1726) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,251 INFO L858 garLoopResultBuilder]: For program point L1726-1(line 1726) no Hoare annotation was computed. [2021-11-20 06:31:01,251 INFO L854 garLoopResultBuilder]: At program point L1594(lines 1590 1596) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,251 INFO L858 garLoopResultBuilder]: For program point L2354(line 2354) no Hoare annotation was computed. [2021-11-20 06:31:01,251 INFO L858 garLoopResultBuilder]: For program point L2189-1(line 2189) no Hoare annotation was computed. [2021-11-20 06:31:01,252 INFO L854 garLoopResultBuilder]: At program point L2189(line 2189) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,252 INFO L858 garLoopResultBuilder]: For program point L2123(lines 2123 2126) no Hoare annotation was computed. [2021-11-20 06:31:01,252 INFO L858 garLoopResultBuilder]: For program point L2057(lines 2057 2064) no Hoare annotation was computed. [2021-11-20 06:31:01,252 INFO L858 garLoopResultBuilder]: For program point L2057-1(lines 2048 2065) no Hoare annotation was computed. [2021-11-20 06:31:01,252 INFO L858 garLoopResultBuilder]: For program point L1925(lines 1925 1928) no Hoare annotation was computed. [2021-11-20 06:31:01,253 INFO L854 garLoopResultBuilder]: At program point L1727(line 1727) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,253 INFO L858 garLoopResultBuilder]: For program point L1727-1(line 1727) no Hoare annotation was computed. [2021-11-20 06:31:01,253 INFO L854 garLoopResultBuilder]: At program point L2520(lines 2519 2521) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,253 INFO L858 garLoopResultBuilder]: For program point L2355-1(line 2355) no Hoare annotation was computed. [2021-11-20 06:31:01,253 INFO L854 garLoopResultBuilder]: At program point L2355(line 2355) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,254 INFO L854 garLoopResultBuilder]: At program point L2190(lines 2138 2195) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,254 INFO L854 garLoopResultBuilder]: At program point L2124(lines 2024 2129) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,254 INFO L858 garLoopResultBuilder]: For program point L1992(lines 1992 1995) no Hoare annotation was computed. [2021-11-20 06:31:01,254 INFO L858 garLoopResultBuilder]: For program point L1992-2(lines 1989 1995) no Hoare annotation was computed. [2021-11-20 06:31:01,254 INFO L854 garLoopResultBuilder]: At program point L1761(line 1761) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,255 INFO L858 garLoopResultBuilder]: For program point L1728(line 1728) no Hoare annotation was computed. [2021-11-20 06:31:01,255 INFO L858 garLoopResultBuilder]: For program point L1761-1(line 1761) no Hoare annotation was computed. [2021-11-20 06:31:01,255 INFO L858 garLoopResultBuilder]: For program point L1728-2(lines 1728 1731) no Hoare annotation was computed. [2021-11-20 06:31:01,255 INFO L858 garLoopResultBuilder]: For program point L2191-1(line 2191) no Hoare annotation was computed. [2021-11-20 06:31:01,255 INFO L854 garLoopResultBuilder]: At program point L2191(line 2191) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,256 INFO L854 garLoopResultBuilder]: At program point L1762(line 1762) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,256 INFO L858 garLoopResultBuilder]: For program point L1762-1(line 1762) no Hoare annotation was computed. [2021-11-20 06:31:01,256 INFO L858 garLoopResultBuilder]: For program point L2489-1(lines 2489 2497) no Hoare annotation was computed. [2021-11-20 06:31:01,256 INFO L858 garLoopResultBuilder]: For program point L2489(lines 2489 2497) no Hoare annotation was computed. [2021-11-20 06:31:01,256 INFO L854 garLoopResultBuilder]: At program point L2192(lines 2138 2195) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,257 INFO L858 garLoopResultBuilder]: For program point L1763(line 1763) no Hoare annotation was computed. [2021-11-20 06:31:01,257 INFO L858 garLoopResultBuilder]: For program point L1763-2(lines 1763 1766) no Hoare annotation was computed. [2021-11-20 06:31:01,257 INFO L858 garLoopResultBuilder]: For program point L2358(line 2358) no Hoare annotation was computed. [2021-11-20 06:31:01,257 INFO L854 garLoopResultBuilder]: At program point L2292(lines 2287 2294) the Hoare annotation is: (and (<= 6 ~ldv_count_1~0) (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0) (= ~ldv_count_2~0 0)) [2021-11-20 06:31:01,257 INFO L858 garLoopResultBuilder]: For program point L2193(line 2193) no Hoare annotation was computed. [2021-11-20 06:31:01,258 INFO L858 garLoopResultBuilder]: For program point L2094(lines 2094 2097) no Hoare annotation was computed. [2021-11-20 06:31:01,258 INFO L858 garLoopResultBuilder]: For program point L2127-1(line 2127) no Hoare annotation was computed. [2021-11-20 06:31:01,258 INFO L854 garLoopResultBuilder]: At program point L2127(line 2127) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,258 INFO L858 garLoopResultBuilder]: For program point L2028(lines 2028 2031) no Hoare annotation was computed. [2021-11-20 06:31:01,258 INFO L854 garLoopResultBuilder]: At program point L1929(lines 1916 1931) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,259 INFO L854 garLoopResultBuilder]: At program point L1863(lines 1849 1869) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,259 INFO L854 garLoopResultBuilder]: At program point L2392(lines 2387 2394) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0) .cse1) (and .cse0 (= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 0) (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse0 (<= (+ 2 ~ldv_count_2~0) ~ldv_count_1~0) .cse1))) [2021-11-20 06:31:01,259 INFO L858 garLoopResultBuilder]: For program point L2359-1(line 2359) no Hoare annotation was computed. [2021-11-20 06:31:01,259 INFO L854 garLoopResultBuilder]: At program point L2359(line 2359) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,260 INFO L854 garLoopResultBuilder]: At program point L2194(lines 2131 2196) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,260 INFO L854 garLoopResultBuilder]: At program point L2128(lines 2012 2130) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,260 INFO L854 garLoopResultBuilder]: At program point L2095(lines 2024 2129) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,260 INFO L858 garLoopResultBuilder]: For program point L1963(lines 1963 1966) no Hoare annotation was computed. [2021-11-20 06:31:01,260 INFO L858 garLoopResultBuilder]: For program point L2492(lines 2492 2495) no Hoare annotation was computed. [2021-11-20 06:31:01,261 INFO L858 garLoopResultBuilder]: For program point L2261(lines 2261 2267) no Hoare annotation was computed. [2021-11-20 06:31:01,261 INFO L854 garLoopResultBuilder]: At program point L1865(lines 1849 1869) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,261 INFO L854 garLoopResultBuilder]: At program point L1767(lines 1755 1769) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,261 INFO L854 garLoopResultBuilder]: At program point L1734(line 1734) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,262 INFO L858 garLoopResultBuilder]: For program point L1734-1(line 1734) no Hoare annotation was computed. [2021-11-20 06:31:01,262 INFO L854 garLoopResultBuilder]: At program point L2494(line 2494) the Hoare annotation is: false [2021-11-20 06:31:01,262 INFO L854 garLoopResultBuilder]: At program point L2527(lines 2526 2528) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,262 INFO L858 garLoopResultBuilder]: For program point L2362(line 2362) no Hoare annotation was computed. [2021-11-20 06:31:01,262 INFO L854 garLoopResultBuilder]: At program point L2264(line 2264) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,263 INFO L854 garLoopResultBuilder]: At program point L2033(line 2033) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,263 INFO L858 garLoopResultBuilder]: For program point L2033-1(line 2033) no Hoare annotation was computed. [2021-11-20 06:31:01,263 INFO L854 garLoopResultBuilder]: At program point L1868(lines 1842 1870) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,263 INFO L858 garLoopResultBuilder]: For program point L2166(lines 2166 2169) no Hoare annotation was computed. [2021-11-20 06:31:01,263 INFO L854 garLoopResultBuilder]: At program point L2100(line 2100) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,264 INFO L858 garLoopResultBuilder]: For program point L2100-1(line 2100) no Hoare annotation was computed. [2021-11-20 06:31:01,264 INFO L854 garLoopResultBuilder]: At program point L1968(lines 1953 1974) the Hoare annotation is: (let ((.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse0 (= |ULTIMATE.start_ibmpex_find_sensors_~sensor_type~0#1| 2)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse2 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1 .cse2 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse0 .cse3 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse0 (<= 6 ~ldv_count_1~0) .cse1 (= ~ldv_count_2~0 0)) (and .cse0 .cse3 .cse2))) [2021-11-20 06:31:01,264 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-20 06:31:01,264 INFO L854 garLoopResultBuilder]: At program point L2365(lines 2337 2377) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,264 INFO L858 garLoopResultBuilder]: For program point L2101-1(line 2101) no Hoare annotation was computed. [2021-11-20 06:31:01,265 INFO L854 garLoopResultBuilder]: At program point L2101(line 2101) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,265 INFO L858 garLoopResultBuilder]: For program point L2035(lines 2035 2038) no Hoare annotation was computed. [2021-11-20 06:31:01,265 INFO L858 garLoopResultBuilder]: For program point L1936(lines 1936 1939) no Hoare annotation was computed. [2021-11-20 06:31:01,265 INFO L854 garLoopResultBuilder]: At program point L1738(lines 1720 1740) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,266 INFO L854 garLoopResultBuilder]: At program point L2498(lines 2486 2500) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0) .cse1) (and .cse0 (= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 0) (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse0 (<= (+ 2 ~ldv_count_2~0) ~ldv_count_1~0) .cse1))) [2021-11-20 06:31:01,266 INFO L858 garLoopResultBuilder]: For program point L2399-1(line 2399) no Hoare annotation was computed. [2021-11-20 06:31:01,266 INFO L854 garLoopResultBuilder]: At program point L2399(line 2399) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,266 INFO L858 garLoopResultBuilder]: For program point L2003(lines 2003 2008) no Hoare annotation was computed. [2021-11-20 06:31:01,266 INFO L854 garLoopResultBuilder]: At program point L1970(lines 1953 1974) the Hoare annotation is: (let ((.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse0 (= |ULTIMATE.start_ibmpex_find_sensors_~sensor_type~0#1| 2)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse2 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1 .cse2 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse0 .cse3 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse0 (<= 6 ~ldv_count_1~0) .cse1 (= ~ldv_count_2~0 0)) (and .cse0 .cse3 .cse2))) [2021-11-20 06:31:01,267 INFO L854 garLoopResultBuilder]: At program point L2565(lines 2564 2566) the Hoare annotation is: (and (<= 6 ~ldv_count_1~0) (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0) (= ~ldv_count_2~0 0)) [2021-11-20 06:31:01,267 INFO L854 garLoopResultBuilder]: At program point L2466(lines 2462 2468) the Hoare annotation is: (let ((.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse2 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse4 (= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse4 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse0 (<= (+ 2 ~ldv_count_2~0) ~ldv_count_1~0) .cse2) (and (<= 6 ~ldv_count_1~0) .cse3 .cse4 (= ~ldv_count_2~0 0)))) [2021-11-20 06:31:01,267 INFO L854 garLoopResultBuilder]: At program point L2400(lines 2395 2402) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,267 INFO L858 garLoopResultBuilder]: For program point L2368(lines 2368 2371) no Hoare annotation was computed. [2021-11-20 06:31:01,267 INFO L858 garLoopResultBuilder]: For program point L2269(lines 2269 2273) no Hoare annotation was computed. [2021-11-20 06:31:01,268 INFO L858 garLoopResultBuilder]: For program point L2269-2(lines 2269 2273) no Hoare annotation was computed. [2021-11-20 06:31:01,268 INFO L858 garLoopResultBuilder]: For program point L2071(lines 2071 2074) no Hoare annotation was computed. [2021-11-20 06:31:01,268 INFO L854 garLoopResultBuilder]: At program point L2005(line 2005) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0) .cse1) (and .cse0 (= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 0) (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse0 (<= (+ 2 ~ldv_count_2~0) ~ldv_count_1~0) .cse1))) [2021-11-20 06:31:01,268 INFO L858 garLoopResultBuilder]: For program point L2005-1(line 2005) no Hoare annotation was computed. [2021-11-20 06:31:01,268 INFO L854 garLoopResultBuilder]: At program point L1609(lines 1603 1611) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,269 INFO L854 garLoopResultBuilder]: At program point L2369(lines 2337 2377) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,269 INFO L854 garLoopResultBuilder]: At program point L1973(lines 1948 1975) the Hoare annotation is: (let ((.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse0 (= |ULTIMATE.start_ibmpex_find_sensors_~sensor_type~0#1| 2)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse2 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1 .cse2 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse0 .cse3 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse0 (<= 6 ~ldv_count_1~0) .cse1 (= ~ldv_count_2~0 0)) (and .cse0 .cse3 .cse2))) [2021-11-20 06:31:01,269 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-20 06:31:01,269 INFO L858 garLoopResultBuilder]: For program point L2172(lines 2172 2177) no Hoare annotation was computed. [2021-11-20 06:31:01,269 INFO L858 garLoopResultBuilder]: For program point L2139-1(line 2139) no Hoare annotation was computed. [2021-11-20 06:31:01,270 INFO L854 garLoopResultBuilder]: At program point L2139(line 2139) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,270 INFO L858 garLoopResultBuilder]: For program point L1941(lines 1941 1944) no Hoare annotation was computed. [2021-11-20 06:31:01,270 INFO L861 garLoopResultBuilder]: At program point L2569(lines 2568 2570) the Hoare annotation is: true [2021-11-20 06:31:01,270 INFO L861 garLoopResultBuilder]: At program point L2372(line 2372) the Hoare annotation is: true [2021-11-20 06:31:01,270 INFO L858 garLoopResultBuilder]: For program point L2372-1(line 2372) no Hoare annotation was computed. [2021-11-20 06:31:01,271 INFO L858 garLoopResultBuilder]: For program point L2108(lines 2108 2111) no Hoare annotation was computed. [2021-11-20 06:31:01,271 INFO L858 garLoopResultBuilder]: For program point L2141(lines 2141 2145) no Hoare annotation was computed. [2021-11-20 06:31:01,271 INFO L854 garLoopResultBuilder]: At program point L2009(lines 1976 2011) the Hoare annotation is: (let ((.cse4 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse3 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse5 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse1 (<= (+ |ULTIMATE.start_create_sensor_#res#1| 12) 0)) (.cse2 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2) (and .cse5 .cse1 .cse4 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0) .cse2) (and .cse0 (= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 0) .cse3) (and .cse0 (<= (+ 2 ~ldv_count_2~0) ~ldv_count_1~0) .cse2) (and (<= 6 ~ldv_count_1~0) .cse5 .cse1 (= ~ldv_count_2~0 0) .cse2))) [2021-11-20 06:31:01,271 INFO L854 garLoopResultBuilder]: At program point L2340(line 2340) the Hoare annotation is: (and (<= 6 ~ldv_count_1~0) (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0) (= ~ldv_count_2~0 0)) [2021-11-20 06:31:01,272 INFO L858 garLoopResultBuilder]: For program point L2274(lines 2274 2281) no Hoare annotation was computed. [2021-11-20 06:31:01,272 INFO L858 garLoopResultBuilder]: For program point L2340-1(line 2340) no Hoare annotation was computed. [2021-11-20 06:31:01,272 INFO L854 garLoopResultBuilder]: At program point L2274-2(lines 2274 2281) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,272 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-20 06:31:01,272 INFO L854 garLoopResultBuilder]: At program point L2076(lines 2024 2129) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 0)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (or (and .cse0 .cse1 .cse2 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and (<= 6 ~ldv_count_1~0) .cse0 .cse2 (= ~ldv_count_2~0 0)) (and .cse3 .cse1) (and .cse3 (<= (+ 2 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse3 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 1) (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)))) [2021-11-20 06:31:01,273 INFO L858 garLoopResultBuilder]: For program point L2043(lines 2043 2046) no Hoare annotation was computed. [2021-11-20 06:31:01,273 INFO L854 garLoopResultBuilder]: At program point L1746(line 1746) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,273 INFO L858 garLoopResultBuilder]: For program point L1746-1(line 1746) no Hoare annotation was computed. [2021-11-20 06:31:01,273 INFO L858 garLoopResultBuilder]: For program point L2407-1(line 2407) no Hoare annotation was computed. [2021-11-20 06:31:01,273 INFO L861 garLoopResultBuilder]: At program point L2374(lines 2337 2377) the Hoare annotation is: true [2021-11-20 06:31:01,274 INFO L854 garLoopResultBuilder]: At program point L2407(line 2407) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,274 INFO L854 garLoopResultBuilder]: At program point L1945(lines 1932 1947) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse1 (= |ULTIMATE.start_ibmpex_find_sensors_~tmp___1~1#1| 0)) (.cse2 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1 .cse2) (and (<= 6 ~ldv_count_1~0) .cse3 .cse1 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse3 .cse1 .cse2 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)))) [2021-11-20 06:31:01,274 INFO L854 garLoopResultBuilder]: At program point L1747(line 1747) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,274 INFO L858 garLoopResultBuilder]: For program point L1747-1(line 1747) no Hoare annotation was computed. [2021-11-20 06:31:01,274 INFO L854 garLoopResultBuilder]: At program point L2408(lines 2403 2410) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,275 INFO L858 garLoopResultBuilder]: For program point L2342(lines 2342 2345) no Hoare annotation was computed. [2021-11-20 06:31:01,275 INFO L854 garLoopResultBuilder]: At program point L2078(lines 2024 2129) the Hoare annotation is: (let ((.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse2 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse4 (= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 0)) (.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse4 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse0 (<= (+ 2 ~ldv_count_2~0) ~ldv_count_1~0) .cse2) (and (<= 6 ~ldv_count_1~0) .cse3 .cse4 (= ~ldv_count_2~0 0)) (and .cse0 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 1) (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)))) [2021-11-20 06:31:01,275 INFO L858 garLoopResultBuilder]: For program point L1748(line 1748) no Hoare annotation was computed. [2021-11-20 06:31:01,275 INFO L858 garLoopResultBuilder]: For program point L1748-2(lines 1748 1751) no Hoare annotation was computed. [2021-11-20 06:31:01,276 INFO L861 garLoopResultBuilder]: At program point L2376(lines 2327 2378) the Hoare annotation is: true [2021-11-20 06:31:01,276 INFO L858 garLoopResultBuilder]: For program point L2310(line 2310) no Hoare annotation was computed. [2021-11-20 06:31:01,276 INFO L854 garLoopResultBuilder]: At program point L2178(line 2178) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,276 INFO L854 garLoopResultBuilder]: At program point L2112(line 2112) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse3 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0) .cse2) (and (<= 6 ~ldv_count_1~0) .cse3 (= ~ldv_count_2~0 0) .cse2))) [2021-11-20 06:31:01,276 INFO L858 garLoopResultBuilder]: For program point L2178-1(line 2178) no Hoare annotation was computed. [2021-11-20 06:31:01,277 INFO L858 garLoopResultBuilder]: For program point L2112-1(line 2112) no Hoare annotation was computed. [2021-11-20 06:31:01,277 INFO L858 garLoopResultBuilder]: For program point L2245(lines 2245 2248) no Hoare annotation was computed. [2021-11-20 06:31:01,277 INFO L858 garLoopResultBuilder]: For program point L2113-1(line 2113) no Hoare annotation was computed. [2021-11-20 06:31:01,277 INFO L854 garLoopResultBuilder]: At program point L2113(line 2113) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse3 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0) .cse2) (and (<= 6 ~ldv_count_1~0) .cse3 (= ~ldv_count_2~0 0) .cse2))) [2021-11-20 06:31:01,277 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-20 06:31:01,278 INFO L854 garLoopResultBuilder]: At program point L-1-2(line -1) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,278 INFO L854 garLoopResultBuilder]: At program point L-1-4(line -1) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,278 INFO L858 garLoopResultBuilder]: For program point L-1-5(line -1) no Hoare annotation was computed. [2021-11-20 06:31:01,278 INFO L861 garLoopResultBuilder]: At program point L2576(lines 2575 2577) the Hoare annotation is: true [2021-11-20 06:31:01,278 INFO L854 garLoopResultBuilder]: At program point L2510(lines 2501 2512) the Hoare annotation is: (and (<= 6 ~ldv_count_1~0) (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0) (= ~ldv_count_2~0 0)) [2021-11-20 06:31:01,279 INFO L858 garLoopResultBuilder]: For program point L2543-1(line 2543) no Hoare annotation was computed. [2021-11-20 06:31:01,279 INFO L854 garLoopResultBuilder]: At program point L2543(line 2543) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,279 INFO L854 garLoopResultBuilder]: At program point L2543-2(lines 2542 2544) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,279 INFO L854 garLoopResultBuilder]: At program point L2114(lines 2024 2129) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse3 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0) .cse2) (and (<= 6 ~ldv_count_1~0) .cse3 (= ~ldv_count_2~0 0) .cse2))) [2021-11-20 06:31:01,280 INFO L854 garLoopResultBuilder]: At program point L2081(lines 2024 2129) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,280 INFO L858 garLoopResultBuilder]: For program point L2048(lines 2048 2065) no Hoare annotation was computed. [2021-11-20 06:31:01,280 INFO L858 garLoopResultBuilder]: For program point L2181(lines 2181 2186) no Hoare annotation was computed. [2021-11-20 06:31:01,280 INFO L854 garLoopResultBuilder]: At program point L1983(line 1983) the Hoare annotation is: (let ((.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse2 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse4 (= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 0)) (.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse4 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse0 (<= (+ 2 ~ldv_count_2~0) ~ldv_count_1~0) .cse2) (and (<= 6 ~ldv_count_1~0) .cse3 .cse4 (= ~ldv_count_2~0 0)) (and .cse0 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 1) (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)))) [2021-11-20 06:31:01,280 INFO L858 garLoopResultBuilder]: For program point L1983-1(line 1983) no Hoare annotation was computed. [2021-11-20 06:31:01,281 INFO L854 garLoopResultBuilder]: At program point L1752(lines 1741 1754) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,281 INFO L861 garLoopResultBuilder]: At program point L2314(lines 2302 2320) the Hoare annotation is: true [2021-11-20 06:31:01,281 INFO L854 garLoopResultBuilder]: At program point L2116(lines 2024 2129) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,281 INFO L854 garLoopResultBuilder]: At program point L2083(lines 2024 2129) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-20 06:31:01,282 INFO L858 garLoopResultBuilder]: For program point dev_set_drvdataFINAL(lines 2536 2538) no Hoare annotation was computed. [2021-11-20 06:31:01,282 INFO L858 garLoopResultBuilder]: For program point dev_set_drvdataEXIT(lines 2536 2538) no Hoare annotation was computed. [2021-11-20 06:31:01,282 INFO L861 garLoopResultBuilder]: At program point dev_set_drvdataENTRY(lines 2536 2538) the Hoare annotation is: true [2021-11-20 06:31:01,286 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:31:01,288 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-20 06:31:01,314 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,315 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,316 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,316 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,316 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,316 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,317 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,317 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,317 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,317 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,318 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,318 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,318 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,318 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,319 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,319 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,320 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,321 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,321 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,321 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,321 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,322 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,322 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,322 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,322 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,323 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,323 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,323 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,323 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,324 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,324 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,324 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,354 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,354 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,355 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,355 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,355 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,355 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,356 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,356 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,356 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,356 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,357 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,357 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,357 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,357 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,358 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,358 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,359 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,359 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,359 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,360 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,360 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,360 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,360 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,361 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,361 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,361 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,361 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,362 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,362 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,362 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,362 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,362 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:31:01 BoogieIcfgContainer [2021-11-20 06:31:01,369 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-20 06:31:01,370 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-20 06:31:01,370 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-20 06:31:01,371 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-20 06:31:01,371 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:26:28" (3/4) ... [2021-11-20 06:31:01,375 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-20 06:31:01,384 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2021-11-20 06:31:01,385 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ipmi_destroy_user [2021-11-20 06:31:01,385 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2021-11-20 06:31:01,385 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_handler_precall [2021-11-20 06:31:01,385 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure wait_for_completion [2021-11-20 06:31:01,385 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_is_err [2021-11-20 06:31:01,386 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure hwmon_device_unregister [2021-11-20 06:31:01,386 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ipmi_free_recv_msg [2021-11-20 06:31:01,386 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2021-11-20 06:31:01,386 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ibmpex_send_message [2021-11-20 06:31:01,386 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2021-11-20 06:31:01,386 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2021-11-20 06:31:01,386 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kmalloc [2021-11-20 06:31:01,387 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure device_remove_file [2021-11-20 06:31:01,387 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure extract_value [2021-11-20 06:31:01,387 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ibmpex_bmc_delete [2021-11-20 06:31:01,388 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_set_drvdata [2021-11-20 06:31:01,432 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 144 nodes and edges [2021-11-20 06:31:01,435 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 45 nodes and edges [2021-11-20 06:31:01,438 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2021-11-20 06:31:01,441 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-20 06:31:01,444 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-20 06:31:01,447 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-20 06:31:01,502 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && \result + 12 <= 0) && j <= 2) && ldv_count_2 + 1 <= ldv_count_1) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && j <= 2)) || ((((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && \result + 12 <= 0) && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1) && j <= 2)) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && j == 0) && ldv_count_2 + 1 <= ldv_count_1)) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 2 + ldv_count_2 <= ldv_count_1) && j <= 2)) || ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && \result + 12 <= 0) && ldv_count_2 == 0) && j <= 2) [2021-11-20 06:31:01,504 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 1)) || !(ldv_count_2 + 1 <= ldv_count_1)) && ((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 1)) || !(1 <= ldv_call_dev_attr_of_sensor_device_attribute))) && (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) || !(5 + ldv_count_2 <= ldv_count_1)) || !(1 <= ldv_call_dev_attr_of_sensor_device_attribute))) && (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) || !(6 <= ldv_count_1)) || !(ldv_count_2 == 0)) [2021-11-20 06:31:01,505 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 1)) || !(ldv_count_2 + 1 <= ldv_count_1)) && ((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 1)) || !(1 <= ldv_call_dev_attr_of_sensor_device_attribute))) && (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) || !(5 + ldv_count_2 <= ldv_count_1)) || !(1 <= ldv_call_dev_attr_of_sensor_device_attribute))) && (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) || !(6 <= ldv_count_1)) || !(ldv_count_2 == 0)) [2021-11-20 06:31:01,692 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7786c4a2-93ec-4bf5-80fb-48d9bd08abd3/bin/uautomizer-DQz5hQGWxF/witness.graphml [2021-11-20 06:31:01,693 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-20 06:31:01,693 INFO L158 Benchmark]: Toolchain (without parser) took 277322.51ms. Allocated memory was 94.4MB in the beginning and 755.0MB in the end (delta: 660.6MB). Free memory was 55.6MB in the beginning and 266.1MB in the end (delta: -210.5MB). Peak memory consumption was 448.7MB. Max. memory is 16.1GB. [2021-11-20 06:31:01,695 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 94.4MB. Free memory was 64.0MB in the beginning and 64.0MB in the end (delta: 28.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 06:31:01,695 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1484.05ms. Allocated memory was 94.4MB in the beginning and 130.0MB in the end (delta: 35.7MB). Free memory was 55.3MB in the beginning and 68.7MB in the end (delta: -13.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2021-11-20 06:31:01,696 INFO L158 Benchmark]: Boogie Procedure Inliner took 166.32ms. Allocated memory is still 130.0MB. Free memory was 68.7MB in the beginning and 61.1MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-20 06:31:01,697 INFO L158 Benchmark]: Boogie Preprocessor took 164.90ms. Allocated memory is still 130.0MB. Free memory was 61.1MB in the beginning and 54.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-20 06:31:01,697 INFO L158 Benchmark]: RCFGBuilder took 1998.26ms. Allocated memory is still 130.0MB. Free memory was 54.8MB in the beginning and 82.8MB in the end (delta: -28.0MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. [2021-11-20 06:31:01,698 INFO L158 Benchmark]: TraceAbstraction took 273176.55ms. Allocated memory was 130.0MB in the beginning and 755.0MB in the end (delta: 625.0MB). Free memory was 82.4MB in the beginning and 295.2MB in the end (delta: -212.8MB). Peak memory consumption was 458.3MB. Max. memory is 16.1GB. [2021-11-20 06:31:01,698 INFO L158 Benchmark]: Witness Printer took 322.53ms. Allocated memory is still 755.0MB. Free memory was 295.2MB in the beginning and 266.1MB in the end (delta: 29.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2021-11-20 06:31:01,703 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41ms. Allocated memory is still 94.4MB. Free memory was 64.0MB in the beginning and 64.0MB in the end (delta: 28.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1484.05ms. Allocated memory was 94.4MB in the beginning and 130.0MB in the end (delta: 35.7MB). Free memory was 55.3MB in the beginning and 68.7MB in the end (delta: -13.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 166.32ms. Allocated memory is still 130.0MB. Free memory was 68.7MB in the beginning and 61.1MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 164.90ms. Allocated memory is still 130.0MB. Free memory was 61.1MB in the beginning and 54.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1998.26ms. Allocated memory is still 130.0MB. Free memory was 54.8MB in the beginning and 82.8MB in the end (delta: -28.0MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. * TraceAbstraction took 273176.55ms. Allocated memory was 130.0MB in the beginning and 755.0MB in the end (delta: 625.0MB). Free memory was 82.4MB in the beginning and 295.2MB in the end (delta: -212.8MB). Peak memory consumption was 458.3MB. Max. memory is 16.1GB. * Witness Printer took 322.53ms. Allocated memory is still 755.0MB. Free memory was 295.2MB in the beginning and 266.1MB in the end (delta: 29.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 2415]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 275 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 273.0s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 21.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 240.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8331 SdHoareTripleChecker+Valid, 17.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7712 mSDsluCounter, 22264 SdHoareTripleChecker+Invalid, 15.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14857 mSDsCounter, 2851 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7415 IncrementalHoareTripleChecker+Invalid, 10266 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2851 mSolverCounterUnsat, 7407 mSDtfsCounter, 7415 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1234 GetRequests, 1134 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1508occurred in iteration=11, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 15 MinimizatonAttempts, 9153 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 134 LocationsWithAnnotation, 3879 PreInvPairs, 4613 NumberOfFragments, 4151 HoareAnnotationTreeSize, 3879 FomulaSimplifications, 489212 FormulaSimplificationTreeSizeReduction, 206.1s HoareSimplificationTime, 134 FomulaSimplificationsInter, 37311994 FormulaSimplificationTreeSizeReductionInter, 34.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 2976 NumberOfCodeBlocks, 2976 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3144 ConstructedInterpolants, 0 QuantifiedInterpolants, 5246 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2814 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 1546/1550 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 2287]: Loop Invariant Derived loop invariant: (6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0 - InvariantResult [Line: 1644]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2549]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 1953]: Loop Invariant Derived loop invariant: (((((sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1) || ((sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 1) && ldv_count_2 + 1 <= ldv_count_1)) || (((sensor_type == 2 && 6 <= ldv_count_1) && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0)) || ((sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 1) && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 1849]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2379]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2572]: Loop Invariant [2021-11-20 06:31:01,734 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,734 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,734 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,734 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,735 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,735 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,735 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,735 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,736 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,736 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,736 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,736 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,736 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,737 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,737 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,737 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,738 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,738 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,738 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,738 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,739 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,739 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,739 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,739 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,739 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,740 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,740 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,740 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,740 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,741 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,741 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,741 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 1)) || !(ldv_count_2 + 1 <= ldv_count_1)) && ((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 1)) || !(1 <= ldv_call_dev_attr_of_sensor_device_attribute))) && (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) || !(5 + ldv_count_2 <= ldv_count_1)) || !(1 <= ldv_call_dev_attr_of_sensor_device_attribute))) && (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) || !(6 <= ldv_count_1)) || !(ldv_count_2 == 0)) - InvariantResult [Line: 1564]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2302]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2131]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 1720]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2138]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2513]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 1948]: Loop Invariant Derived loop invariant: (((((sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1) || ((sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 1) && ldv_count_2 + 1 <= ldv_count_1)) || (((sensor_type == 2 && 6 <= ldv_count_1) && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0)) || ((sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 1) && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2542]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 1603]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: ((((((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && j == 0) && 5 + ldv_count_2 <= ldv_count_1) || (((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && j == 0) && ldv_count_2 == 0)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 2 + ldv_count_2 <= ldv_count_1)) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && j <= 1) && ldv_count_2 + 1 <= ldv_count_1) - InvariantResult [Line: 1570]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1590]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2201]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 1932]: Loop Invariant Derived loop invariant: ((((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && tmp___1 == 0) && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) || (((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && tmp___1 == 0) && ldv_count_2 == 0)) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && tmp___1 == 0) && ldv_count_2 + 1 <= ldv_count_1)) || (((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && tmp___1 == 0) && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1) - InvariantResult [Line: 2337]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2560]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2519]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2526]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 1976]: Loop Invariant Derived loop invariant: (((((((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && \result + 12 <= 0) && j <= 2) && ldv_count_2 + 1 <= ldv_count_1) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && j <= 2)) || ((((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && \result + 12 <= 0) && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1) && j <= 2)) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && j == 0) && ldv_count_2 + 1 <= ldv_count_1)) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 2 + ldv_count_2 <= ldv_count_1) && j <= 2)) || ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && \result + 12 <= 0) && ldv_count_2 == 0) && j <= 2) - InvariantResult [Line: 2337]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2501]: Loop Invariant Derived loop invariant: (6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0 - InvariantResult [Line: 2564]: Loop Invariant Derived loop invariant: (6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0 - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: ((((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && j <= 2) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && j <= 2) && ldv_count_2 + 1 <= ldv_count_1)) || (((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1) && j <= 2)) || (((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) && j <= 2) - InvariantResult [Line: 2516]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 1698]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: (((((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && j <= 2) || (((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && j == 0) && 5 + ldv_count_2 <= ldv_count_1)) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 2 + ldv_count_2 <= ldv_count_1) && j <= 2)) || (((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && j == 0) && ldv_count_2 == 0)) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && j <= 1) && ldv_count_2 + 1 <= ldv_count_1) - InvariantResult [Line: 1755]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2012]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 1916]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2201]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2201]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1741]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2254]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: ((((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && j <= 2) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && j <= 2) && ldv_count_2 + 1 <= ldv_count_1)) || (((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1) && j <= 2)) || (((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) && j <= 2) - InvariantResult [Line: 2403]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2302]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2462]: Loop Invariant Derived loop invariant: ((((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && j <= 2) || (((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && j == 0) && 5 + ldv_count_2 <= ldv_count_1)) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 2 + ldv_count_2 <= ldv_count_1) && j <= 2)) || (((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && j == 0) && ldv_count_2 == 0) - InvariantResult [Line: 2295]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2201]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2337]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2138]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 1698]: Loop Invariant [2021-11-20 06:31:01,763 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,777 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,778 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,778 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,778 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,778 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,779 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,779 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,779 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,779 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,779 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,780 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,780 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,780 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,780 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,780 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,781 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,781 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,782 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,782 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,782 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,782 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,783 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,783 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,783 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,783 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,783 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,784 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,784 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,784 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:31:01,784 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:31:01,784 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 1)) || !(ldv_count_2 + 1 <= ldv_count_1)) && ((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 1)) || !(1 <= ldv_call_dev_attr_of_sensor_device_attribute))) && (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) || !(5 + ldv_count_2 <= ldv_count_1)) || !(1 <= ldv_call_dev_attr_of_sensor_device_attribute))) && (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) || !(6 <= ldv_count_1)) || !(ldv_count_2 == 0)) - InvariantResult [Line: 1953]: Loop Invariant Derived loop invariant: (((((sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1) || ((sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 1) && ldv_count_2 + 1 <= ldv_count_1)) || (((sensor_type == 2 && 6 <= ldv_count_1) && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0)) || ((sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 1) && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 1849]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2138]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2327]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1578]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2387]: Loop Invariant Derived loop invariant: (((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && j <= 2) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && j == 0) && ldv_count_2 + 1 <= ldv_count_1)) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 2 + ldv_count_2 <= ldv_count_1) && j <= 2) - InvariantResult [Line: 1842]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2575]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2238]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2568]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2201]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2395]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2486]: Loop Invariant Derived loop invariant: (((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && j <= 2) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && j == 0) && ldv_count_2 + 1 <= ldv_count_1)) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 2 + ldv_count_2 <= ldv_count_1) && j <= 2) - InvariantResult [Line: 2581]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-11-20 06:31:01,835 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7786c4a2-93ec-4bf5-80fb-48d9bd08abd3/bin/uautomizer-DQz5hQGWxF/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