./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point_ldv-val-v0.8.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point_ldv-val-v0.8.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 88f19b088f98626e870666f9633d9e7e34156d2b7ba315c9b1bc3979a22f8d34 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 17:09:05,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 17:09:05,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 17:09:05,979 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 17:09:05,979 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 17:09:05,983 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 17:09:05,985 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 17:09:05,988 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 17:09:05,990 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 17:09:05,996 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 17:09:05,998 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 17:09:06,000 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 17:09:06,000 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 17:09:06,003 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 17:09:06,004 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 17:09:06,006 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 17:09:06,008 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 17:09:06,009 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 17:09:06,011 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 17:09:06,017 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 17:09:06,019 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 17:09:06,021 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 17:09:06,022 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 17:09:06,023 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 17:09:06,033 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 17:09:06,033 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 17:09:06,034 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 17:09:06,036 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 17:09:06,036 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 17:09:06,037 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 17:09:06,038 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 17:09:06,038 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 17:09:06,040 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 17:09:06,041 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 17:09:06,043 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 17:09:06,044 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 17:09:06,044 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 17:09:06,045 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 17:09:06,045 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 17:09:06,046 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 17:09:06,046 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 17:09:06,048 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-21 17:09:06,085 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 17:09:06,085 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 17:09:06,086 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 17:09:06,086 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 17:09:06,088 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 17:09:06,089 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 17:09:06,089 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 17:09:06,090 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 17:09:06,090 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 17:09:06,090 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 17:09:06,091 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 17:09:06,091 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 17:09:06,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 17:09:06,092 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 17:09:06,092 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 17:09:06,092 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 17:09:06,093 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-21 17:09:06,093 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 17:09:06,093 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 17:09:06,093 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 17:09:06,094 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 17:09:06,094 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 17:09:06,094 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 17:09:06,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 17:09:06,094 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 17:09:06,095 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 17:09:06,095 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 17:09:06,095 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 17:09:06,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 17:09:06,096 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 17:09:06,096 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 17:09:06,096 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 17:09:06,096 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_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/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_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a 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 ! overflow) ) 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 -> 88f19b088f98626e870666f9633d9e7e34156d2b7ba315c9b1bc3979a22f8d34 [2022-11-21 17:09:06,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 17:09:06,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 17:09:06,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 17:09:06,413 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 17:09:06,414 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 17:09:06,415 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-21 17:09:09,491 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 17:09:09,793 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 17:09:09,794 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-21 17:09:09,807 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/data/5e0e5c8a6/dd546dc3a05149f8900b96c3515bc1d1/FLAG21741fc42 [2022-11-21 17:09:09,822 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/data/5e0e5c8a6/dd546dc3a05149f8900b96c3515bc1d1 [2022-11-21 17:09:09,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 17:09:09,826 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 17:09:09,827 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 17:09:09,827 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 17:09:09,831 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 17:09:09,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:09:09" (1/1) ... [2022-11-21 17:09:09,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4faab805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:09:09, skipping insertion in model container [2022-11-21 17:09:09,833 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:09:09" (1/1) ... [2022-11-21 17:09:09,840 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 17:09:09,890 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 17:09:10,288 WARN L237 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_e33c0574-e521-404c-b5e6-40fc324a566b/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point_ldv-val-v0.8.cil.out.i[37767,37780] [2022-11-21 17:09:10,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:09:10,318 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 17:09:10,407 WARN L237 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_e33c0574-e521-404c-b5e6-40fc324a566b/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point_ldv-val-v0.8.cil.out.i[37767,37780] [2022-11-21 17:09:10,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:09:10,438 INFO L208 MainTranslator]: Completed translation [2022-11-21 17:09:10,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:09:10 WrapperNode [2022-11-21 17:09:10,439 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 17:09:10,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 17:09:10,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 17:09:10,440 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 17:09:10,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:09:10" (1/1) ... [2022-11-21 17:09:10,468 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:09:10" (1/1) ... [2022-11-21 17:09:10,539 INFO L138 Inliner]: procedures = 83, calls = 168, calls flagged for inlining = 31, calls inlined = 25, statements flattened = 527 [2022-11-21 17:09:10,539 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 17:09:10,540 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 17:09:10,540 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 17:09:10,540 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 17:09:10,550 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:09:10" (1/1) ... [2022-11-21 17:09:10,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:09:10" (1/1) ... [2022-11-21 17:09:10,559 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:09:10" (1/1) ... [2022-11-21 17:09:10,569 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:09:10" (1/1) ... [2022-11-21 17:09:10,601 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:09:10" (1/1) ... [2022-11-21 17:09:10,606 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:09:10" (1/1) ... [2022-11-21 17:09:10,610 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:09:10" (1/1) ... [2022-11-21 17:09:10,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:09:10" (1/1) ... [2022-11-21 17:09:10,618 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 17:09:10,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 17:09:10,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 17:09:10,619 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 17:09:10,620 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:09:10" (1/1) ... [2022-11-21 17:09:10,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 17:09:10,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:09:10,650 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 17:09:10,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 17:09:10,695 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove_raw [2022-11-21 17:09:10,696 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove_raw [2022-11-21 17:09:10,696 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_probe [2022-11-21 17:09:10,696 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_probe [2022-11-21 17:09:10,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 17:09:10,697 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-21 17:09:10,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-21 17:09:10,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 17:09:10,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-21 17:09:10,704 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-21 17:09:10,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-21 17:09:10,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 17:09:10,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-21 17:09:10,705 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-21 17:09:10,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-21 17:09:10,705 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2022-11-21 17:09:10,705 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2022-11-21 17:09:10,705 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-11-21 17:09:10,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-11-21 17:09:10,706 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-21 17:09:10,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-21 17:09:10,706 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove_attr [2022-11-21 17:09:10,706 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove_attr [2022-11-21 17:09:10,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 17:09:10,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-21 17:09:10,707 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2022-11-21 17:09:10,707 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2022-11-21 17:09:10,707 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2022-11-21 17:09:10,707 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2022-11-21 17:09:10,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 17:09:10,708 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_adc_release [2022-11-21 17:09:10,708 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_adc_release [2022-11-21 17:09:10,708 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-21 17:09:10,709 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-21 17:09:10,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 17:09:10,710 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove [2022-11-21 17:09:10,711 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove [2022-11-21 17:09:10,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 17:09:10,711 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2022-11-21 17:09:10,712 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2022-11-21 17:09:10,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 17:09:10,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 17:09:10,713 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file [2022-11-21 17:09:10,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file [2022-11-21 17:09:10,713 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-11-21 17:09:10,713 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-11-21 17:09:10,925 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 17:09:10,927 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 17:09:11,392 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-21 17:09:11,664 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 17:09:11,672 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 17:09:11,672 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-21 17:09:11,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:09:11 BoogieIcfgContainer [2022-11-21 17:09:11,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 17:09:11,677 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 17:09:11,677 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 17:09:11,680 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 17:09:11,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 05:09:09" (1/3) ... [2022-11-21 17:09:11,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@329485f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:09:11, skipping insertion in model container [2022-11-21 17:09:11,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:09:10" (2/3) ... [2022-11-21 17:09:11,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@329485f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:09:11, skipping insertion in model container [2022-11-21 17:09:11,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:09:11" (3/3) ... [2022-11-21 17:09:11,684 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-21 17:09:11,703 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 17:09:11,704 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-11-21 17:09:11,758 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 17:09:11,765 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2163370, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 17:09:11,765 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-21 17:09:11,770 INFO L276 IsEmpty]: Start isEmpty. Operand has 236 states, 163 states have (on average 1.3680981595092025) internal successors, (223), 184 states have internal predecessors, (223), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-11-21 17:09:11,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 17:09:11,780 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:09:11,781 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:09:11,781 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-21 17:09:11,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:09:11,787 INFO L85 PathProgramCache]: Analyzing trace with hash 165870401, now seen corresponding path program 1 times [2022-11-21 17:09:11,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:09:11,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015407401] [2022-11-21 17:09:11,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:11,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:09:11,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:12,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-21 17:09:12,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:12,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:09:12,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:09:12,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015407401] [2022-11-21 17:09:12,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015407401] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:09:12,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:09:12,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 17:09:12,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634001230] [2022-11-21 17:09:12,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:09:12,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:09:12,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:09:12,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:09:12,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:09:12,142 INFO L87 Difference]: Start difference. First operand has 236 states, 163 states have (on average 1.3680981595092025) internal successors, (223), 184 states have internal predecessors, (223), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 17:09:12,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:09:12,733 INFO L93 Difference]: Finished difference Result 518 states and 680 transitions. [2022-11-21 17:09:12,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 17:09:12,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-11-21 17:09:12,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:09:12,748 INFO L225 Difference]: With dead ends: 518 [2022-11-21 17:09:12,748 INFO L226 Difference]: Without dead ends: 262 [2022-11-21 17:09:12,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:09:12,757 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 95 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 17:09:12,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 532 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 17:09:12,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-11-21 17:09:12,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 239. [2022-11-21 17:09:12,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 171 states have (on average 1.345029239766082) internal successors, (230), 187 states have internal predecessors, (230), 36 states have call successors, (36), 16 states have call predecessors, (36), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-11-21 17:09:12,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 302 transitions. [2022-11-21 17:09:12,822 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 302 transitions. Word has length 16 [2022-11-21 17:09:12,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:09:12,823 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 302 transitions. [2022-11-21 17:09:12,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 17:09:12,824 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 302 transitions. [2022-11-21 17:09:12,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-21 17:09:12,826 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:09:12,826 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 17:09:12,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 17:09:12,827 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-21 17:09:12,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:09:12,828 INFO L85 PathProgramCache]: Analyzing trace with hash -11803947, now seen corresponding path program 1 times [2022-11-21 17:09:12,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:09:12,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903744698] [2022-11-21 17:09:12,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:12,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:09:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:13,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-21 17:09:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:13,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 17:09:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:13,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 17:09:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:13,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 17:09:13,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:09:13,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903744698] [2022-11-21 17:09:13,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903744698] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:09:13,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:09:13,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 17:09:13,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499562812] [2022-11-21 17:09:13,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:09:13,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:09:13,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:09:13,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:09:13,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:09:13,198 INFO L87 Difference]: Start difference. First operand 239 states and 302 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-21 17:09:14,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:09:14,094 INFO L93 Difference]: Finished difference Result 521 states and 667 transitions. [2022-11-21 17:09:14,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 17:09:14,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-11-21 17:09:14,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:09:14,106 INFO L225 Difference]: With dead ends: 521 [2022-11-21 17:09:14,106 INFO L226 Difference]: Without dead ends: 515 [2022-11-21 17:09:14,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:09:14,109 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 324 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-21 17:09:14,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 688 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-21 17:09:14,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-11-21 17:09:14,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 459. [2022-11-21 17:09:14,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 339 states have (on average 1.3303834808259587) internal successors, (451), 356 states have internal predecessors, (451), 72 states have call successors, (72), 32 states have call predecessors, (72), 32 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-11-21 17:09:14,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 595 transitions. [2022-11-21 17:09:14,196 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 595 transitions. Word has length 40 [2022-11-21 17:09:14,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:09:14,197 INFO L495 AbstractCegarLoop]: Abstraction has 459 states and 595 transitions. [2022-11-21 17:09:14,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-21 17:09:14,197 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 595 transitions. [2022-11-21 17:09:14,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-21 17:09:14,207 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:09:14,207 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-11-21 17:09:14,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 17:09:14,208 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-21 17:09:14,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:09:14,209 INFO L85 PathProgramCache]: Analyzing trace with hash -2035530627, now seen corresponding path program 1 times [2022-11-21 17:09:14,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:09:14,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676516849] [2022-11-21 17:09:14,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:14,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:09:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:14,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-21 17:09:14,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:14,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 17:09:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:14,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 17:09:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:14,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-21 17:09:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:14,428 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-21 17:09:14,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:09:14,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676516849] [2022-11-21 17:09:14,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676516849] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:09:14,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:09:14,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 17:09:14,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313165227] [2022-11-21 17:09:14,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:09:14,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:09:14,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:09:14,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:09:14,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:09:14,433 INFO L87 Difference]: Start difference. First operand 459 states and 595 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-21 17:09:15,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:09:15,127 INFO L93 Difference]: Finished difference Result 1167 states and 1505 transitions. [2022-11-21 17:09:15,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 17:09:15,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2022-11-21 17:09:15,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:09:15,135 INFO L225 Difference]: With dead ends: 1167 [2022-11-21 17:09:15,135 INFO L226 Difference]: Without dead ends: 711 [2022-11-21 17:09:15,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:09:15,141 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 185 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 17:09:15,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 729 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-21 17:09:15,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2022-11-21 17:09:15,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 625. [2022-11-21 17:09:15,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 459 states have (on average 1.3050108932461875) internal successors, (599), 476 states have internal predecessors, (599), 96 states have call successors, (96), 54 states have call predecessors, (96), 54 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2022-11-21 17:09:15,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 791 transitions. [2022-11-21 17:09:15,216 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 791 transitions. Word has length 54 [2022-11-21 17:09:15,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:09:15,217 INFO L495 AbstractCegarLoop]: Abstraction has 625 states and 791 transitions. [2022-11-21 17:09:15,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-21 17:09:15,217 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 791 transitions. [2022-11-21 17:09:15,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-21 17:09:15,220 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:09:15,221 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:09:15,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 17:09:15,221 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-21 17:09:15,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:09:15,222 INFO L85 PathProgramCache]: Analyzing trace with hash 622072863, now seen corresponding path program 1 times [2022-11-21 17:09:15,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:09:15,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75692852] [2022-11-21 17:09:15,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:15,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:09:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:15,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-21 17:09:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:15,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 17:09:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:15,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-21 17:09:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:15,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 17:09:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:15,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-21 17:09:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:15,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-21 17:09:15,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:15,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 17:09:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:15,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-21 17:09:15,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:15,559 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-21 17:09:15,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:09:15,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75692852] [2022-11-21 17:09:15,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75692852] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:09:15,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309700144] [2022-11-21 17:09:15,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:15,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:09:15,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:09:15,585 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:09:15,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 17:09:15,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:15,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-21 17:09:15,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:09:15,899 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 17:09:15,899 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:09:15,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309700144] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:09:15,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:09:15,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-11-21 17:09:15,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685290978] [2022-11-21 17:09:15,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:09:15,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:09:15,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:09:15,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:09:15,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:09:15,902 INFO L87 Difference]: Start difference. First operand 625 states and 791 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 17:09:15,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:09:15,967 INFO L93 Difference]: Finished difference Result 1332 states and 1692 transitions. [2022-11-21 17:09:15,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:09:15,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 66 [2022-11-21 17:09:15,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:09:15,971 INFO L225 Difference]: With dead ends: 1332 [2022-11-21 17:09:15,971 INFO L226 Difference]: Without dead ends: 710 [2022-11-21 17:09:15,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:09:15,974 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 198 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:09:15,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 584 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:09:15,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2022-11-21 17:09:16,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 698. [2022-11-21 17:09:16,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 523 states have (on average 1.315487571701721) internal successors, (688), 541 states have internal predecessors, (688), 104 states have call successors, (104), 55 states have call predecessors, (104), 55 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104) [2022-11-21 17:09:16,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 896 transitions. [2022-11-21 17:09:16,022 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 896 transitions. Word has length 66 [2022-11-21 17:09:16,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:09:16,022 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 896 transitions. [2022-11-21 17:09:16,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 17:09:16,023 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 896 transitions. [2022-11-21 17:09:16,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-21 17:09:16,024 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:09:16,024 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 17:09:16,037 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 17:09:16,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:09:16,231 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-21 17:09:16,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:09:16,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1434225425, now seen corresponding path program 1 times [2022-11-21 17:09:16,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:09:16,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360460273] [2022-11-21 17:09:16,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:16,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:09:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:16,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-21 17:09:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:16,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 17:09:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:16,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 17:09:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:16,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-21 17:09:16,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:16,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 17:09:16,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:16,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-21 17:09:16,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:16,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-21 17:09:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:16,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 17:09:16,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:16,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-21 17:09:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:16,451 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-21 17:09:16,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:09:16,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360460273] [2022-11-21 17:09:16,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360460273] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:09:16,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:09:16,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 17:09:16,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665763194] [2022-11-21 17:09:16,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:09:16,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:09:16,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:09:16,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:09:16,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:09:16,455 INFO L87 Difference]: Start difference. First operand 698 states and 896 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-21 17:09:16,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:09:16,865 INFO L93 Difference]: Finished difference Result 1270 states and 1646 transitions. [2022-11-21 17:09:16,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 17:09:16,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 81 [2022-11-21 17:09:16,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:09:16,871 INFO L225 Difference]: With dead ends: 1270 [2022-11-21 17:09:16,872 INFO L226 Difference]: Without dead ends: 764 [2022-11-21 17:09:16,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:09:16,874 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 124 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:09:16,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 524 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 17:09:16,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2022-11-21 17:09:16,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 706. [2022-11-21 17:09:16,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 529 states have (on average 1.3119092627599245) internal successors, (694), 547 states have internal predecessors, (694), 106 states have call successors, (106), 55 states have call predecessors, (106), 55 states have return successors, (106), 106 states have call predecessors, (106), 106 states have call successors, (106) [2022-11-21 17:09:16,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 906 transitions. [2022-11-21 17:09:16,934 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 906 transitions. Word has length 81 [2022-11-21 17:09:16,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:09:16,935 INFO L495 AbstractCegarLoop]: Abstraction has 706 states and 906 transitions. [2022-11-21 17:09:16,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-21 17:09:16,936 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 906 transitions. [2022-11-21 17:09:16,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-21 17:09:16,937 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:09:16,937 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 17:09:16,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 17:09:16,938 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting s3c_hwmon_probeErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-21 17:09:16,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:09:16,938 INFO L85 PathProgramCache]: Analyzing trace with hash -21740282, now seen corresponding path program 1 times [2022-11-21 17:09:16,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:09:16,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437041012] [2022-11-21 17:09:16,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:16,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:09:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:17,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-21 17:09:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:17,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 17:09:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:17,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 17:09:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:17,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-21 17:09:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:17,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 17:09:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:17,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-21 17:09:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:17,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-21 17:09:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:17,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 17:09:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:17,080 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-21 17:09:17,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:09:17,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437041012] [2022-11-21 17:09:17,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437041012] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:09:17,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:09:17,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 17:09:17,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358034437] [2022-11-21 17:09:17,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:09:17,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:09:17,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:09:17,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:09:17,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:09:17,083 INFO L87 Difference]: Start difference. First operand 706 states and 906 transitions. Second operand has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-21 17:09:17,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:09:17,392 INFO L93 Difference]: Finished difference Result 1539 states and 2014 transitions. [2022-11-21 17:09:17,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:09:17,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 84 [2022-11-21 17:09:17,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:09:17,397 INFO L225 Difference]: With dead ends: 1539 [2022-11-21 17:09:17,397 INFO L226 Difference]: Without dead ends: 836 [2022-11-21 17:09:17,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:09:17,400 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 91 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:09:17,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 548 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:09:17,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2022-11-21 17:09:17,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 784. [2022-11-21 17:09:17,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 598 states have (on average 1.3210702341137124) internal successors, (790), 616 states have internal predecessors, (790), 115 states have call successors, (115), 55 states have call predecessors, (115), 55 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2022-11-21 17:09:17,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1020 transitions. [2022-11-21 17:09:17,443 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1020 transitions. Word has length 84 [2022-11-21 17:09:17,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:09:17,443 INFO L495 AbstractCegarLoop]: Abstraction has 784 states and 1020 transitions. [2022-11-21 17:09:17,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-21 17:09:17,444 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1020 transitions. [2022-11-21 17:09:17,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-21 17:09:17,445 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:09:17,445 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-21 17:09:17,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 17:09:17,446 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-21 17:09:17,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:09:17,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1302579183, now seen corresponding path program 2 times [2022-11-21 17:09:17,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:09:17,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314007729] [2022-11-21 17:09:17,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:17,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:09:17,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:17,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-21 17:09:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:17,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 17:09:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:17,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 17:09:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:17,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-21 17:09:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:17,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-21 17:09:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:17,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-21 17:09:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:17,577 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-21 17:09:17,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:09:17,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314007729] [2022-11-21 17:09:17,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314007729] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:09:17,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:09:17,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 17:09:17,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025784190] [2022-11-21 17:09:17,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:09:17,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:09:17,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:09:17,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:09:17,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:09:17,581 INFO L87 Difference]: Start difference. First operand 784 states and 1020 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-21 17:09:18,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:09:18,075 INFO L93 Difference]: Finished difference Result 1345 states and 1748 transitions. [2022-11-21 17:09:18,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 17:09:18,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 78 [2022-11-21 17:09:18,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:09:18,078 INFO L225 Difference]: With dead ends: 1345 [2022-11-21 17:09:18,079 INFO L226 Difference]: Without dead ends: 538 [2022-11-21 17:09:18,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:09:18,081 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 279 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 17:09:18,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 512 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 17:09:18,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-11-21 17:09:18,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 505. [2022-11-21 17:09:18,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 378 states have (on average 1.2936507936507937) internal successors, (489), 393 states have internal predecessors, (489), 74 states have call successors, (74), 39 states have call predecessors, (74), 39 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2022-11-21 17:09:18,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 637 transitions. [2022-11-21 17:09:18,116 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 637 transitions. Word has length 78 [2022-11-21 17:09:18,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:09:18,116 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 637 transitions. [2022-11-21 17:09:18,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-21 17:09:18,116 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 637 transitions. [2022-11-21 17:09:18,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-21 17:09:18,118 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:09:18,118 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-11-21 17:09:18,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 17:09:18,118 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting s3c_hwmon_probeErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-21 17:09:18,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:09:18,119 INFO L85 PathProgramCache]: Analyzing trace with hash -456742297, now seen corresponding path program 1 times [2022-11-21 17:09:18,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:09:18,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345205404] [2022-11-21 17:09:18,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:18,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:09:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:18,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-21 17:09:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:18,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 17:09:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:18,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 17:09:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:18,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-21 17:09:18,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:18,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 17:09:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:18,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-21 17:09:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:18,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-21 17:09:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:18,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 17:09:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:18,270 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-21 17:09:18,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:09:18,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345205404] [2022-11-21 17:09:18,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345205404] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:09:18,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549176296] [2022-11-21 17:09:18,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:18,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:09:18,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:09:18,272 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:09:18,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 17:09:18,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:18,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 17:09:18,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:09:18,562 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-21 17:09:18,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:09:18,635 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-21 17:09:18,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549176296] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:09:18,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:09:18,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2022-11-21 17:09:18,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111655193] [2022-11-21 17:09:18,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:09:18,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 17:09:18,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:09:18,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 17:09:18,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:09:18,639 INFO L87 Difference]: Start difference. First operand 505 states and 637 transitions. Second operand has 8 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-21 17:09:19,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:09:19,073 INFO L93 Difference]: Finished difference Result 621 states and 809 transitions. [2022-11-21 17:09:19,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 17:09:19,074 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 89 [2022-11-21 17:09:19,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:09:19,077 INFO L225 Difference]: With dead ends: 621 [2022-11-21 17:09:19,077 INFO L226 Difference]: Without dead ends: 617 [2022-11-21 17:09:19,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:09:19,081 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 295 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 17:09:19,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 696 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 17:09:19,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2022-11-21 17:09:19,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 558. [2022-11-21 17:09:19,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 426 states have (on average 1.3028169014084507) internal successors, (555), 438 states have internal predecessors, (555), 82 states have call successors, (82), 39 states have call predecessors, (82), 39 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2022-11-21 17:09:19,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 719 transitions. [2022-11-21 17:09:19,121 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 719 transitions. Word has length 89 [2022-11-21 17:09:19,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:09:19,122 INFO L495 AbstractCegarLoop]: Abstraction has 558 states and 719 transitions. [2022-11-21 17:09:19,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-21 17:09:19,122 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 719 transitions. [2022-11-21 17:09:19,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-21 17:09:19,123 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:09:19,124 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-11-21 17:09:19,130 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 17:09:19,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:09:19,330 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting s3c_hwmon_probeErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-21 17:09:19,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:09:19,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1274109137, now seen corresponding path program 1 times [2022-11-21 17:09:19,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:09:19,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243586790] [2022-11-21 17:09:19,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:19,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:09:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:19,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-21 17:09:19,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:19,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 17:09:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:19,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 17:09:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:19,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-21 17:09:19,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:19,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 17:09:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:19,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-21 17:09:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:19,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-21 17:09:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:19,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 17:09:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:19,494 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-21 17:09:19,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:09:19,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243586790] [2022-11-21 17:09:19,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243586790] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:09:19,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027466953] [2022-11-21 17:09:19,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:19,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:09:19,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:09:19,500 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:09:19,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 17:09:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:19,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 17:09:19,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:09:19,754 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-21 17:09:19,754 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:09:19,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027466953] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:09:19,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:09:19,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-21 17:09:19,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877396332] [2022-11-21 17:09:19,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:09:19,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:09:19,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:09:19,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:09:19,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:09:19,756 INFO L87 Difference]: Start difference. First operand 558 states and 719 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-21 17:09:19,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:09:19,845 INFO L93 Difference]: Finished difference Result 1096 states and 1418 transitions. [2022-11-21 17:09:19,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:09:19,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 90 [2022-11-21 17:09:19,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:09:19,849 INFO L225 Difference]: With dead ends: 1096 [2022-11-21 17:09:19,849 INFO L226 Difference]: Without dead ends: 563 [2022-11-21 17:09:19,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:09:19,851 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 57 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:09:19,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 532 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:09:19,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2022-11-21 17:09:19,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 497. [2022-11-21 17:09:19,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 376 states have (on average 1.2632978723404256) internal successors, (475), 385 states have internal predecessors, (475), 74 states have call successors, (74), 39 states have call predecessors, (74), 39 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2022-11-21 17:09:19,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 623 transitions. [2022-11-21 17:09:19,886 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 623 transitions. Word has length 90 [2022-11-21 17:09:19,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:09:19,887 INFO L495 AbstractCegarLoop]: Abstraction has 497 states and 623 transitions. [2022-11-21 17:09:19,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-21 17:09:19,887 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 623 transitions. [2022-11-21 17:09:19,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-21 17:09:19,888 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:09:19,888 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 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] [2022-11-21 17:09:19,904 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 17:09:20,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:09:20,105 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-21 17:09:20,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:09:20,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1107796325, now seen corresponding path program 1 times [2022-11-21 17:09:20,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:09:20,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009454407] [2022-11-21 17:09:20,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:20,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:09:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:20,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-21 17:09:20,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:20,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 17:09:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:20,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 17:09:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:20,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-21 17:09:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:20,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 17:09:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:20,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-21 17:09:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:20,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-21 17:09:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:20,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 17:09:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:20,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-21 17:09:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:20,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-21 17:09:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:20,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 17:09:20,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:20,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-21 17:09:20,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:20,332 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-21 17:09:20,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:09:20,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009454407] [2022-11-21 17:09:20,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009454407] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:09:20,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528758727] [2022-11-21 17:09:20,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:20,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:09:20,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:09:20,335 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:09:20,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 17:09:20,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:20,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-21 17:09:20,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:09:20,619 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-21 17:09:20,620 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:09:20,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528758727] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:09:20,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:09:20,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2022-11-21 17:09:20,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341103875] [2022-11-21 17:09:20,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:09:20,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:09:20,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:09:20,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:09:20,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-21 17:09:20,622 INFO L87 Difference]: Start difference. First operand 497 states and 623 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-21 17:09:20,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:09:20,738 INFO L93 Difference]: Finished difference Result 1169 states and 1463 transitions. [2022-11-21 17:09:20,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 17:09:20,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 96 [2022-11-21 17:09:20,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:09:20,743 INFO L225 Difference]: With dead ends: 1169 [2022-11-21 17:09:20,743 INFO L226 Difference]: Without dead ends: 883 [2022-11-21 17:09:20,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-21 17:09:20,745 INFO L413 NwaCegarLoop]: 363 mSDtfsCounter, 201 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:09:20,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1338 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:09:20,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2022-11-21 17:09:20,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 691. [2022-11-21 17:09:20,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 524 states have (on average 1.2595419847328244) internal successors, (660), 536 states have internal predecessors, (660), 103 states have call successors, (103), 53 states have call predecessors, (103), 56 states have return successors, (106), 104 states have call predecessors, (106), 103 states have call successors, (106) [2022-11-21 17:09:20,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 869 transitions. [2022-11-21 17:09:20,816 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 869 transitions. Word has length 96 [2022-11-21 17:09:20,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:09:20,816 INFO L495 AbstractCegarLoop]: Abstraction has 691 states and 869 transitions. [2022-11-21 17:09:20,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-21 17:09:20,817 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 869 transitions. [2022-11-21 17:09:20,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-21 17:09:20,819 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:09:20,819 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 17:09:20,831 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 17:09:21,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:09:21,032 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-21 17:09:21,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:09:21,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1916421667, now seen corresponding path program 1 times [2022-11-21 17:09:21,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:09:21,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593327279] [2022-11-21 17:09:21,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:21,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:09:21,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:21,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-21 17:09:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:21,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 17:09:21,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:21,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 17:09:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:21,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-21 17:09:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:21,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 17:09:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:21,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-21 17:09:21,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:21,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-21 17:09:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:21,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 17:09:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:21,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-21 17:09:21,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:21,332 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-21 17:09:21,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:09:21,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593327279] [2022-11-21 17:09:21,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593327279] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:09:21,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:09:21,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 17:09:21,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145063550] [2022-11-21 17:09:21,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:09:21,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:09:21,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:09:21,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:09:21,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:09:21,334 INFO L87 Difference]: Start difference. First operand 691 states and 869 transitions. Second operand has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 17:09:21,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:09:21,830 INFO L93 Difference]: Finished difference Result 1413 states and 1794 transitions. [2022-11-21 17:09:21,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 17:09:21,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 96 [2022-11-21 17:09:21,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:09:21,837 INFO L225 Difference]: With dead ends: 1413 [2022-11-21 17:09:21,837 INFO L226 Difference]: Without dead ends: 1411 [2022-11-21 17:09:21,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:09:21,839 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 300 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 17:09:21,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 601 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 17:09:21,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2022-11-21 17:09:21,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1343. [2022-11-21 17:09:21,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 1019 states have (on average 1.254170755642787) internal successors, (1278), 1036 states have internal predecessors, (1278), 204 states have call successors, (204), 106 states have call predecessors, (204), 112 states have return successors, (225), 206 states have call predecessors, (225), 204 states have call successors, (225) [2022-11-21 17:09:21,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1707 transitions. [2022-11-21 17:09:21,938 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1707 transitions. Word has length 96 [2022-11-21 17:09:21,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:09:21,938 INFO L495 AbstractCegarLoop]: Abstraction has 1343 states and 1707 transitions. [2022-11-21 17:09:21,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 17:09:21,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1707 transitions. [2022-11-21 17:09:21,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-21 17:09:21,940 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:09:21,940 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 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] [2022-11-21 17:09:21,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 17:09:21,941 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-21 17:09:21,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:09:21,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1408694220, now seen corresponding path program 1 times [2022-11-21 17:09:21,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:09:21,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948245459] [2022-11-21 17:09:21,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:21,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:09:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:22,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-21 17:09:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:22,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 17:09:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:22,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 17:09:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:22,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-21 17:09:22,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:22,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 17:09:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:22,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-21 17:09:22,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:22,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-21 17:09:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:22,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 17:09:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:22,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-21 17:09:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:22,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-21 17:09:22,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:22,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 17:09:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:22,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-21 17:09:22,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:22,100 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-21 17:09:22,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:09:22,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948245459] [2022-11-21 17:09:22,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948245459] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:09:22,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248708169] [2022-11-21 17:09:22,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:22,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:09:22,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:09:22,102 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:09:22,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 17:09:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:22,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-21 17:09:22,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:09:22,385 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-21 17:09:22,385 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:09:22,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248708169] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:09:22,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:09:22,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2022-11-21 17:09:22,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230229231] [2022-11-21 17:09:22,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:09:22,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:09:22,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:09:22,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:09:22,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-21 17:09:22,390 INFO L87 Difference]: Start difference. First operand 1343 states and 1707 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-21 17:09:22,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:09:22,570 INFO L93 Difference]: Finished difference Result 2695 states and 3414 transitions. [2022-11-21 17:09:22,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 17:09:22,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 100 [2022-11-21 17:09:22,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:09:22,580 INFO L225 Difference]: With dead ends: 2695 [2022-11-21 17:09:22,580 INFO L226 Difference]: Without dead ends: 2125 [2022-11-21 17:09:22,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-21 17:09:22,583 INFO L413 NwaCegarLoop]: 361 mSDtfsCounter, 201 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:09:22,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1331 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:09:22,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2022-11-21 17:09:22,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 1343. [2022-11-21 17:09:22,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 1019 states have (on average 1.254170755642787) internal successors, (1278), 1036 states have internal predecessors, (1278), 204 states have call successors, (204), 106 states have call predecessors, (204), 112 states have return successors, (225), 206 states have call predecessors, (225), 204 states have call successors, (225) [2022-11-21 17:09:22,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1707 transitions. [2022-11-21 17:09:22,703 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1707 transitions. Word has length 100 [2022-11-21 17:09:22,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:09:22,704 INFO L495 AbstractCegarLoop]: Abstraction has 1343 states and 1707 transitions. [2022-11-21 17:09:22,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-21 17:09:22,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1707 transitions. [2022-11-21 17:09:22,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-11-21 17:09:22,707 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:09:22,707 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-11-21 17:09:22,715 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-21 17:09:22,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:09:22,913 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-21 17:09:22,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:09:22,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1458291270, now seen corresponding path program 1 times [2022-11-21 17:09:22,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:09:22,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036365839] [2022-11-21 17:09:22,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:22,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:09:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:23,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-21 17:09:23,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:23,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 17:09:23,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:23,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 17:09:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:23,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-21 17:09:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:23,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 17:09:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:23,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-21 17:09:23,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:23,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-21 17:09:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:23,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 17:09:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:23,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-21 17:09:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:23,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 17:09:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:23,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-21 17:09:23,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:23,340 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-21 17:09:23,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:09:23,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036365839] [2022-11-21 17:09:23,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036365839] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:09:23,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:09:23,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 17:09:23,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106227303] [2022-11-21 17:09:23,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:09:23,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 17:09:23,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:09:23,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 17:09:23,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:09:23,343 INFO L87 Difference]: Start difference. First operand 1343 states and 1707 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 6 states have internal predecessors, (77), 4 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-21 17:09:23,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:09:23,963 INFO L93 Difference]: Finished difference Result 1392 states and 1757 transitions. [2022-11-21 17:09:23,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 17:09:23,964 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 6 states have internal predecessors, (77), 4 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 115 [2022-11-21 17:09:23,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:09:23,968 INFO L225 Difference]: With dead ends: 1392 [2022-11-21 17:09:23,968 INFO L226 Difference]: Without dead ends: 708 [2022-11-21 17:09:23,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-11-21 17:09:23,971 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 420 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 17:09:23,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 583 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 17:09:23,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2022-11-21 17:09:24,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 677. [2022-11-21 17:09:24,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 512 states have (on average 1.248046875) internal successors, (639), 522 states have internal predecessors, (639), 103 states have call successors, (103), 53 states have call predecessors, (103), 56 states have return successors, (106), 104 states have call predecessors, (106), 103 states have call successors, (106) [2022-11-21 17:09:24,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 848 transitions. [2022-11-21 17:09:24,032 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 848 transitions. Word has length 115 [2022-11-21 17:09:24,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:09:24,032 INFO L495 AbstractCegarLoop]: Abstraction has 677 states and 848 transitions. [2022-11-21 17:09:24,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 6 states have internal predecessors, (77), 4 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-21 17:09:24,033 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 848 transitions. [2022-11-21 17:09:24,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-11-21 17:09:24,035 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:09:24,052 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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] [2022-11-21 17:09:24,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 17:09:24,053 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-21 17:09:24,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:09:24,053 INFO L85 PathProgramCache]: Analyzing trace with hash 2060624510, now seen corresponding path program 1 times [2022-11-21 17:09:24,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:09:24,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570771328] [2022-11-21 17:09:24,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:24,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:09:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:24,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-21 17:09:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:24,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 17:09:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:24,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 17:09:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:24,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-21 17:09:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:24,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 17:09:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:24,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 17:09:24,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:24,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 17:09:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:24,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-21 17:09:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:24,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 17:09:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:24,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-21 17:09:24,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:24,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-21 17:09:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:24,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 17:09:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:24,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-21 17:09:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:24,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-21 17:09:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:24,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 17:09:24,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:24,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-21 17:09:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:24,396 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-21 17:09:24,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:09:24,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570771328] [2022-11-21 17:09:24,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570771328] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:09:24,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838062008] [2022-11-21 17:09:24,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:24,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:09:24,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:09:24,399 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:09:24,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 17:09:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:24,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 17:09:24,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:09:24,697 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-21 17:09:24,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:09:24,809 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-21 17:09:24,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838062008] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:09:24,810 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:09:24,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2022-11-21 17:09:24,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938567319] [2022-11-21 17:09:24,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:09:24,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 17:09:24,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:09:24,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 17:09:24,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-21 17:09:24,812 INFO L87 Difference]: Start difference. First operand 677 states and 848 transitions. Second operand has 9 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 6 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-11-21 17:09:25,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:09:25,526 INFO L93 Difference]: Finished difference Result 741 states and 941 transitions. [2022-11-21 17:09:25,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-21 17:09:25,527 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 6 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) Word has length 129 [2022-11-21 17:09:25,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:09:25,531 INFO L225 Difference]: With dead ends: 741 [2022-11-21 17:09:25,531 INFO L226 Difference]: Without dead ends: 740 [2022-11-21 17:09:25,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-11-21 17:09:25,532 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 134 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 17:09:25,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 743 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 17:09:25,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2022-11-21 17:09:25,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 676. [2022-11-21 17:09:25,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 512 states have (on average 1.24609375) internal successors, (638), 521 states have internal predecessors, (638), 103 states have call successors, (103), 53 states have call predecessors, (103), 56 states have return successors, (106), 104 states have call predecessors, (106), 103 states have call successors, (106) [2022-11-21 17:09:25,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 847 transitions. [2022-11-21 17:09:25,594 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 847 transitions. Word has length 129 [2022-11-21 17:09:25,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:09:25,595 INFO L495 AbstractCegarLoop]: Abstraction has 676 states and 847 transitions. [2022-11-21 17:09:25,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 6 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-11-21 17:09:25,595 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 847 transitions. [2022-11-21 17:09:25,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-11-21 17:09:25,598 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:09:25,598 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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] [2022-11-21 17:09:25,609 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-21 17:09:25,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-21 17:09:25,810 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting s3c_hwmon_removeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-21 17:09:25,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:09:25,811 INFO L85 PathProgramCache]: Analyzing trace with hash -545149392, now seen corresponding path program 1 times [2022-11-21 17:09:25,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:09:25,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096334868] [2022-11-21 17:09:25,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:25,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:09:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:25,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-21 17:09:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:25,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 17:09:25,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:25,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 17:09:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:25,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-21 17:09:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:26,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 17:09:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:26,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 17:09:26,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:26,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 17:09:26,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:26,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-21 17:09:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:26,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 17:09:26,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:26,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-21 17:09:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:26,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-21 17:09:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:26,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 17:09:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:26,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-21 17:09:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:26,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-21 17:09:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:26,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 17:09:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:26,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-21 17:09:26,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:26,052 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-21 17:09:26,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:09:26,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096334868] [2022-11-21 17:09:26,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096334868] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:09:26,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041584179] [2022-11-21 17:09:26,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:26,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:09:26,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:09:26,056 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:09:26,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 17:09:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:26,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 17:09:26,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:09:26,359 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-21 17:09:26,360 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:09:26,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041584179] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:09:26,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:09:26,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-21 17:09:26,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045560015] [2022-11-21 17:09:26,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:09:26,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:09:26,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:09:26,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:09:26,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:09:26,362 INFO L87 Difference]: Start difference. First operand 676 states and 847 transitions. Second operand has 4 states, 3 states have (on average 26.333333333333332) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-11-21 17:09:26,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:09:26,431 INFO L93 Difference]: Finished difference Result 676 states and 847 transitions. [2022-11-21 17:09:26,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:09:26,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 26.333333333333332) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 130 [2022-11-21 17:09:26,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:09:26,435 INFO L225 Difference]: With dead ends: 676 [2022-11-21 17:09:26,435 INFO L226 Difference]: Without dead ends: 675 [2022-11-21 17:09:26,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:09:26,438 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 4 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:09:26,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 731 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:09:26,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2022-11-21 17:09:26,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 672. [2022-11-21 17:09:26,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 510 states have (on average 1.2450980392156863) internal successors, (635), 518 states have internal predecessors, (635), 102 states have call successors, (102), 53 states have call predecessors, (102), 56 states have return successors, (105), 103 states have call predecessors, (105), 102 states have call successors, (105) [2022-11-21 17:09:26,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 842 transitions. [2022-11-21 17:09:26,500 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 842 transitions. Word has length 130 [2022-11-21 17:09:26,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:09:26,500 INFO L495 AbstractCegarLoop]: Abstraction has 672 states and 842 transitions. [2022-11-21 17:09:26,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 26.333333333333332) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-11-21 17:09:26,501 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 842 transitions. [2022-11-21 17:09:26,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-11-21 17:09:26,503 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:09:26,503 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2022-11-21 17:09:26,515 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-21 17:09:26,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-21 17:09:26,710 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-21 17:09:26,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:09:26,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1741917965, now seen corresponding path program 1 times [2022-11-21 17:09:26,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:09:26,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392467832] [2022-11-21 17:09:26,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:26,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:09:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:26,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-21 17:09:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:26,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 17:09:26,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:26,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 17:09:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:26,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-21 17:09:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:26,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 17:09:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:26,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 17:09:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:26,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 17:09:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:26,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-21 17:09:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:26,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 17:09:26,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:26,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 17:09:26,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:26,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 17:09:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:26,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-21 17:09:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:26,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 17:09:26,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:26,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-21 17:09:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:26,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-21 17:09:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:26,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-21 17:09:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:26,987 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-21 17:09:26,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:09:26,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392467832] [2022-11-21 17:09:26,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392467832] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:09:26,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20188229] [2022-11-21 17:09:26,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:26,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:09:26,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:09:26,990 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:09:27,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-21 17:09:27,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:27,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 17:09:27,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:09:27,444 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 17:09:27,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:09:27,610 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-21 17:09:27,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20188229] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:09:27,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:09:27,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2022-11-21 17:09:27,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566891336] [2022-11-21 17:09:27,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:09:27,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 17:09:27,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:09:27,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 17:09:27,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-21 17:09:27,614 INFO L87 Difference]: Start difference. First operand 672 states and 842 transitions. Second operand has 9 states, 8 states have (on average 26.0) internal successors, (208), 7 states have internal predecessors, (208), 6 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (36), 6 states have call predecessors, (36), 6 states have call successors, (36) [2022-11-21 17:09:28,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:09:28,506 INFO L93 Difference]: Finished difference Result 698 states and 877 transitions. [2022-11-21 17:09:28,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 17:09:28,507 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 26.0) internal successors, (208), 7 states have internal predecessors, (208), 6 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (36), 6 states have call predecessors, (36), 6 states have call successors, (36) Word has length 131 [2022-11-21 17:09:28,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:09:28,510 INFO L225 Difference]: With dead ends: 698 [2022-11-21 17:09:28,510 INFO L226 Difference]: Without dead ends: 696 [2022-11-21 17:09:28,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2022-11-21 17:09:28,512 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 940 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 407 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 407 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-21 17:09:28,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 494 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [407 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-21 17:09:28,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2022-11-21 17:09:28,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 670. [2022-11-21 17:09:28,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 510 states have (on average 1.2411764705882353) internal successors, (633), 516 states have internal predecessors, (633), 102 states have call successors, (102), 53 states have call predecessors, (102), 56 states have return successors, (105), 103 states have call predecessors, (105), 102 states have call successors, (105) [2022-11-21 17:09:28,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 840 transitions. [2022-11-21 17:09:28,578 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 840 transitions. Word has length 131 [2022-11-21 17:09:28,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:09:28,578 INFO L495 AbstractCegarLoop]: Abstraction has 670 states and 840 transitions. [2022-11-21 17:09:28,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 26.0) internal successors, (208), 7 states have internal predecessors, (208), 6 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (36), 6 states have call predecessors, (36), 6 states have call successors, (36) [2022-11-21 17:09:28,579 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 840 transitions. [2022-11-21 17:09:28,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-11-21 17:09:28,581 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:09:28,582 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2022-11-21 17:09:28,592 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-21 17:09:28,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-21 17:09:28,789 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-21 17:09:28,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:09:28,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1835118270, now seen corresponding path program 1 times [2022-11-21 17:09:28,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:09:28,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827583482] [2022-11-21 17:09:28,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:28,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:09:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:28,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-21 17:09:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:28,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 17:09:28,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:28,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 17:09:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:29,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-21 17:09:29,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:29,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 17:09:29,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:29,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 17:09:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:29,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 17:09:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:29,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-21 17:09:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:29,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 17:09:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:29,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 17:09:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:29,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 17:09:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:29,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-21 17:09:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:29,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 17:09:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:29,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-21 17:09:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:29,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-21 17:09:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:29,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-21 17:09:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:29,071 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-21 17:09:29,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:09:29,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827583482] [2022-11-21 17:09:29,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827583482] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:09:29,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527346354] [2022-11-21 17:09:29,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:29,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:09:29,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:09:29,074 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:09:29,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-21 17:09:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:29,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 17:09:29,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:09:29,540 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 17:09:29,540 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:09:29,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527346354] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:09:29,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:09:29,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-21 17:09:29,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154290042] [2022-11-21 17:09:29,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:09:29,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:09:29,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:09:29,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:09:29,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:09:29,542 INFO L87 Difference]: Start difference. First operand 670 states and 840 transitions. Second operand has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-21 17:09:29,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:09:29,731 INFO L93 Difference]: Finished difference Result 670 states and 840 transitions. [2022-11-21 17:09:29,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:09:29,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 132 [2022-11-21 17:09:29,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:09:29,733 INFO L225 Difference]: With dead ends: 670 [2022-11-21 17:09:29,733 INFO L226 Difference]: Without dead ends: 0 [2022-11-21 17:09:29,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:09:29,735 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 212 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:09:29,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 449 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:09:29,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-21 17:09:29,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-21 17:09:29,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:09:29,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-21 17:09:29,737 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 132 [2022-11-21 17:09:29,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:09:29,737 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-21 17:09:29,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-21 17:09:29,737 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-21 17:09:29,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-21 17:09:29,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2022-11-21 17:09:29,741 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2022-11-21 17:09:29,741 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2022-11-21 17:09:29,741 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2022-11-21 17:09:29,741 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2022-11-21 17:09:29,741 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2022-11-21 17:09:29,742 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2022-11-21 17:09:29,742 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_removeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2022-11-21 17:09:29,742 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2022-11-21 17:09:29,742 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2022-11-21 17:09:29,742 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2022-11-21 17:09:29,743 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2022-11-21 17:09:29,743 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2022-11-21 17:09:29,743 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2022-11-21 17:09:29,743 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_device_create_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2022-11-21 17:09:29,743 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_device_create_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2022-11-21 17:09:29,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-21 17:09:29,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-21 17:09:29,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-21 17:09:38,814 INFO L902 garLoopResultBuilder]: At program point s3c_hwmon_remove_rawENTRY(lines 940 945) the Hoare annotation is: true [2022-11-21 17:09:38,814 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_rawFINAL(lines 940 945) no Hoare annotation was computed. [2022-11-21 17:09:38,815 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_rawEXIT(lines 940 945) no Hoare annotation was computed. [2022-11-21 17:09:38,815 INFO L895 garLoopResultBuilder]: At program point s3c_hwmon_probeENTRY(lines 1040 1149) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~ldv_count_2~0 0) (= |old(#valid)| |#valid|))) [2022-11-21 17:09:38,815 INFO L895 garLoopResultBuilder]: At program point L1142(lines 1053 1148) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-21 17:09:38,816 INFO L895 garLoopResultBuilder]: At program point L1076(line 1076) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-21 17:09:38,816 INFO L899 garLoopResultBuilder]: For program point L1076-1(line 1076) no Hoare annotation was computed. [2022-11-21 17:09:38,816 INFO L895 garLoopResultBuilder]: At program point L1456(lines 1455 1457) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-21 17:09:38,816 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeFINAL(lines 1040 1149) no Hoare annotation was computed. [2022-11-21 17:09:38,816 INFO L895 garLoopResultBuilder]: At program point L1002-1(line 1002) the Hoare annotation is: (let ((.cse0 (= ~ldv_count_2~0 0))) (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646) .cse0) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 0)))) [2022-11-21 17:09:38,817 INFO L895 garLoopResultBuilder]: At program point L837(lines 823 840) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-21 17:09:38,817 INFO L899 garLoopResultBuilder]: For program point L1118(line 1118) no Hoare annotation was computed. [2022-11-21 17:09:38,817 INFO L899 garLoopResultBuilder]: For program point L1118-1(line 1118) no Hoare annotation was computed. [2022-11-21 17:09:38,817 INFO L895 garLoopResultBuilder]: At program point L1135(lines 1053 1148) the Hoare annotation is: (let ((.cse0 (= ~ldv_count_2~0 0))) (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646) .cse0) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 0)))) [2022-11-21 17:09:38,818 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1122) no Hoare annotation was computed. [2022-11-21 17:09:38,818 INFO L895 garLoopResultBuilder]: At program point L937(lines 934 939) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-21 17:09:38,818 INFO L895 garLoopResultBuilder]: At program point L1507(line 1507) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-21 17:09:38,818 INFO L899 garLoopResultBuilder]: For program point L1507-1(line 1507) no Hoare annotation was computed. [2022-11-21 17:09:38,818 INFO L895 garLoopResultBuilder]: At program point L1507-2(lines 1506 1508) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-21 17:09:38,818 INFO L899 garLoopResultBuilder]: For program point L830(lines 830 838) no Hoare annotation was computed. [2022-11-21 17:09:38,819 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1118) no Hoare annotation was computed. [2022-11-21 17:09:38,819 INFO L895 garLoopResultBuilder]: At program point L1144(line 1144) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-21 17:09:38,819 INFO L899 garLoopResultBuilder]: For program point L1144-1(line 1144) no Hoare annotation was computed. [2022-11-21 17:09:38,819 INFO L899 garLoopResultBuilder]: For program point L1103(lines 1103 1107) no Hoare annotation was computed. [2022-11-21 17:09:38,819 INFO L899 garLoopResultBuilder]: For program point L1103-2(lines 1103 1107) no Hoare annotation was computed. [2022-11-21 17:09:38,820 INFO L895 garLoopResultBuilder]: At program point L1128(lines 1053 1148) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (<= |s3c_hwmon_probe_~i~0#1| 0) (= ~ldv_count_2~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 0))) [2022-11-21 17:09:38,820 INFO L895 garLoopResultBuilder]: At program point L1029(lines 996 1031) the Hoare annotation is: (let ((.cse0 (= ~ldv_count_2~0 0))) (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646) .cse0) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 0)))) [2022-11-21 17:09:38,820 INFO L895 garLoopResultBuilder]: At program point L1087(line 1087) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-21 17:09:38,820 INFO L899 garLoopResultBuilder]: For program point L1087-1(line 1087) no Hoare annotation was computed. [2022-11-21 17:09:38,820 INFO L895 garLoopResultBuilder]: At program point L1145(lines 1053 1148) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-21 17:09:38,821 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1132) no Hoare annotation was computed. [2022-11-21 17:09:38,821 INFO L895 garLoopResultBuilder]: At program point L1352(line 1352) the Hoare annotation is: (let ((.cse0 (= ~ldv_count_2~0 0))) (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646) .cse0) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 0)))) [2022-11-21 17:09:38,821 INFO L899 garLoopResultBuilder]: For program point L1063(lines 1063 1067) no Hoare annotation was computed. [2022-11-21 17:09:38,821 INFO L899 garLoopResultBuilder]: For program point L1352-1(line 1352) no Hoare annotation was computed. [2022-11-21 17:09:38,821 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeEXIT(lines 1040 1149) no Hoare annotation was computed. [2022-11-21 17:09:38,821 INFO L899 garLoopResultBuilder]: For program point L1121(line 1121) no Hoare annotation was computed. [2022-11-21 17:09:38,822 INFO L899 garLoopResultBuilder]: For program point L1088(lines 1088 1094) no Hoare annotation was computed. [2022-11-21 17:09:38,822 INFO L895 garLoopResultBuilder]: At program point L1344(line 1344) the Hoare annotation is: (let ((.cse0 (= ~ldv_count_2~0 0))) (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646) .cse0) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 0)))) [2022-11-21 17:09:38,822 INFO L899 garLoopResultBuilder]: For program point L1344-1(line 1344) no Hoare annotation was computed. [2022-11-21 17:09:38,822 INFO L899 garLoopResultBuilder]: For program point L1022(lines 1022 1026) no Hoare annotation was computed. [2022-11-21 17:09:38,822 INFO L899 garLoopResultBuilder]: For program point L1014(lines 1014 1028) no Hoare annotation was computed. [2022-11-21 17:09:38,822 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1122) no Hoare annotation was computed. [2022-11-21 17:09:38,823 INFO L899 garLoopResultBuilder]: For program point L1014-1(lines 1014 1028) no Hoare annotation was computed. [2022-11-21 17:09:38,823 INFO L895 garLoopResultBuilder]: At program point L1361(lines 1356 1363) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-21 17:09:38,823 INFO L895 garLoopResultBuilder]: At program point L907(lines 903 909) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-21 17:09:38,823 INFO L895 garLoopResultBuilder]: At program point L1353(lines 1348 1355) the Hoare annotation is: (let ((.cse0 (= ~ldv_count_2~0 0))) (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646) .cse0) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 0)))) [2022-11-21 17:09:38,823 INFO L899 garLoopResultBuilder]: For program point L1122(line 1122) no Hoare annotation was computed. [2022-11-21 17:09:38,824 INFO L895 garLoopResultBuilder]: At program point L833(line 833) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-21 17:09:38,824 INFO L895 garLoopResultBuilder]: At program point L1345(lines 1340 1347) the Hoare annotation is: (let ((.cse0 (= ~ldv_count_2~0 0))) (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646) .cse0) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 0)))) [2022-11-21 17:09:38,824 INFO L899 garLoopResultBuilder]: For program point L1056(lines 1056 1060) no Hoare annotation was computed. [2022-11-21 17:09:38,824 INFO L899 garLoopResultBuilder]: For program point L833-1(line 833) no Hoare annotation was computed. [2022-11-21 17:09:38,824 INFO L895 garLoopResultBuilder]: At program point L1023(line 1023) the Hoare annotation is: (let ((.cse0 (= ~ldv_count_2~0 0))) (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646) .cse0) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 0)))) [2022-11-21 17:09:38,824 INFO L899 garLoopResultBuilder]: For program point L1023-1(line 1023) no Hoare annotation was computed. [2022-11-21 17:09:38,825 INFO L895 garLoopResultBuilder]: At program point L1015-1(line 1015) the Hoare annotation is: (let ((.cse0 (= ~ldv_count_2~0 0))) (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646) .cse0) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 0)))) [2022-11-21 17:09:38,825 INFO L895 garLoopResultBuilder]: At program point L1073(line 1073) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-21 17:09:38,825 INFO L899 garLoopResultBuilder]: For program point L1073-1(line 1073) no Hoare annotation was computed. [2022-11-21 17:09:38,825 INFO L895 garLoopResultBuilder]: At program point L1131(lines 1053 1148) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_count_1~0 0)) (and (or (= |s3c_hwmon_probe_~i~0#1| 0) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646))) (= ~ldv_count_2~0 0)) (not (<= ~ref_cnt~0 0))) [2022-11-21 17:09:38,825 INFO L895 garLoopResultBuilder]: At program point L1123(lines 1115 1129) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (< |s3c_hwmon_probe_~i~0#1| 2147483646) (= ~ldv_count_2~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 0))) [2022-11-21 17:09:38,826 INFO L895 garLoopResultBuilder]: At program point L1090(line 1090) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-21 17:09:38,826 INFO L899 garLoopResultBuilder]: For program point L1090-1(line 1090) no Hoare annotation was computed. [2022-11-21 17:09:38,826 INFO L895 garLoopResultBuilder]: At program point L1470(lines 1469 1471) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-21 17:09:38,826 INFO L899 garLoopResultBuilder]: For program point L1115(lines 1115 1130) no Hoare annotation was computed. [2022-11-21 17:09:38,826 INFO L899 garLoopResultBuilder]: For program point L1082(lines 1082 1085) no Hoare annotation was computed. [2022-11-21 17:09:38,826 INFO L895 garLoopResultBuilder]: At program point L1140(line 1140) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (<= |s3c_hwmon_probe_~i~0#1| 0) (= ~ldv_count_2~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 0))) [2022-11-21 17:09:38,827 INFO L899 garLoopResultBuilder]: For program point L1140-1(line 1140) no Hoare annotation was computed. [2022-11-21 17:09:38,827 INFO L899 garLoopResultBuilder]: For program point L1074(lines 1074 1080) no Hoare annotation was computed. [2022-11-21 17:09:38,827 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1132) no Hoare annotation was computed. [2022-11-21 17:09:38,827 INFO L899 garLoopResultBuilder]: For program point L1132(line 1132) no Hoare annotation was computed. [2022-11-21 17:09:38,827 INFO L899 garLoopResultBuilder]: For program point L1099(lines 1099 1102) no Hoare annotation was computed. [2022-11-21 17:09:38,827 INFO L895 garLoopResultBuilder]: At program point L835(line 835) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-21 17:09:38,828 INFO L895 garLoopResultBuilder]: At program point L835-1(line 835) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-21 17:09:38,828 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1118) no Hoare annotation was computed. [2022-11-21 17:09:38,828 INFO L895 garLoopResultBuilder]: At program point L1141(lines 1053 1148) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-21 17:09:38,828 INFO L899 garLoopResultBuilder]: For program point L1108(lines 1108 1112) no Hoare annotation was computed. [2022-11-21 17:09:38,828 INFO L899 garLoopResultBuilder]: For program point L1009(lines 1009 1013) no Hoare annotation was computed. [2022-11-21 17:09:38,828 INFO L895 garLoopResultBuilder]: At program point L1133(lines 1053 1148) the Hoare annotation is: (let ((.cse0 (= ~ldv_count_2~0 0))) (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0) (not (= ~ref_cnt~0 0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (<= |s3c_hwmon_probe_~i~0#1| 2147483646) .cse0) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)))) [2022-11-21 17:09:38,829 INFO L899 garLoopResultBuilder]: For program point L1513(lines 1513 1515) no Hoare annotation was computed. [2022-11-21 17:09:38,829 INFO L895 garLoopResultBuilder]: At program point L1480(line 1480) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-21 17:09:38,829 INFO L899 garLoopResultBuilder]: For program point L1480-1(line 1480) no Hoare annotation was computed. [2022-11-21 17:09:38,829 INFO L895 garLoopResultBuilder]: At program point L1480-2(lines 1479 1481) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-21 17:09:38,829 INFO L895 garLoopResultBuilder]: At program point L1125(lines 1115 1129) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_count_1~0 0)) (and (<= 0 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646) (= ~ldv_count_2~0 0)) (not (<= ~ref_cnt~0 0))) [2022-11-21 17:09:38,830 INFO L899 garLoopResultBuilder]: For program point L836(line 836) no Hoare annotation was computed. [2022-11-21 17:09:38,830 INFO L895 garLoopResultBuilder]: At program point L836-1(line 836) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-21 17:09:38,830 INFO L899 garLoopResultBuilder]: For program point L836-2(line 836) no Hoare annotation was computed. [2022-11-21 17:09:38,830 INFO L895 garLoopResultBuilder]: At program point platform_get_drvdataENTRY(lines 895 902) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_count_2~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 1))) [2022-11-21 17:09:38,830 INFO L899 garLoopResultBuilder]: For program point platform_get_drvdataEXIT(lines 895 902) no Hoare annotation was computed. [2022-11-21 17:09:38,830 INFO L895 garLoopResultBuilder]: At program point L1463(line 1463) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_count_2~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 1))) [2022-11-21 17:09:38,831 INFO L899 garLoopResultBuilder]: For program point platform_get_drvdataFINAL(lines 895 902) no Hoare annotation was computed. [2022-11-21 17:09:38,831 INFO L899 garLoopResultBuilder]: For program point L1463-1(line 1463) no Hoare annotation was computed. [2022-11-21 17:09:38,831 INFO L902 garLoopResultBuilder]: At program point L1463-2(lines 1462 1464) the Hoare annotation is: true [2022-11-21 17:09:38,831 INFO L902 garLoopResultBuilder]: At program point ldv_undef_intENTRY(lines 860 867) the Hoare annotation is: true [2022-11-21 17:09:38,831 INFO L899 garLoopResultBuilder]: For program point ldv_undef_intFINAL(lines 860 867) no Hoare annotation was computed. [2022-11-21 17:09:38,831 INFO L899 garLoopResultBuilder]: For program point ldv_undef_intEXIT(lines 860 867) no Hoare annotation was computed. [2022-11-21 17:09:38,831 INFO L899 garLoopResultBuilder]: For program point hwmon_device_unregisterFINAL(lines 1482 1484) no Hoare annotation was computed. [2022-11-21 17:09:38,832 INFO L902 garLoopResultBuilder]: At program point hwmon_device_unregisterENTRY(lines 1482 1484) the Hoare annotation is: true [2022-11-21 17:09:38,832 INFO L899 garLoopResultBuilder]: For program point hwmon_device_unregisterEXIT(lines 1482 1484) no Hoare annotation was computed. [2022-11-21 17:09:38,832 INFO L899 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 876 882) no Hoare annotation was computed. [2022-11-21 17:09:38,832 INFO L902 garLoopResultBuilder]: At program point ldv_stopENTRY(lines 876 882) the Hoare annotation is: true [2022-11-21 17:09:38,832 INFO L895 garLoopResultBuilder]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (= |#memory_int| |old(#memory_int)|) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_count_2~0 0)) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 0))) [2022-11-21 17:09:38,832 INFO L899 garLoopResultBuilder]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2022-11-21 17:09:38,833 INFO L899 garLoopResultBuilder]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2022-11-21 17:09:38,833 INFO L902 garLoopResultBuilder]: At program point s3c_adc_releaseENTRY(lines 1509 1511) the Hoare annotation is: true [2022-11-21 17:09:38,833 INFO L899 garLoopResultBuilder]: For program point s3c_adc_releaseEXIT(lines 1509 1511) no Hoare annotation was computed. [2022-11-21 17:09:38,833 INFO L899 garLoopResultBuilder]: For program point s3c_adc_releaseFINAL(lines 1509 1511) no Hoare annotation was computed. [2022-11-21 17:09:38,833 INFO L899 garLoopResultBuilder]: For program point L801(line 801) no Hoare annotation was computed. [2022-11-21 17:09:38,833 INFO L899 garLoopResultBuilder]: For program point L801-2(lines 800 802) no Hoare annotation was computed. [2022-11-21 17:09:38,834 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 800 802) the Hoare annotation is: true [2022-11-21 17:09:38,834 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 800 802) no Hoare annotation was computed. [2022-11-21 17:09:38,834 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_removeFINAL(lines 1150 1173) no Hoare annotation was computed. [2022-11-21 17:09:38,834 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_removeEXIT(lines 1150 1173) no Hoare annotation was computed. [2022-11-21 17:09:38,834 INFO L895 garLoopResultBuilder]: At program point L1170(line 1170) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (and (<= 1 s3c_hwmon_remove_~i~1) (<= s3c_hwmon_remove_~i~1 2147483646)) (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_count_2~0 0)) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 1))) [2022-11-21 17:09:38,834 INFO L895 garLoopResultBuilder]: At program point L1169(line 1169) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (and (<= 1 s3c_hwmon_remove_~i~1) (<= s3c_hwmon_remove_~i~1 2147483646)) (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_count_2~0 0)) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 1))) [2022-11-21 17:09:38,835 INFO L899 garLoopResultBuilder]: For program point L1170-1(line 1170) no Hoare annotation was computed. [2022-11-21 17:09:38,835 INFO L899 garLoopResultBuilder]: For program point L1169-1(line 1169) no Hoare annotation was computed. [2022-11-21 17:09:38,835 INFO L895 garLoopResultBuilder]: At program point L1166(lines 1155 1172) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (= s3c_hwmon_remove_~i~1 0) (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) (and (<= 1 s3c_hwmon_remove_~i~1) (< s3c_hwmon_remove_~i~1 2147483646)) (not (= ~ldv_count_2~0 0)) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 1))) [2022-11-21 17:09:38,835 INFO L895 garLoopResultBuilder]: At program point L1164(lines 1155 1172) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (= s3c_hwmon_remove_~i~1 0) (and (<= 1 s3c_hwmon_remove_~i~1) (<= s3c_hwmon_remove_~i~1 2147483646)) (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_count_2~0 0)) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 1))) [2022-11-21 17:09:38,835 INFO L899 garLoopResultBuilder]: For program point L1163(line 1163) no Hoare annotation was computed. [2022-11-21 17:09:38,835 INFO L899 garLoopResultBuilder]: For program point L1162(line 1162) no Hoare annotation was computed. [2022-11-21 17:09:38,836 INFO L895 garLoopResultBuilder]: At program point s3c_hwmon_removeENTRY(lines 1150 1173) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_count_2~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 1))) [2022-11-21 17:09:38,836 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1163) no Hoare annotation was computed. [2022-11-21 17:09:38,836 INFO L902 garLoopResultBuilder]: At program point L1158(line 1158) the Hoare annotation is: true [2022-11-21 17:09:38,836 INFO L899 garLoopResultBuilder]: For program point L1158-1(line 1158) no Hoare annotation was computed. [2022-11-21 17:09:38,836 INFO L895 garLoopResultBuilder]: At program point L1156(line 1156) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_count_2~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 1))) [2022-11-21 17:09:38,837 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_removeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1163) no Hoare annotation was computed. [2022-11-21 17:09:38,837 INFO L899 garLoopResultBuilder]: For program point L1156-1(line 1156) no Hoare annotation was computed. [2022-11-21 17:09:38,837 INFO L902 garLoopResultBuilder]: At program point L1400(lines 1397 1402) the Hoare annotation is: true [2022-11-21 17:09:38,837 INFO L899 garLoopResultBuilder]: For program point PTR_ERREXIT(lines 1324 1331) no Hoare annotation was computed. [2022-11-21 17:09:38,837 INFO L902 garLoopResultBuilder]: At program point PTR_ERRENTRY(lines 1324 1331) the Hoare annotation is: true [2022-11-21 17:09:38,837 INFO L899 garLoopResultBuilder]: For program point PTR_ERRFINAL(lines 1324 1331) no Hoare annotation was computed. [2022-11-21 17:09:38,837 INFO L899 garLoopResultBuilder]: For program point ldv_is_errEXIT(lines 1385 1390) no Hoare annotation was computed. [2022-11-21 17:09:38,838 INFO L902 garLoopResultBuilder]: At program point ldv_is_errENTRY(lines 1385 1390) the Hoare annotation is: true [2022-11-21 17:09:38,838 INFO L899 garLoopResultBuilder]: For program point ldv_is_errFINAL(lines 1385 1390) no Hoare annotation was computed. [2022-11-21 17:09:38,838 INFO L902 garLoopResultBuilder]: At program point L817(line 817) the Hoare annotation is: true [2022-11-21 17:09:38,838 INFO L902 garLoopResultBuilder]: At program point L818-1(line 818) the Hoare annotation is: true [2022-11-21 17:09:38,838 INFO L902 garLoopResultBuilder]: At program point L817-1(line 817) the Hoare annotation is: true [2022-11-21 17:09:38,838 INFO L899 garLoopResultBuilder]: For program point L818-2(line 818) no Hoare annotation was computed. [2022-11-21 17:09:38,839 INFO L895 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 805 822) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_state_variable_0~0 2))) (.cse1 (not (= ~ldv_count_2~0 0))) (.cse2 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse3 (not (= ~ldv_count_1~0 0)))) (and (or (not (<= ~probed_1~0 0)) .cse0 (not (<= 0 ~ref_cnt~0)) .cse1 .cse2 .cse3 (not (<= ~ref_cnt~0 0))) (or .cse0 (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) .cse1 .cse2 .cse3 (not (<= ~ref_cnt~0 1))))) [2022-11-21 17:09:38,839 INFO L899 garLoopResultBuilder]: For program point L812(lines 812 820) no Hoare annotation was computed. [2022-11-21 17:09:38,839 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 805 822) no Hoare annotation was computed. [2022-11-21 17:09:38,839 INFO L899 garLoopResultBuilder]: For program point L818(line 818) no Hoare annotation was computed. [2022-11-21 17:09:38,839 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 805 822) no Hoare annotation was computed. [2022-11-21 17:09:38,839 INFO L899 garLoopResultBuilder]: For program point device_remove_fileEXIT(lines 1476 1478) no Hoare annotation was computed. [2022-11-21 17:09:38,840 INFO L902 garLoopResultBuilder]: At program point device_remove_fileENTRY(lines 1476 1478) the Hoare annotation is: true [2022-11-21 17:09:38,840 INFO L899 garLoopResultBuilder]: For program point device_remove_fileFINAL(lines 1476 1478) no Hoare annotation was computed. [2022-11-21 17:09:38,840 INFO L899 garLoopResultBuilder]: For program point L1249(line 1249) no Hoare annotation was computed. [2022-11-21 17:09:38,840 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1254) no Hoare annotation was computed. [2022-11-21 17:09:38,840 INFO L899 garLoopResultBuilder]: For program point L1307(line 1307) no Hoare annotation was computed. [2022-11-21 17:09:38,840 INFO L895 garLoopResultBuilder]: At program point L1497(lines 1496 1498) the Hoare annotation is: (and (= ~ldv_count_1~0 0) (<= ~probed_1~0 0) (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0)) [2022-11-21 17:09:38,841 INFO L899 garLoopResultBuilder]: For program point L1233(line 1233) no Hoare annotation was computed. [2022-11-21 17:09:38,841 INFO L899 garLoopResultBuilder]: For program point L1291(lines 1291 1305) no Hoare annotation was computed. [2022-11-21 17:09:38,841 INFO L899 garLoopResultBuilder]: For program point L1283(lines 1283 1288) no Hoare annotation was computed. [2022-11-21 17:09:38,841 INFO L899 garLoopResultBuilder]: For program point L1250(lines 1250 1259) no Hoare annotation was computed. [2022-11-21 17:09:38,841 INFO L899 garLoopResultBuilder]: For program point L1250-1(lines 1236 1273) no Hoare annotation was computed. [2022-11-21 17:09:38,841 INFO L895 garLoopResultBuilder]: At program point L1217(lines 1210 1219) the Hoare annotation is: (and (= ~ldv_count_1~0 0) (<= ~probed_1~0 0) (= ~ldv_state_variable_0~0 2) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0)) [2022-11-21 17:09:38,842 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1242) no Hoare annotation was computed. [2022-11-21 17:09:38,842 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-21 17:09:38,842 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-21 17:09:38,842 INFO L902 garLoopResultBuilder]: At program point L1308(line 1308) the Hoare annotation is: true [2022-11-21 17:09:38,842 INFO L899 garLoopResultBuilder]: For program point L1242(line 1242) no Hoare annotation was computed. [2022-11-21 17:09:38,842 INFO L899 garLoopResultBuilder]: For program point L1242-1(line 1242) no Hoare annotation was computed. [2022-11-21 17:09:38,842 INFO L899 garLoopResultBuilder]: For program point L1234(lines 1234 1276) no Hoare annotation was computed. [2022-11-21 17:09:38,843 INFO L895 garLoopResultBuilder]: At program point L1317(lines 1225 1322) the Hoare annotation is: (let ((.cse2 (= ~ldv_state_variable_0~0 2)) (.cse0 (= ~ldv_count_1~0 0)) (.cse1 (<= ~probed_1~0 0)) (.cse4 (= ~ldv_state_variable_1~0 0)) (.cse3 (= ~ldv_count_2~0 0))) (or (and (<= ~ref_cnt~0 0) .cse0 .cse1 (<= 0 ~ref_cnt~0) .cse2 .cse3) (and .cse0 (= ~ldv_state_variable_1~0 2) .cse2 (<= 1 ~ref_cnt~0) .cse3 (<= ~ref_cnt~0 1)) (and .cse1 .cse4 .cse2) (and .cse0 .cse1 .cse4 (= ~ref_cnt~0 0) .cse3))) [2022-11-21 17:09:38,843 INFO L895 garLoopResultBuilder]: At program point L1251(line 1251) the Hoare annotation is: false [2022-11-21 17:09:38,843 INFO L899 garLoopResultBuilder]: For program point L1251-1(line 1251) no Hoare annotation was computed. [2022-11-21 17:09:38,843 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1242) no Hoare annotation was computed. [2022-11-21 17:09:38,844 INFO L899 garLoopResultBuilder]: For program point L1293(lines 1293 1297) no Hoare annotation was computed. [2022-11-21 17:09:38,844 INFO L899 garLoopResultBuilder]: For program point L1252(lines 1252 1257) no Hoare annotation was computed. [2022-11-21 17:09:38,844 INFO L902 garLoopResultBuilder]: At program point L1500(lines 1499 1501) the Hoare annotation is: true [2022-11-21 17:09:38,844 INFO L899 garLoopResultBuilder]: For program point L1236(lines 1236 1273) no Hoare annotation was computed. [2022-11-21 17:09:38,844 INFO L895 garLoopResultBuilder]: At program point L1261(line 1261) the Hoare annotation is: (and (= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 2) (= ~ldv_state_variable_0~0 2) (<= 1 ~ref_cnt~0) (= ~ldv_count_2~0 0) (<= ~ref_cnt~0 1)) [2022-11-21 17:09:38,844 INFO L899 garLoopResultBuilder]: For program point L1261-1(line 1261) no Hoare annotation was computed. [2022-11-21 17:09:38,845 INFO L899 garLoopResultBuilder]: For program point L1278(line 1278) no Hoare annotation was computed. [2022-11-21 17:09:38,845 INFO L899 garLoopResultBuilder]: For program point L1237(line 1237) no Hoare annotation was computed. [2022-11-21 17:09:38,845 INFO L902 garLoopResultBuilder]: At program point L1295(lines 1225 1322) the Hoare annotation is: true [2022-11-21 17:09:38,845 INFO L899 garLoopResultBuilder]: For program point L1262(lines 1262 1267) no Hoare annotation was computed. [2022-11-21 17:09:38,845 INFO L895 garLoopResultBuilder]: At program point L1452(lines 1449 1454) the Hoare annotation is: (and (= ~ldv_count_1~0 0) (<= ~probed_1~0 0) (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0)) [2022-11-21 17:09:38,845 INFO L899 garLoopResultBuilder]: For program point L1254(line 1254) no Hoare annotation was computed. [2022-11-21 17:09:38,845 INFO L899 garLoopResultBuilder]: For program point L1254-1(line 1254) no Hoare annotation was computed. [2022-11-21 17:09:38,846 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-21 17:09:38,846 INFO L899 garLoopResultBuilder]: For program point L1279(lines 1279 1312) no Hoare annotation was computed. [2022-11-21 17:09:38,846 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1264) no Hoare annotation was computed. [2022-11-21 17:09:38,846 INFO L899 garLoopResultBuilder]: For program point L1271(line 1271) no Hoare annotation was computed. [2022-11-21 17:09:38,846 INFO L899 garLoopResultBuilder]: For program point L1238(lines 1238 1247) no Hoare annotation was computed. [2022-11-21 17:09:38,846 INFO L902 garLoopResultBuilder]: At program point L1486(lines 1485 1487) the Hoare annotation is: true [2022-11-21 17:09:38,847 INFO L902 garLoopResultBuilder]: At program point L1321(lines 1220 1323) the Hoare annotation is: true [2022-11-21 17:09:38,847 INFO L902 garLoopResultBuilder]: At program point L1189(lines 1185 1191) the Hoare annotation is: true [2022-11-21 17:09:38,847 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-21 17:09:38,847 INFO L895 garLoopResultBuilder]: At program point L1214(line 1214) the Hoare annotation is: (and (= ~ldv_count_1~0 0) (<= ~probed_1~0 0) (= ~ldv_state_variable_0~0 2) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0)) [2022-11-21 17:09:38,847 INFO L899 garLoopResultBuilder]: For program point L1214-1(line 1214) no Hoare annotation was computed. [2022-11-21 17:09:38,847 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1264) no Hoare annotation was computed. [2022-11-21 17:09:38,847 INFO L902 garLoopResultBuilder]: At program point L1272(line 1272) the Hoare annotation is: true [2022-11-21 17:09:38,848 INFO L895 garLoopResultBuilder]: At program point L1239(line 1239) the Hoare annotation is: (and (<= ~ref_cnt~0 0) (= ~ldv_count_1~0 0) (<= ~probed_1~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_0~0 2) (= ~ldv_count_2~0 0)) [2022-11-21 17:09:38,848 INFO L899 garLoopResultBuilder]: For program point L1239-1(line 1239) no Hoare annotation was computed. [2022-11-21 17:09:38,848 INFO L899 garLoopResultBuilder]: For program point L1264(line 1264) no Hoare annotation was computed. [2022-11-21 17:09:38,848 INFO L899 garLoopResultBuilder]: For program point L1264-1(line 1264) no Hoare annotation was computed. [2022-11-21 17:09:38,848 INFO L899 garLoopResultBuilder]: For program point L1314(line 1314) no Hoare annotation was computed. [2022-11-21 17:09:38,848 INFO L899 garLoopResultBuilder]: For program point L1281(lines 1281 1309) no Hoare annotation was computed. [2022-11-21 17:09:38,849 INFO L895 garLoopResultBuilder]: At program point L1215(line 1215) the Hoare annotation is: (and (= ~ldv_count_1~0 0) (<= ~probed_1~0 0) (= ~ldv_state_variable_0~0 2) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0)) [2022-11-21 17:09:38,849 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1254) no Hoare annotation was computed. [2022-11-21 17:09:38,849 INFO L895 garLoopResultBuilder]: At program point L1182(lines 1177 1184) the Hoare annotation is: (and (= ~ldv_count_1~0 0) (<= ~probed_1~0 0) (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0)) [2022-11-21 17:09:38,849 INFO L899 garLoopResultBuilder]: For program point L1215-1(line 1215) no Hoare annotation was computed. [2022-11-21 17:09:38,849 INFO L899 garLoopResultBuilder]: For program point L1240(lines 1240 1245) no Hoare annotation was computed. [2022-11-21 17:09:38,849 INFO L899 garLoopResultBuilder]: For program point L1298(lines 1298 1303) no Hoare annotation was computed. [2022-11-21 17:09:38,849 INFO L899 garLoopResultBuilder]: For program point L1232(lines 1232 1316) no Hoare annotation was computed. [2022-11-21 17:09:38,850 INFO L899 garLoopResultBuilder]: For program point L1290(line 1290) no Hoare annotation was computed. [2022-11-21 17:09:38,850 INFO L902 garLoopResultBuilder]: At program point L1315(line 1315) the Hoare annotation is: true [2022-11-21 17:09:38,850 INFO L899 garLoopResultBuilder]: For program point L1282(line 1282) no Hoare annotation was computed. [2022-11-21 17:09:38,850 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_attrEXIT(lines 1032 1039) no Hoare annotation was computed. [2022-11-21 17:09:38,850 INFO L902 garLoopResultBuilder]: At program point L1035(line 1035) the Hoare annotation is: true [2022-11-21 17:09:38,850 INFO L902 garLoopResultBuilder]: At program point s3c_hwmon_remove_attrENTRY(lines 1032 1039) the Hoare annotation is: true [2022-11-21 17:09:38,851 INFO L902 garLoopResultBuilder]: At program point L1035-1(line 1035) the Hoare annotation is: true [2022-11-21 17:09:38,851 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_attrFINAL(lines 1032 1039) no Hoare annotation was computed. [2022-11-21 17:09:38,851 INFO L895 garLoopResultBuilder]: At program point ldv_device_create_fileENTRY(lines 1430 1448) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0) (not (<= ~ref_cnt~0 0))) [2022-11-21 17:09:38,851 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1437) no Hoare annotation was computed. [2022-11-21 17:09:38,851 INFO L899 garLoopResultBuilder]: For program point L1437(line 1437) no Hoare annotation was computed. [2022-11-21 17:09:38,851 INFO L899 garLoopResultBuilder]: For program point L1437-1(line 1437) no Hoare annotation was computed. [2022-11-21 17:09:38,852 INFO L895 garLoopResultBuilder]: At program point L1435(line 1435) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0) (not (<= ~ref_cnt~0 0))) [2022-11-21 17:09:38,852 INFO L899 garLoopResultBuilder]: For program point L1435-1(line 1435) no Hoare annotation was computed. [2022-11-21 17:09:38,852 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_fileFINAL(lines 1430 1448) no Hoare annotation was computed. [2022-11-21 17:09:38,852 INFO L899 garLoopResultBuilder]: For program point L1367(line 1367) no Hoare annotation was computed. [2022-11-21 17:09:38,852 INFO L895 garLoopResultBuilder]: At program point L1382(lines 1371 1384) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0) (not (<= ~ref_cnt~0 0))) [2022-11-21 17:09:38,852 INFO L899 garLoopResultBuilder]: For program point L1378(lines 1378 1381) no Hoare annotation was computed. [2022-11-21 17:09:38,852 INFO L899 garLoopResultBuilder]: For program point L1378-1(lines 1378 1381) no Hoare annotation was computed. [2022-11-21 17:09:38,853 INFO L895 garLoopResultBuilder]: At program point L1376(line 1376) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0) (not (<= ~ref_cnt~0 0))) [2022-11-21 17:09:38,853 INFO L899 garLoopResultBuilder]: For program point L1376-1(line 1376) no Hoare annotation was computed. [2022-11-21 17:09:38,853 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1437) no Hoare annotation was computed. [2022-11-21 17:09:38,853 INFO L899 garLoopResultBuilder]: For program point L1438(lines 1438 1441) no Hoare annotation was computed. [2022-11-21 17:09:38,853 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_fileEXIT(lines 1430 1448) no Hoare annotation was computed. [2022-11-21 17:09:38,853 INFO L899 garLoopResultBuilder]: For program point L1436(lines 1436 1446) no Hoare annotation was computed. [2022-11-21 17:09:38,854 INFO L899 garLoopResultBuilder]: For program point L1438-2(lines 1438 1441) no Hoare annotation was computed. [2022-11-21 17:09:38,854 INFO L899 garLoopResultBuilder]: For program point L1364(lines 1364 1370) no Hoare annotation was computed. [2022-11-21 17:09:38,854 INFO L895 garLoopResultBuilder]: At program point L1379(line 1379) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_count_1~0 0)) (= |old(~ldv_count_2~0)| ~ldv_count_2~0) (not (<= ~ref_cnt~0 0))) [2022-11-21 17:09:38,854 INFO L902 garLoopResultBuilder]: At program point IS_ERRENTRY(lines 1332 1339) the Hoare annotation is: true [2022-11-21 17:09:38,854 INFO L899 garLoopResultBuilder]: For program point IS_ERRFINAL(lines 1332 1339) no Hoare annotation was computed. [2022-11-21 17:09:38,854 INFO L902 garLoopResultBuilder]: At program point L1336(line 1336) the Hoare annotation is: true [2022-11-21 17:09:38,854 INFO L899 garLoopResultBuilder]: For program point L1336-1(line 1336) no Hoare annotation was computed. [2022-11-21 17:09:38,855 INFO L899 garLoopResultBuilder]: For program point IS_ERREXIT(lines 1332 1339) no Hoare annotation was computed. [2022-11-21 17:09:38,858 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:09:38,860 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 17:09:38,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 05:09:38 BoogieIcfgContainer [2022-11-21 17:09:38,885 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 17:09:38,886 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 17:09:38,886 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 17:09:38,886 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 17:09:38,887 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:09:11" (3/4) ... [2022-11-21 17:09:38,889 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-21 17:09:38,896 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_remove_raw [2022-11-21 17:09:38,896 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_probe [2022-11-21 17:09:38,897 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure platform_get_drvdata [2022-11-21 17:09:38,897 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undef_int [2022-11-21 17:09:38,897 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-11-21 17:09:38,897 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_remove [2022-11-21 17:09:38,897 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure PTR_ERR [2022-11-21 17:09:38,897 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_is_err [2022-11-21 17:09:38,897 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure hwmon_device_unregister [2022-11-21 17:09:38,897 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-11-21 17:09:38,898 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure device_remove_file [2022-11-21 17:09:38,898 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2022-11-21 17:09:38,898 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2022-11-21 17:09:38,898 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_adc_release [2022-11-21 17:09:38,898 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_remove_attr [2022-11-21 17:09:38,898 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_device_create_file [2022-11-21 17:09:38,899 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure IS_ERR [2022-11-21 17:09:38,910 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 73 nodes and edges [2022-11-21 17:09:38,911 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-11-21 17:09:38,912 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-11-21 17:09:38,913 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-21 17:09:38,914 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-21 17:09:38,941 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 [2022-11-21 17:09:38,942 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 [2022-11-21 17:09:38,943 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 [2022-11-21 17:09:38,943 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 0) [2022-11-21 17:09:38,943 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i < 2147483646 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 0) [2022-11-21 17:09:38,943 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || !(ldv_count_1 == 0)) || ((0 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ref_cnt <= 0) [2022-11-21 17:09:38,944 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i <= 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 0) [2022-11-21 17:09:38,944 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || !(ldv_count_1 == 0)) || ((i == 0 || (1 <= i && i < 2147483646)) && ldv_count_2 == 0)) || !(ref_cnt <= 0) [2022-11-21 17:09:38,944 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 [2022-11-21 17:09:38,944 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 [2022-11-21 17:09:38,945 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(ref_cnt == 0)) || ((1 <= i && i <= 2147483646) && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0) [2022-11-21 17:09:38,945 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 0) [2022-11-21 17:09:38,945 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 [2022-11-21 17:09:38,946 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 [2022-11-21 17:09:38,947 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 [2022-11-21 17:09:38,947 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 [2022-11-21 17:09:38,947 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 [2022-11-21 17:09:38,947 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 0) [2022-11-21 17:09:38,948 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 [2022-11-21 17:09:38,948 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 0) [2022-11-21 17:09:38,948 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 0) [2022-11-21 17:09:38,949 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0) || !(ref_cnt <= 0) [2022-11-21 17:09:38,949 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 0) [2022-11-21 17:09:39,000 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/witness.graphml [2022-11-21 17:09:39,000 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 17:09:39,001 INFO L158 Benchmark]: Toolchain (without parser) took 29175.31ms. Allocated memory was 205.5MB in the beginning and 432.0MB in the end (delta: 226.5MB). Free memory was 156.3MB in the beginning and 149.3MB in the end (delta: 7.0MB). Peak memory consumption was 234.2MB. Max. memory is 16.1GB. [2022-11-21 17:09:39,001 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 98.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 17:09:39,001 INFO L158 Benchmark]: CACSL2BoogieTranslator took 612.26ms. Allocated memory is still 205.5MB. Free memory was 155.6MB in the beginning and 124.8MB in the end (delta: 30.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-21 17:09:39,002 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.57ms. Allocated memory is still 205.5MB. Free memory was 124.8MB in the beginning and 120.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-21 17:09:39,002 INFO L158 Benchmark]: Boogie Preprocessor took 77.81ms. Allocated memory is still 205.5MB. Free memory was 120.6MB in the beginning and 117.1MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 17:09:39,002 INFO L158 Benchmark]: RCFGBuilder took 1056.74ms. Allocated memory is still 205.5MB. Free memory was 117.1MB in the beginning and 156.1MB in the end (delta: -38.9MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. [2022-11-21 17:09:39,003 INFO L158 Benchmark]: TraceAbstraction took 27208.16ms. Allocated memory was 205.5MB in the beginning and 432.0MB in the end (delta: 226.5MB). Free memory was 156.1MB in the beginning and 160.8MB in the end (delta: -4.7MB). Peak memory consumption was 253.2MB. Max. memory is 16.1GB. [2022-11-21 17:09:39,003 INFO L158 Benchmark]: Witness Printer took 114.53ms. Allocated memory is still 432.0MB. Free memory was 160.8MB in the beginning and 149.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-21 17:09:39,005 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 98.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 612.26ms. Allocated memory is still 205.5MB. Free memory was 155.6MB in the beginning and 124.8MB in the end (delta: 30.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.57ms. Allocated memory is still 205.5MB. Free memory was 124.8MB in the beginning and 120.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.81ms. Allocated memory is still 205.5MB. Free memory was 120.6MB in the beginning and 117.1MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1056.74ms. Allocated memory is still 205.5MB. Free memory was 117.1MB in the beginning and 156.1MB in the end (delta: -38.9MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. * TraceAbstraction took 27208.16ms. Allocated memory was 205.5MB in the beginning and 432.0MB in the end (delta: 226.5MB). Free memory was 156.1MB in the beginning and 160.8MB in the end (delta: -4.7MB). Peak memory consumption was 253.2MB. Max. memory is 16.1GB. * Witness Printer took 114.53ms. Allocated memory is still 432.0MB. Free memory was 160.8MB in the beginning and 149.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1118]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1118]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1163]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1163]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1242]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1242]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1254]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1254]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1264]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1264]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1437]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1437]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 237 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 27.1s, OverallIterations: 17, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4283 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4060 mSDsluCounter, 11615 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7406 mSDsCounter, 1376 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3838 IncrementalHoareTripleChecker+Invalid, 5214 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1376 mSolverCounterUnsat, 4209 mSDtfsCounter, 3838 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1713 GetRequests, 1609 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1343occurred in iteration=11, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 1611 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 91 LocationsWithAnnotation, 2825 PreInvPairs, 3017 NumberOfFragments, 1878 HoareAnnotationTreeSize, 2825 FomulaSimplifications, 134691 FormulaSimplificationTreeSizeReduction, 3.6s HoareSimplificationTime, 91 FomulaSimplificationsInter, 45098 FormulaSimplificationTreeSizeReductionInter, 5.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 2490 NumberOfCodeBlocks, 2490 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2810 ConstructedInterpolants, 0 QuantifiedInterpolants, 5080 SizeOfPredicates, 0 NumberOfNonLiveVariables, 6422 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 29 InterpolantComputations, 14 PerfectInterpolantSequences, 737/807 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 16 specifications checked. All of them hold - InvariantResult [Line: 934]: Loop Invariant Derived loop invariant: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 - InvariantResult [Line: 996]: Loop Invariant Derived loop invariant: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 0) - InvariantResult [Line: 1449]: Loop Invariant Derived loop invariant: (((ldv_count_1 == 0 && probed_1 <= 0) && ldv_state_variable_1 == 0) && ref_cnt == 0) && ldv_count_2 == 0 - InvariantResult [Line: 823]: Loop Invariant Derived loop invariant: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 - InvariantResult [Line: 1053]: Loop Invariant Derived loop invariant: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 - InvariantResult [Line: 1155]: Loop Invariant Derived loop invariant: ((((((!(ldv_state_variable_0 == 2) || i == 0) || (1 <= i && i <= 2147483646)) || !(ldv_state_variable_1 == 2)) || !(1 <= ref_cnt)) || !(ldv_count_2 == 0)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 1) - InvariantResult [Line: 1185]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1053]: Loop Invariant Derived loop invariant: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 0) - InvariantResult [Line: 1115]: Loop Invariant Derived loop invariant: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || !(ldv_count_1 == 0)) || ((0 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ref_cnt <= 0) - InvariantResult [Line: 1506]: Loop Invariant Derived loop invariant: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 - InvariantResult [Line: 1371]: Loop Invariant Derived loop invariant: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0) || !(ref_cnt <= 0) - InvariantResult [Line: 1469]: Loop Invariant Derived loop invariant: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 - InvariantResult [Line: 1356]: Loop Invariant Derived loop invariant: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 - InvariantResult [Line: 1397]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1220]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1479]: Loop Invariant Derived loop invariant: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 - InvariantResult [Line: 1462]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1053]: Loop Invariant Derived loop invariant: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || !(ldv_count_1 == 0)) || ((i == 0 || (1 <= i && i < 2147483646)) && ldv_count_2 == 0)) || !(ref_cnt <= 0) - InvariantResult [Line: 1155]: Loop Invariant Derived loop invariant: ((((((!(ldv_state_variable_0 == 2) || i == 0) || !(ldv_state_variable_1 == 2)) || !(1 <= ref_cnt)) || (1 <= i && i < 2147483646)) || !(ldv_count_2 == 0)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 1) - InvariantResult [Line: 876]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1499]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1455]: Loop Invariant Derived loop invariant: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 - InvariantResult [Line: 1053]: Loop Invariant Derived loop invariant: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(ref_cnt == 0)) || ((1 <= i && i <= 2147483646) && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0) - InvariantResult [Line: 1348]: Loop Invariant Derived loop invariant: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 0) - InvariantResult [Line: 1015]: Loop Invariant Derived loop invariant: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 0) - InvariantResult [Line: 903]: Loop Invariant Derived loop invariant: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 - InvariantResult [Line: 1053]: Loop Invariant Derived loop invariant: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i <= 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 0) - InvariantResult [Line: 1340]: Loop Invariant Derived loop invariant: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 0) - InvariantResult [Line: 1225]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1115]: Loop Invariant Derived loop invariant: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i < 2147483646 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 0) - InvariantResult [Line: 1053]: Loop Invariant Derived loop invariant: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 - InvariantResult [Line: 1053]: Loop Invariant Derived loop invariant: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 - InvariantResult [Line: 1002]: Loop Invariant Derived loop invariant: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 0) - InvariantResult [Line: 1496]: Loop Invariant Derived loop invariant: (((ldv_count_1 == 0 && probed_1 <= 0) && ldv_state_variable_1 == 0) && ref_cnt == 0) && ldv_count_2 == 0 - InvariantResult [Line: 1177]: Loop Invariant Derived loop invariant: (((ldv_count_1 == 0 && probed_1 <= 0) && ldv_state_variable_1 == 0) && ref_cnt == 0) && ldv_count_2 == 0 - InvariantResult [Line: 1225]: Loop Invariant Derived loop invariant: (((((((ref_cnt <= 0 && ldv_count_1 == 0) && probed_1 <= 0) && 0 <= ref_cnt) && ldv_state_variable_0 == 2) && ldv_count_2 == 0) || (((((ldv_count_1 == 0 && ldv_state_variable_1 == 2) && ldv_state_variable_0 == 2) && 1 <= ref_cnt) && ldv_count_2 == 0) && ref_cnt <= 1)) || ((probed_1 <= 0 && ldv_state_variable_1 == 0) && ldv_state_variable_0 == 2)) || ((((ldv_count_1 == 0 && probed_1 <= 0) && ldv_state_variable_1 == 0) && ref_cnt == 0) && ldv_count_2 == 0) - InvariantResult [Line: 1210]: Loop Invariant Derived loop invariant: (((ldv_count_1 == 0 && probed_1 <= 0) && ldv_state_variable_0 == 2) && ref_cnt == 0) && ldv_count_2 == 0 - InvariantResult [Line: 1485]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-21 17:09:39,046 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e33c0574-e521-404c-b5e6-40fc324a566b/bin/uautomizer-vX5HgA9Q3a/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