./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cac2372de612a50e6cea0e2672ab51101a6ffa3bb2603a06b5c5aa59090db116 --- 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-2329fc7 [2022-12-14 08:02:07,195 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 08:02:07,197 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 08:02:07,214 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 08:02:07,215 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 08:02:07,216 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 08:02:07,217 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 08:02:07,218 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 08:02:07,220 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 08:02:07,221 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 08:02:07,221 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 08:02:07,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 08:02:07,223 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 08:02:07,224 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 08:02:07,225 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 08:02:07,226 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 08:02:07,226 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 08:02:07,227 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 08:02:07,229 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 08:02:07,230 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 08:02:07,231 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 08:02:07,233 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 08:02:07,234 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 08:02:07,234 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 08:02:07,238 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 08:02:07,238 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 08:02:07,238 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 08:02:07,239 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 08:02:07,239 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 08:02:07,240 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 08:02:07,241 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 08:02:07,241 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 08:02:07,242 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 08:02:07,243 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 08:02:07,244 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 08:02:07,244 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 08:02:07,245 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 08:02:07,245 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 08:02:07,245 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 08:02:07,246 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 08:02:07,247 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 08:02:07,247 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-12-14 08:02:07,286 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 08:02:07,287 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 08:02:07,287 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 08:02:07,287 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 08:02:07,288 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 08:02:07,288 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 08:02:07,288 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 08:02:07,288 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 08:02:07,288 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 08:02:07,288 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 08:02:07,289 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 08:02:07,289 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 08:02:07,289 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 08:02:07,289 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 08:02:07,289 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 08:02:07,289 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 08:02:07,290 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 08:02:07,290 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 08:02:07,290 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 08:02:07,291 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 08:02:07,291 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 08:02:07,291 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 08:02:07,291 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 08:02:07,291 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 08:02:07,291 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 08:02:07,291 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 08:02:07,292 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 08:02:07,292 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-14 08:02:07,292 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 08:02:07,292 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 08:02:07,292 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 08:02:07,292 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 08:02:07,293 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 08:02:07,293 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 08:02:07,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 08:02:07,293 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 08:02:07,293 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 08:02:07,294 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 08:02:07,294 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 08:02:07,294 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 08:02:07,294 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 08:02:07,294 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 08:02:07,294 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 08:02:07,294 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_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/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_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cac2372de612a50e6cea0e2672ab51101a6ffa3bb2603a06b5c5aa59090db116 [2022-12-14 08:02:07,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 08:02:07,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 08:02:07,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 08:02:07,506 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 08:02:07,506 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 08:02:07,508 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i [2022-12-14 08:02:10,106 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 08:02:10,289 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 08:02:10,289 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i [2022-12-14 08:02:10,298 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/data/806800b9d/1230df9d3b52481ea8b0f4ccda38a271/FLAG8d075bfb5 [2022-12-14 08:02:10,672 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/data/806800b9d/1230df9d3b52481ea8b0f4ccda38a271 [2022-12-14 08:02:10,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 08:02:10,676 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 08:02:10,677 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 08:02:10,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 08:02:10,680 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 08:02:10,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 08:02:10" (1/1) ... [2022-12-14 08:02:10,681 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aeb689b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:02:10, skipping insertion in model container [2022-12-14 08:02:10,681 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 08:02:10" (1/1) ... [2022-12-14 08:02:10,686 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 08:02:10,715 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 08:02:10,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 08:02:10,956 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 08:02:11,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 08:02:11,034 INFO L208 MainTranslator]: Completed translation [2022-12-14 08:02:11,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:02:11 WrapperNode [2022-12-14 08:02:11,035 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 08:02:11,036 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 08:02:11,036 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 08:02:11,036 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 08:02:11,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:02:11" (1/1) ... [2022-12-14 08:02:11,060 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:02:11" (1/1) ... [2022-12-14 08:02:11,085 INFO L138 Inliner]: procedures = 166, calls = 73, calls flagged for inlining = 25, calls inlined = 19, statements flattened = 125 [2022-12-14 08:02:11,086 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 08:02:11,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 08:02:11,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 08:02:11,087 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 08:02:11,096 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:02:11" (1/1) ... [2022-12-14 08:02:11,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:02:11" (1/1) ... [2022-12-14 08:02:11,100 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:02:11" (1/1) ... [2022-12-14 08:02:11,100 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:02:11" (1/1) ... [2022-12-14 08:02:11,109 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:02:11" (1/1) ... [2022-12-14 08:02:11,113 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:02:11" (1/1) ... [2022-12-14 08:02:11,114 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:02:11" (1/1) ... [2022-12-14 08:02:11,116 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:02:11" (1/1) ... [2022-12-14 08:02:11,119 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 08:02:11,120 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 08:02:11,120 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 08:02:11,120 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 08:02:11,121 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:02:11" (1/1) ... [2022-12-14 08:02:11,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 08:02:11,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:02:11,146 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 08:02:11,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 08:02:11,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 08:02:11,180 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2022-12-14 08:02:11,180 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2022-12-14 08:02:11,180 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-12-14 08:02:11,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-12-14 08:02:11,180 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2022-12-14 08:02:11,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2022-12-14 08:02:11,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 08:02:11,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 08:02:11,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 08:02:11,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 08:02:11,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 08:02:11,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 08:02:11,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-14 08:02:11,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 08:02:11,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 08:02:11,294 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 08:02:11,296 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 08:02:11,475 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 08:02:11,527 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 08:02:11,527 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-14 08:02:11,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 08:02:11 BoogieIcfgContainer [2022-12-14 08:02:11,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 08:02:11,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 08:02:11,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 08:02:11,533 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 08:02:11,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 08:02:10" (1/3) ... [2022-12-14 08:02:11,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@605f718a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 08:02:11, skipping insertion in model container [2022-12-14 08:02:11,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:02:11" (2/3) ... [2022-12-14 08:02:11,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@605f718a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 08:02:11, skipping insertion in model container [2022-12-14 08:02:11,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 08:02:11" (3/3) ... [2022-12-14 08:02:11,535 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3-1.i [2022-12-14 08:02:11,549 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 08:02:11,550 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-12-14 08:02:11,584 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 08:02:11,601 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=FINITE_AUTOMATA, 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;@5d9d95c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 08:02:11,601 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-14 08:02:11,604 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 08:02:11,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 08:02:11,610 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:02:11,613 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:02:11,613 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-14 08:02:11,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:02:11,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1568878959, now seen corresponding path program 1 times [2022-12-14 08:02:11,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:02:11,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458019202] [2022-12-14 08:02:11,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:02:11,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:02:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:02:11,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:02:11,929 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:02:11,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458019202] [2022-12-14 08:02:11,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458019202] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:02:11,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:02:11,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 08:02:11,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817133884] [2022-12-14 08:02:11,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:02:11,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:02:11,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:02:11,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:02:11,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:02:11,967 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-12-14 08:02:12,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:02:12,049 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2022-12-14 08:02:12,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 08:02:12,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 9 [2022-12-14 08:02:12,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:02:12,056 INFO L225 Difference]: With dead ends: 66 [2022-12-14 08:02:12,056 INFO L226 Difference]: Without dead ends: 42 [2022-12-14 08:02:12,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-12-14 08:02:12,061 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:02:12,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 92 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:02:12,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-12-14 08:02:12,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2022-12-14 08:02:12,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.434782608695652) internal successors, (33), 28 states have internal predecessors, (33), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 08:02:12,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-12-14 08:02:12,088 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 9 [2022-12-14 08:02:12,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:02:12,088 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-12-14 08:02:12,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-12-14 08:02:12,089 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-12-14 08:02:12,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 08:02:12,089 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:02:12,089 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:02:12,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 08:02:12,090 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-14 08:02:12,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:02:12,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1308343317, now seen corresponding path program 1 times [2022-12-14 08:02:12,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:02:12,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888981259] [2022-12-14 08:02:12,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:02:12,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:02:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:02:12,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:02:12,250 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:02:12,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888981259] [2022-12-14 08:02:12,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888981259] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:02:12,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:02:12,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 08:02:12,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85810897] [2022-12-14 08:02:12,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:02:12,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 08:02:12,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:02:12,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 08:02:12,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-14 08:02:12,253 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 08:02:12,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:02:12,361 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-12-14 08:02:12,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 08:02:12,362 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-12-14 08:02:12,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:02:12,364 INFO L225 Difference]: With dead ends: 54 [2022-12-14 08:02:12,364 INFO L226 Difference]: Without dead ends: 34 [2022-12-14 08:02:12,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-14 08:02:12,366 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 13 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:02:12,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 150 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:02:12,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-12-14 08:02:12,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-12-14 08:02:12,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 26 states have internal predecessors, (30), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 08:02:12,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-12-14 08:02:12,372 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 13 [2022-12-14 08:02:12,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:02:12,372 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-12-14 08:02:12,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 08:02:12,372 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-12-14 08:02:12,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 08:02:12,373 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:02:12,373 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:02:12,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 08:02:12,373 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-14 08:02:12,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:02:12,374 INFO L85 PathProgramCache]: Analyzing trace with hash 447976575, now seen corresponding path program 1 times [2022-12-14 08:02:12,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:02:12,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653791678] [2022-12-14 08:02:12,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:02:12,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:02:12,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:02:12,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:02:12,524 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:02:12,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653791678] [2022-12-14 08:02:12,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653791678] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:02:12,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:02:12,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 08:02:12,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784356670] [2022-12-14 08:02:12,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:02:12,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 08:02:12,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:02:12,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 08:02:12,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 08:02:12,526 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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-12-14 08:02:12,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:02:12,622 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-12-14 08:02:12,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 08:02:12,623 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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 12 [2022-12-14 08:02:12,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:02:12,624 INFO L225 Difference]: With dead ends: 59 [2022-12-14 08:02:12,624 INFO L226 Difference]: Without dead ends: 43 [2022-12-14 08:02:12,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-12-14 08:02:12,625 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 35 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:02:12,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 112 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:02:12,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-12-14 08:02:12,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2022-12-14 08:02:12,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.375) internal successors, (33), 29 states have internal predecessors, (33), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 08:02:12,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-12-14 08:02:12,629 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 12 [2022-12-14 08:02:12,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:02:12,630 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-12-14 08:02:12,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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-12-14 08:02:12,630 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-12-14 08:02:12,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 08:02:12,630 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:02:12,630 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:02:12,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 08:02:12,631 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-14 08:02:12,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:02:12,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1802261400, now seen corresponding path program 1 times [2022-12-14 08:02:12,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:02:12,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85801657] [2022-12-14 08:02:12,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:02:12,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:02:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:02:12,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:02:12,698 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:02:12,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85801657] [2022-12-14 08:02:12,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85801657] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:02:12,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:02:12,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 08:02:12,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404014303] [2022-12-14 08:02:12,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:02:12,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 08:02:12,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:02:12,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 08:02:12,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:02:12,700 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-12-14 08:02:12,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:02:12,764 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2022-12-14 08:02:12,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 08:02:12,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 14 [2022-12-14 08:02:12,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:02:12,765 INFO L225 Difference]: With dead ends: 55 [2022-12-14 08:02:12,765 INFO L226 Difference]: Without dead ends: 32 [2022-12-14 08:02:12,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 08:02:12,767 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 40 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:02:12,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 64 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:02:12,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-12-14 08:02:12,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-12-14 08:02:12,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 25 states have internal predecessors, (28), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 08:02:12,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-12-14 08:02:12,774 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 14 [2022-12-14 08:02:12,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:02:12,774 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-12-14 08:02:12,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-12-14 08:02:12,775 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-12-14 08:02:12,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 08:02:12,775 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:02:12,775 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:02:12,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 08:02:12,775 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-14 08:02:12,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:02:12,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1241965276, now seen corresponding path program 1 times [2022-12-14 08:02:12,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:02:12,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831919633] [2022-12-14 08:02:12,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:02:12,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:02:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:02:12,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:02:12,863 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:02:12,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831919633] [2022-12-14 08:02:12,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831919633] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:02:12,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:02:12,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 08:02:12,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584633675] [2022-12-14 08:02:12,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:02:12,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:02:12,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:02:12,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:02:12,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:02:12,866 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 08:02:12,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:02:12,898 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2022-12-14 08:02:12,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:02:12,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-12-14 08:02:12,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:02:12,899 INFO L225 Difference]: With dead ends: 58 [2022-12-14 08:02:12,899 INFO L226 Difference]: Without dead ends: 33 [2022-12-14 08:02:12,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:02:12,900 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:02:12,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:02:12,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-12-14 08:02:12,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-12-14 08:02:12,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 26 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 08:02:12,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-12-14 08:02:12,916 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 17 [2022-12-14 08:02:12,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:02:12,916 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-12-14 08:02:12,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 08:02:12,916 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-12-14 08:02:12,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 08:02:12,917 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:02:12,917 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:02:12,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 08:02:12,917 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-14 08:02:12,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:02:12,917 INFO L85 PathProgramCache]: Analyzing trace with hash -478486705, now seen corresponding path program 1 times [2022-12-14 08:02:12,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:02:12,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612407240] [2022-12-14 08:02:12,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:02:12,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:02:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:02:13,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:02:13,038 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:02:13,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612407240] [2022-12-14 08:02:13,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612407240] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:02:13,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759772718] [2022-12-14 08:02:13,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:02:13,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:02:13,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:02:13,040 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:02:13,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 08:02:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:02:13,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 90 conjunts are in the unsatisfiable core [2022-12-14 08:02:13,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:02:13,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 08:02:13,291 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_81 Int) (LDV_INIT_LIST_HEAD_~list.offset Int) (v_ArrVal_82 Int)) (and (= (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) LDV_INIT_LIST_HEAD_~list.offset v_ArrVal_81) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_82)) |c_#memory_int|) (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2022-12-14 08:02:13,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:02:13,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:02:13,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-12-14 08:02:13,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:02:13,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 08:02:13,386 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:02:13,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759772718] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:02:13,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 08:02:13,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 16 [2022-12-14 08:02:13,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587286984] [2022-12-14 08:02:13,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:02:13,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 08:02:13,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:02:13,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 08:02:13,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=177, Unknown=1, NotChecked=26, Total=240 [2022-12-14 08:02:13,388 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 14 states, 10 states have (on average 1.4) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 08:02:13,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:02:13,657 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-12-14 08:02:13,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 08:02:13,657 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 1.4) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-12-14 08:02:13,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:02:13,658 INFO L225 Difference]: With dead ends: 43 [2022-12-14 08:02:13,658 INFO L226 Difference]: Without dead ends: 42 [2022-12-14 08:02:13,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=386, Unknown=1, NotChecked=40, Total=506 [2022-12-14 08:02:13,660 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 37 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 08:02:13,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 145 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 235 Invalid, 0 Unknown, 45 Unchecked, 0.2s Time] [2022-12-14 08:02:13,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-12-14 08:02:13,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2022-12-14 08:02:13,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 08:02:13,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-12-14 08:02:13,672 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2022-12-14 08:02:13,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:02:13,672 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-12-14 08:02:13,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 1.4) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 08:02:13,672 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-12-14 08:02:13,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 08:02:13,673 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:02:13,673 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:02:13,680 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 08:02:13,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-14 08:02:13,874 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-14 08:02:13,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:02:13,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1948185887, now seen corresponding path program 1 times [2022-12-14 08:02:13,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:02:13,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363468402] [2022-12-14 08:02:13,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:02:13,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:02:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:02:14,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:02:14,009 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:02:14,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363468402] [2022-12-14 08:02:14,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363468402] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:02:14,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873739851] [2022-12-14 08:02:14,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:02:14,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:02:14,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:02:14,010 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:02:14,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 08:02:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:02:14,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 92 conjunts are in the unsatisfiable core [2022-12-14 08:02:14,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:02:14,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 08:02:14,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 08:02:14,213 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_135 Int) (LDV_INIT_LIST_HEAD_~list.offset Int) (v_ArrVal_138 Int)) (and (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (= (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) LDV_INIT_LIST_HEAD_~list.offset v_ArrVal_138) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_135)) |c_#memory_int|))) is different from true [2022-12-14 08:02:14,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:02:14,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:02:14,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-12-14 08:02:14,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:02:14,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 08:02:14,306 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:02:14,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873739851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:02:14,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 08:02:14,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 16 [2022-12-14 08:02:14,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596846796] [2022-12-14 08:02:14,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:02:14,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 08:02:14,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:02:14,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 08:02:14,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=177, Unknown=1, NotChecked=26, Total=240 [2022-12-14 08:02:14,308 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 14 states, 10 states have (on average 1.5) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 08:02:14,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:02:14,520 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-12-14 08:02:14,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 08:02:14,521 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 1.5) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-12-14 08:02:14,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:02:14,521 INFO L225 Difference]: With dead ends: 38 [2022-12-14 08:02:14,522 INFO L226 Difference]: Without dead ends: 37 [2022-12-14 08:02:14,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=349, Unknown=1, NotChecked=38, Total=462 [2022-12-14 08:02:14,523 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 38 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:02:14,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 100 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 178 Invalid, 0 Unknown, 37 Unchecked, 0.1s Time] [2022-12-14 08:02:14,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-12-14 08:02:14,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2022-12-14 08:02:14,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 24 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 08:02:14,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-12-14 08:02:14,530 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 19 [2022-12-14 08:02:14,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:02:14,530 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-12-14 08:02:14,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 1.5) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 08:02:14,530 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-12-14 08:02:14,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 08:02:14,531 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:02:14,531 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:02:14,537 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 08:02:14,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-14 08:02:14,732 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-14 08:02:14,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:02:14,733 INFO L85 PathProgramCache]: Analyzing trace with hash -156106293, now seen corresponding path program 1 times [2022-12-14 08:02:14,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:02:14,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552798498] [2022-12-14 08:02:14,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:02:14,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:02:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:02:14,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 08:02:14,917 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:02:14,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552798498] [2022-12-14 08:02:14,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552798498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:02:14,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:02:14,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 08:02:14,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212536755] [2022-12-14 08:02:14,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:02:14,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 08:02:14,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:02:14,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 08:02:14,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:02:14,918 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 08:02:14,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:02:14,971 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-12-14 08:02:14,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 08:02:14,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-12-14 08:02:14,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:02:14,972 INFO L225 Difference]: With dead ends: 43 [2022-12-14 08:02:14,972 INFO L226 Difference]: Without dead ends: 31 [2022-12-14 08:02:14,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 08:02:14,973 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:02:14,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 69 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:02:14,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-12-14 08:02:14,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-12-14 08:02:14,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 08:02:14,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-12-14 08:02:14,977 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 22 [2022-12-14 08:02:14,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:02:14,977 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-12-14 08:02:14,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 08:02:14,978 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-12-14 08:02:14,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 08:02:14,978 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:02:14,978 INFO L195 NwaCegarLoop]: trace histogram [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-12-14 08:02:14,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 08:02:14,978 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-14 08:02:14,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:02:14,978 INFO L85 PathProgramCache]: Analyzing trace with hash -890256660, now seen corresponding path program 1 times [2022-12-14 08:02:14,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:02:14,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474586272] [2022-12-14 08:02:14,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:02:14,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:02:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:02:15,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:02:15,070 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:02:15,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474586272] [2022-12-14 08:02:15,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474586272] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:02:15,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118160760] [2022-12-14 08:02:15,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:02:15,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:02:15,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:02:15,072 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:02:15,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 08:02:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:02:15,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 148 conjunts are in the unsatisfiable core [2022-12-14 08:02:15,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:02:15,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 08:02:15,281 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_230 Int) (LDV_INIT_LIST_HEAD_~list.offset Int) (v_ArrVal_228 Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) LDV_INIT_LIST_HEAD_~list.offset v_ArrVal_230) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_228))) (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2022-12-14 08:02:15,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:02:15,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:02:15,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-12-14 08:02:15,409 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:02:15,411 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 08:02:15,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2022-12-14 08:02:15,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:02:15,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:02:15,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:02:15,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118160760] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:02:15,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2085624351] [2022-12-14 08:02:15,946 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-12-14 08:02:15,946 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 08:02:15,949 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 08:02:15,952 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 08:02:15,952 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 08:02:15,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 08:02:15,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-14 08:02:16,087 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:02:16,098 INFO L321 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2022-12-14 08:02:16,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 132 [2022-12-14 08:02:16,110 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:02:16,121 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 08:02:16,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 134 [2022-12-14 08:02:16,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-12-14 08:02:16,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 08:02:16,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-12-14 08:02:16,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-12-14 08:02:16,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 08:02:16,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 08:02:16,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 08:02:16,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:02:16,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-12-14 08:02:16,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:02:16,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-12-14 08:02:16,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:02:16,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-12-14 08:02:16,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 08:02:16,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 08:02:16,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 08:02:16,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 08:02:16,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-12-14 08:02:16,818 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_kobject_put with input of size 39 for LOIs [2022-12-14 08:02:16,834 INFO L197 IcfgInterpreter]: Interpreting procedure LDV_INIT_LIST_HEAD with input of size 33 for LOIs [2022-12-14 08:02:16,844 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 43 for LOIs [2022-12-14 08:02:16,862 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 08:02:20,647 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1373#(and (= (ite (<= (mod |ldv_kobject_put_ldv_kref_sub_~count#1| 4294967296) 2147483647) (mod |ldv_kobject_put_ldv_kref_sub_~count#1| 4294967296) (+ (- 4294967296) (mod |ldv_kobject_put_ldv_kref_sub_~count#1| 4294967296))) |ldv_kobject_put_ldv_atomic_sub_return_#in~i#1|) (= |ldv_kobject_put_ldv_atomic_sub_return_~i#1| |ldv_kobject_put_ldv_atomic_sub_return_#in~i#1|) (= |ldv_kobject_put_ldv_kref_sub_#in~kref#1.base| |ldv_kobject_put_ldv_kref_put_~kref#1.base|) (= (+ 12 |ldv_kobject_put_~kobj#1.offset|) |ldv_kobject_put_ldv_kref_put_#in~kref#1.offset|) (= |ldv_kobject_put_~kobj#1.base| |ldv_kobject_put_#in~kobj#1.base|) (= |ldv_kobject_put_ldv_kref_put_#in~release#1.offset| |ldv_kobject_put_ldv_kref_put_~release#1.offset|) (not (<= |ldv_kobject_put_ldv_atomic_sub_return_~i#1| (+ |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1| 2147483648))) (= |~#ldv_global_msg_list~0.offset| 0) (= |#memory_int| |old(#memory_int)|) (= |ldv_kobject_put_ldv_kref_put_#in~release#1.base| |ldv_kobject_put_ldv_kref_put_~release#1.base|) (= |ldv_kobject_put_#in~kobj#1.offset| |ldv_kobject_put_~kobj#1.offset|) (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| |ldv_kobject_put_ldv_atomic_sub_return_#in~v#1.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |ldv_kobject_put_ldv_kref_put_~release#1.offset| |ldv_kobject_put_ldv_kref_sub_#in~release#1.offset|) (= |ldv_kobject_put_ldv_kref_sub_#in~kref#1.base| |ldv_kobject_put_ldv_kref_sub_~kref#1.base|) (= |ldv_kobject_put_ldv_kref_sub_#in~count#1| 1) (= |ldv_kobject_put_ldv_kref_put_~kref#1.offset| |ldv_kobject_put_ldv_kref_sub_#in~kref#1.offset|) (= |ldv_kobject_put_ldv_kref_sub_~release#1.base| |ldv_kobject_put_ldv_kref_sub_#in~release#1.base|) (= |ldv_kobject_put_ldv_kref_sub_#in~count#1| |ldv_kobject_put_ldv_kref_sub_~count#1|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (select (select |#memory_int| |ldv_kobject_put_ldv_atomic_sub_return_~v#1.base|) |ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset|) |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1|) (= |ldv_kobject_put_ldv_kref_sub_#in~release#1.base| |ldv_kobject_put_ldv_kref_put_~release#1.base|) (= |ldv_kobject_put_ldv_kref_put_~kref#1.offset| |ldv_kobject_put_ldv_kref_put_#in~kref#1.offset|) (= |ldv_kobject_put_ldv_kref_sub_~release#1.offset| |ldv_kobject_put_ldv_kref_sub_#in~release#1.offset|) (= |ldv_kobject_put_#in~kobj#1.offset| 0) (= |ldv_kobject_put_ldv_kref_put_#in~release#1.base| |#funAddr~ldv_kobject_release.base|) (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| |ldv_kobject_put_ldv_atomic_sub_return_#in~v#1.offset|) (= |ldv_kobject_put_ldv_kref_sub_#in~kref#1.offset| |ldv_kobject_put_ldv_kref_sub_~kref#1.offset|) (= |ldv_kobject_put_ldv_atomic_sub_return_#in~v#1.offset| |ldv_kobject_put_ldv_kref_sub_~kref#1.offset|) (= |~#ldv_global_msg_list~0.base| 1) (= |#NULL.offset| 0) (= |ldv_kobject_put_ldv_kref_put_#in~release#1.offset| |#funAddr~ldv_kobject_release.offset|) (not (= |ldv_kobject_put_#in~kobj#1.base| 0)) (= |ldv_kobject_put_ldv_kref_put_#in~kref#1.base| |ldv_kobject_put_ldv_kref_put_~kref#1.base|) (= |ldv_kobject_put_~kobj#1.base| |ldv_kobject_put_ldv_kref_put_#in~kref#1.base|) (= |old(#valid)| |#valid|) (<= 0 |#StackHeapBarrier|) (<= 0 (+ 2147483648 (select (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|) (+ |ldv_kobject_put_#in~kobj#1.offset| 12)))) (= |#NULL.base| 0) (= |ldv_kobject_put_ldv_atomic_sub_return_#in~v#1.base| |ldv_kobject_put_ldv_kref_sub_~kref#1.base|))' at error location [2022-12-14 08:02:20,648 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 08:02:20,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 08:02:20,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 19] total 22 [2022-12-14 08:02:20,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936753638] [2022-12-14 08:02:20,648 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 08:02:20,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-14 08:02:20,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:02:20,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-14 08:02:20,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2648, Unknown=1, NotChecked=104, Total=2970 [2022-12-14 08:02:20,650 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 22 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 19 states have internal predecessors, (37), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-14 08:02:21,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:02:21,168 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2022-12-14 08:02:21,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 08:02:21,168 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 19 states have internal predecessors, (37), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2022-12-14 08:02:21,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:02:21,169 INFO L225 Difference]: With dead ends: 66 [2022-12-14 08:02:21,169 INFO L226 Difference]: Without dead ends: 41 [2022-12-14 08:02:21,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=344, Invalid=4081, Unknown=1, NotChecked=130, Total=4556 [2022-12-14 08:02:21,171 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 52 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 08:02:21,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 95 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 405 Invalid, 0 Unknown, 35 Unchecked, 0.2s Time] [2022-12-14 08:02:21,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-12-14 08:02:21,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2022-12-14 08:02:21,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 30 states have internal predecessors, (32), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-14 08:02:21,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2022-12-14 08:02:21,180 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 24 [2022-12-14 08:02:21,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:02:21,181 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2022-12-14 08:02:21,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 19 states have internal predecessors, (37), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-14 08:02:21,181 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-12-14 08:02:21,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 08:02:21,181 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:02:21,181 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] [2022-12-14 08:02:21,187 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 08:02:21,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:02:21,383 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-14 08:02:21,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:02:21,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1931936302, now seen corresponding path program 1 times [2022-12-14 08:02:21,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:02:21,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262524105] [2022-12-14 08:02:21,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:02:21,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:02:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:02:21,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:02:21,575 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:02:21,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262524105] [2022-12-14 08:02:21,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262524105] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:02:21,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689985674] [2022-12-14 08:02:21,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:02:21,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:02:21,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:02:21,577 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:02:21,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 08:02:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:02:21,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 106 conjunts are in the unsatisfiable core [2022-12-14 08:02:21,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:02:21,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 08:02:21,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-14 08:02:21,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:02:21,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:02:21,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2022-12-14 08:02:21,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 08:02:21,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689985674] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 08:02:21,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 08:02:21,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5, 10] total 18 [2022-12-14 08:02:21,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761647239] [2022-12-14 08:02:21,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:02:21,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 08:02:21,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:02:21,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 08:02:21,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2022-12-14 08:02:21,907 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 08:02:22,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:02:22,100 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2022-12-14 08:02:22,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 08:02:22,101 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-12-14 08:02:22,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:02:22,101 INFO L225 Difference]: With dead ends: 48 [2022-12-14 08:02:22,102 INFO L226 Difference]: Without dead ends: 43 [2022-12-14 08:02:22,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2022-12-14 08:02:22,103 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 19 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:02:22,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 119 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:02:22,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-12-14 08:02:22,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-12-14 08:02:22,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 32 states have (on average 1.09375) internal successors, (35), 33 states have internal predecessors, (35), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-14 08:02:22,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2022-12-14 08:02:22,111 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 26 [2022-12-14 08:02:22,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:02:22,111 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2022-12-14 08:02:22,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 08:02:22,111 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2022-12-14 08:02:22,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 08:02:22,111 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:02:22,111 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-14 08:02:22,117 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 08:02:22,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:02:22,313 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-14 08:02:22,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:02:22,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1658527172, now seen corresponding path program 1 times [2022-12-14 08:02:22,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:02:22,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414711462] [2022-12-14 08:02:22,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:02:22,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:02:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:02:22,553 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 08:02:22,553 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:02:22,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414711462] [2022-12-14 08:02:22,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414711462] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:02:22,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:02:22,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 08:02:22,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750301515] [2022-12-14 08:02:22,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:02:22,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 08:02:22,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:02:22,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 08:02:22,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-14 08:02:22,555 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 08:02:22,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:02:22,643 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-12-14 08:02:22,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 08:02:22,644 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2022-12-14 08:02:22,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:02:22,644 INFO L225 Difference]: With dead ends: 45 [2022-12-14 08:02:22,644 INFO L226 Difference]: Without dead ends: 36 [2022-12-14 08:02:22,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-12-14 08:02:22,645 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 24 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:02:22,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 99 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:02:22,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-12-14 08:02:22,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-12-14 08:02:22,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 08:02:22,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2022-12-14 08:02:22,651 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 32 [2022-12-14 08:02:22,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:02:22,651 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2022-12-14 08:02:22,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 08:02:22,652 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-12-14 08:02:22,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-14 08:02:22,652 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:02:22,653 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-14 08:02:22,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 08:02:22,653 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-14 08:02:22,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:02:22,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1577009713, now seen corresponding path program 1 times [2022-12-14 08:02:22,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:02:22,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524955864] [2022-12-14 08:02:22,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:02:22,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:02:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:02:22,791 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:02:22,791 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:02:22,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524955864] [2022-12-14 08:02:22,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524955864] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:02:22,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360912124] [2022-12-14 08:02:22,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:02:22,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:02:22,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:02:22,793 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:02:22,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 08:02:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:02:22,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 197 conjunts are in the unsatisfiable core [2022-12-14 08:02:22,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:02:23,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 08:02:23,060 WARN L859 $PredicateComparison]: unable to prove that (exists ((LDV_INIT_LIST_HEAD_~list.offset Int) (v_ArrVal_448 Int) (v_ArrVal_447 Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) LDV_INIT_LIST_HEAD_~list.offset v_ArrVal_447) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_448))) (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2022-12-14 08:02:23,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:02:23,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:02:23,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-12-14 08:02:23,175 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:02:23,177 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 08:02:23,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2022-12-14 08:02:23,283 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_451 Int)) (let ((.cse0 (select |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base|)) (.cse1 (+ |c_ldv_kobject_put_#in~kobj#1.offset| 12))) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base| (store .cse0 .cse1 v_ArrVal_451))) (<= (select .cse0 .cse1) (+ v_ArrVal_451 1))))) is different from true [2022-12-14 08:02:23,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-12-14 08:02:23,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:02:23,375 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:02:23,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:02:23,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360912124] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:02:23,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1443921066] [2022-12-14 08:02:23,687 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-12-14 08:02:23,687 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 08:02:23,688 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 08:02:23,688 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 08:02:23,688 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 08:02:23,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-14 08:02:23,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 08:02:23,765 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:02:23,776 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 08:02:23,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 134 [2022-12-14 08:02:23,786 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:02:23,795 INFO L321 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2022-12-14 08:02:23,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 124 [2022-12-14 08:02:23,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-12-14 08:02:23,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-12-14 08:02:23,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-12-14 08:02:23,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 08:02:23,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 08:02:23,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 08:02:23,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 08:02:24,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:02:24,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-12-14 08:02:24,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:02:24,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-12-14 08:02:24,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:02:24,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-12-14 08:02:24,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 08:02:24,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 08:02:24,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-12-14 08:02:24,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 08:02:24,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 08:02:24,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 08:02:24,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-12-14 08:02:24,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 08:02:24,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 08:02:24,427 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 08:02:24,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2022-12-14 08:02:24,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 08:02:24,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 08:02:24,868 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_kobject_put with input of size 51 for LOIs [2022-12-14 08:02:25,146 INFO L197 IcfgInterpreter]: Interpreting procedure LDV_INIT_LIST_HEAD with input of size 33 for LOIs [2022-12-14 08:02:25,154 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 43 for LOIs [2022-12-14 08:02:25,173 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 08:02:29,749 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2168#(and (= (ite (<= (mod |ldv_kobject_put_ldv_kref_sub_~count#1| 4294967296) 2147483647) (mod |ldv_kobject_put_ldv_kref_sub_~count#1| 4294967296) (+ (- 4294967296) (mod |ldv_kobject_put_ldv_kref_sub_~count#1| 4294967296))) |ldv_kobject_put_ldv_atomic_sub_return_#in~i#1|) (= |ldv_kobject_put_ldv_atomic_sub_return_~i#1| |ldv_kobject_put_ldv_atomic_sub_return_#in~i#1|) (= |ldv_kobject_put_ldv_kref_sub_#in~kref#1.base| |ldv_kobject_put_ldv_kref_put_~kref#1.base|) (= (+ 12 |ldv_kobject_put_~kobj#1.offset|) |ldv_kobject_put_ldv_kref_put_#in~kref#1.offset|) (= |ldv_kobject_put_~kobj#1.base| |ldv_kobject_put_#in~kobj#1.base|) (= |ldv_kobject_put_ldv_kref_put_#in~release#1.offset| |ldv_kobject_put_ldv_kref_put_~release#1.offset|) (not (<= |ldv_kobject_put_ldv_atomic_sub_return_~i#1| (+ |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1| 2147483648))) (<= 0 |ldv_kobject_put_#in~kobj#1.offset|) (= |~#ldv_global_msg_list~0.offset| 0) (= |#memory_int| |old(#memory_int)|) (= |ldv_kobject_put_ldv_kref_put_#in~release#1.base| |ldv_kobject_put_ldv_kref_put_~release#1.base|) (= |ldv_kobject_put_#in~kobj#1.offset| |ldv_kobject_put_~kobj#1.offset|) (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| |ldv_kobject_put_ldv_atomic_sub_return_#in~v#1.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |ldv_kobject_put_ldv_kref_put_~release#1.offset| |ldv_kobject_put_ldv_kref_sub_#in~release#1.offset|) (= |ldv_kobject_put_ldv_kref_sub_#in~kref#1.base| |ldv_kobject_put_ldv_kref_sub_~kref#1.base|) (= |ldv_kobject_put_ldv_kref_sub_#in~count#1| 1) (= |ldv_kobject_put_ldv_kref_put_~kref#1.offset| |ldv_kobject_put_ldv_kref_sub_#in~kref#1.offset|) (= |ldv_kobject_put_ldv_kref_sub_~release#1.base| |ldv_kobject_put_ldv_kref_sub_#in~release#1.base|) (= |ldv_kobject_put_ldv_kref_sub_#in~count#1| |ldv_kobject_put_ldv_kref_sub_~count#1|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (select (select |#memory_int| |ldv_kobject_put_ldv_atomic_sub_return_~v#1.base|) |ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset|) |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1|) (= |ldv_kobject_put_ldv_kref_sub_#in~release#1.base| |ldv_kobject_put_ldv_kref_put_~release#1.base|) (= |ldv_kobject_put_ldv_kref_put_~kref#1.offset| |ldv_kobject_put_ldv_kref_put_#in~kref#1.offset|) (= |ldv_kobject_put_ldv_kref_sub_~release#1.offset| |ldv_kobject_put_ldv_kref_sub_#in~release#1.offset|) (<= |~#ldv_global_msg_list~0.base| 1) (= |ldv_kobject_put_ldv_kref_put_#in~release#1.base| |#funAddr~ldv_kobject_release.base|) (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| |ldv_kobject_put_ldv_atomic_sub_return_#in~v#1.offset|) (= |ldv_kobject_put_ldv_kref_sub_#in~kref#1.offset| |ldv_kobject_put_ldv_kref_sub_~kref#1.offset|) (= |ldv_kobject_put_ldv_atomic_sub_return_#in~v#1.offset| |ldv_kobject_put_ldv_kref_sub_~kref#1.offset|) (not (= |ldv_kobject_put_~kobj#1.base| 0)) (= |#NULL.offset| 0) (= |ldv_kobject_put_ldv_kref_put_#in~release#1.offset| |#funAddr~ldv_kobject_release.offset|) (<= 1 |~#ldv_global_msg_list~0.base|) (= |ldv_kobject_put_ldv_kref_put_#in~kref#1.base| |ldv_kobject_put_ldv_kref_put_~kref#1.base|) (= |ldv_kobject_put_~kobj#1.base| |ldv_kobject_put_ldv_kref_put_#in~kref#1.base|) (= |old(#valid)| |#valid|) (<= 0 |#StackHeapBarrier|) (<= |ldv_kobject_put_#in~kobj#1.offset| 0) (= |#NULL.base| 0) (= |ldv_kobject_put_ldv_atomic_sub_return_#in~v#1.base| |ldv_kobject_put_ldv_kref_sub_~kref#1.base|))' at error location [2022-12-14 08:02:29,749 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 08:02:29,749 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 08:02:29,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 24] total 28 [2022-12-14 08:02:29,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137039769] [2022-12-14 08:02:29,750 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 08:02:29,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-14 08:02:29,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:02:29,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-14 08:02:29,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=2851, Unknown=2, NotChecked=218, Total=3306 [2022-12-14 08:02:29,752 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand has 28 states, 24 states have (on average 2.125) internal successors, (51), 25 states have internal predecessors, (51), 5 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-14 08:02:30,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:02:30,271 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2022-12-14 08:02:30,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-14 08:02:30,272 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 2.125) internal successors, (51), 25 states have internal predecessors, (51), 5 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 33 [2022-12-14 08:02:30,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:02:30,272 INFO L225 Difference]: With dead ends: 63 [2022-12-14 08:02:30,272 INFO L226 Difference]: Without dead ends: 36 [2022-12-14 08:02:30,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1194 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=345, Invalid=4217, Unknown=2, NotChecked=266, Total=4830 [2022-12-14 08:02:30,273 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 37 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 08:02:30,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 54 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 390 Invalid, 0 Unknown, 74 Unchecked, 0.2s Time] [2022-12-14 08:02:30,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-12-14 08:02:30,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-12-14 08:02:30,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 08:02:30,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2022-12-14 08:02:30,278 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2022-12-14 08:02:30,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:02:30,278 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2022-12-14 08:02:30,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 2.125) internal successors, (51), 25 states have internal predecessors, (51), 5 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-14 08:02:30,278 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-12-14 08:02:30,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 08:02:30,279 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:02:30,279 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-12-14 08:02:30,283 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 08:02:30,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-14 08:02:30,481 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-14 08:02:30,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:02:30,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1802340939, now seen corresponding path program 1 times [2022-12-14 08:02:30,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:02:30,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340289960] [2022-12-14 08:02:30,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:02:30,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:02:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:02:30,675 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:02:30,675 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:02:30,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340289960] [2022-12-14 08:02:30,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340289960] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:02:30,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804611203] [2022-12-14 08:02:30,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:02:30,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:02:30,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:02:30,677 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:02:30,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 08:02:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:02:30,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 118 conjunts are in the unsatisfiable core [2022-12-14 08:02:30,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:02:30,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 08:02:30,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-14 08:02:30,937 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 08:02:30,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:02:31,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2022-12-14 08:02:31,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2022-12-14 08:02:31,181 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 08:02:31,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804611203] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:02:31,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [42177797] [2022-12-14 08:02:31,183 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-12-14 08:02:31,183 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 08:02:31,183 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 08:02:31,184 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 08:02:31,184 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 08:02:31,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-14 08:02:31,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 08:02:31,260 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:02:31,269 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 08:02:31,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 134 [2022-12-14 08:02:31,277 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:02:31,285 INFO L321 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2022-12-14 08:02:31,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 124 [2022-12-14 08:02:31,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-12-14 08:02:31,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-12-14 08:02:31,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-12-14 08:02:31,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 08:02:31,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 08:02:31,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 08:02:31,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 08:02:31,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:02:31,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-12-14 08:02:31,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:02:31,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-12-14 08:02:31,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:02:31,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-12-14 08:02:31,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 08:02:31,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 08:02:31,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 08:02:31,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2022-12-14 08:02:31,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 08:02:31,709 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 08:02:31,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2022-12-14 08:02:31,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 08:02:31,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 08:02:31,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-12-14 08:02:31,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 08:02:31,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 08:02:31,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 08:02:32,116 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_kobject_put with input of size 51 for LOIs [2022-12-14 08:02:32,334 INFO L197 IcfgInterpreter]: Interpreting procedure LDV_INIT_LIST_HEAD with input of size 33 for LOIs [2022-12-14 08:02:32,342 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 43 for LOIs [2022-12-14 08:02:32,356 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 08:02:36,383 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2591#(and (= (ite (<= (mod |ldv_kobject_put_ldv_kref_sub_~count#1| 4294967296) 2147483647) (mod |ldv_kobject_put_ldv_kref_sub_~count#1| 4294967296) (+ (- 4294967296) (mod |ldv_kobject_put_ldv_kref_sub_~count#1| 4294967296))) |ldv_kobject_put_ldv_atomic_sub_return_#in~i#1|) (= |ldv_kobject_put_ldv_atomic_sub_return_~i#1| |ldv_kobject_put_ldv_atomic_sub_return_#in~i#1|) (= |ldv_kobject_put_ldv_kref_sub_#in~kref#1.base| |ldv_kobject_put_ldv_kref_put_~kref#1.base|) (= (+ 12 |ldv_kobject_put_~kobj#1.offset|) |ldv_kobject_put_ldv_kref_put_#in~kref#1.offset|) (= |ldv_kobject_put_~kobj#1.base| |ldv_kobject_put_#in~kobj#1.base|) (= |ldv_kobject_put_ldv_kref_put_#in~release#1.offset| |ldv_kobject_put_ldv_kref_put_~release#1.offset|) (<= 0 |ldv_kobject_put_#in~kobj#1.offset|) (= |~#ldv_global_msg_list~0.offset| 0) (= |#memory_int| |old(#memory_int)|) (= |ldv_kobject_put_ldv_kref_put_#in~release#1.base| |ldv_kobject_put_ldv_kref_put_~release#1.base|) (= |ldv_kobject_put_#in~kobj#1.offset| |ldv_kobject_put_~kobj#1.offset|) (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| |ldv_kobject_put_ldv_atomic_sub_return_#in~v#1.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |ldv_kobject_put_ldv_kref_put_~release#1.offset| |ldv_kobject_put_ldv_kref_sub_#in~release#1.offset|) (= |ldv_kobject_put_ldv_kref_sub_#in~kref#1.base| |ldv_kobject_put_ldv_kref_sub_~kref#1.base|) (= |ldv_kobject_put_ldv_kref_sub_#in~count#1| 1) (= |ldv_kobject_put_ldv_kref_put_~kref#1.offset| |ldv_kobject_put_ldv_kref_sub_#in~kref#1.offset|) (= |ldv_kobject_put_ldv_kref_sub_~release#1.base| |ldv_kobject_put_ldv_kref_sub_#in~release#1.base|) (= |ldv_kobject_put_ldv_kref_sub_#in~count#1| |ldv_kobject_put_ldv_kref_sub_~count#1|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (select (select |#memory_int| |ldv_kobject_put_ldv_atomic_sub_return_~v#1.base|) |ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset|) |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1|) (= |ldv_kobject_put_ldv_kref_sub_#in~release#1.base| |ldv_kobject_put_ldv_kref_put_~release#1.base|) (= |ldv_kobject_put_ldv_kref_put_~kref#1.offset| |ldv_kobject_put_ldv_kref_put_#in~kref#1.offset|) (= |ldv_kobject_put_ldv_kref_sub_~release#1.offset| |ldv_kobject_put_ldv_kref_sub_#in~release#1.offset|) (<= |~#ldv_global_msg_list~0.base| 1) (= |ldv_kobject_put_ldv_kref_put_#in~release#1.base| |#funAddr~ldv_kobject_release.base|) (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| |ldv_kobject_put_ldv_atomic_sub_return_#in~v#1.offset|) (< (+ |ldv_kobject_put_ldv_atomic_sub_return_~i#1| 2147483647) |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1|) (= |ldv_kobject_put_ldv_kref_sub_#in~kref#1.offset| |ldv_kobject_put_ldv_kref_sub_~kref#1.offset|) (= |ldv_kobject_put_ldv_atomic_sub_return_#in~v#1.offset| |ldv_kobject_put_ldv_kref_sub_~kref#1.offset|) (not (= |ldv_kobject_put_~kobj#1.base| 0)) (= |#NULL.offset| 0) (= |ldv_kobject_put_ldv_kref_put_#in~release#1.offset| |#funAddr~ldv_kobject_release.offset|) (<= 1 |~#ldv_global_msg_list~0.base|) (= |ldv_kobject_put_ldv_kref_put_#in~kref#1.base| |ldv_kobject_put_ldv_kref_put_~kref#1.base|) (= |ldv_kobject_put_~kobj#1.base| |ldv_kobject_put_ldv_kref_put_#in~kref#1.base|) (= |old(#valid)| |#valid|) (<= 0 |#StackHeapBarrier|) (<= |ldv_kobject_put_#in~kobj#1.offset| 0) (= |#NULL.base| 0) (= |ldv_kobject_put_ldv_atomic_sub_return_#in~v#1.base| |ldv_kobject_put_ldv_kref_sub_~kref#1.base|))' at error location [2022-12-14 08:02:36,384 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 08:02:36,384 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:02:36,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 8] total 19 [2022-12-14 08:02:36,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844672586] [2022-12-14 08:02:36,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 08:02:36,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 08:02:36,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:02:36,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 08:02:36,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1722, Unknown=0, NotChecked=0, Total=1892 [2022-12-14 08:02:36,385 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand has 19 states, 18 states have (on average 3.388888888888889) internal successors, (61), 19 states have internal predecessors, (61), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-14 08:02:36,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:02:36,626 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2022-12-14 08:02:36,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 08:02:36,627 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.388888888888889) internal successors, (61), 19 states have internal predecessors, (61), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 35 [2022-12-14 08:02:36,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:02:36,627 INFO L225 Difference]: With dead ends: 62 [2022-12-14 08:02:36,627 INFO L226 Difference]: Without dead ends: 0 [2022-12-14 08:02:36,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=224, Invalid=2226, Unknown=0, NotChecked=0, Total=2450 [2022-12-14 08:02:36,628 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 18 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:02:36,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 186 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:02:36,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-14 08:02:36,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-14 08:02:36,628 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-12-14 08:02:36,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-14 08:02:36,629 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2022-12-14 08:02:36,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:02:36,629 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-14 08:02:36,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.388888888888889) internal successors, (61), 19 states have internal predecessors, (61), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-14 08:02:36,629 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-14 08:02:36,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-14 08:02:36,631 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-12-14 08:02:36,631 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-12-14 08:02:36,631 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-12-14 08:02:36,631 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-12-14 08:02:36,636 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-14 08:02:36,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-14 08:02:36,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-14 08:02:37,608 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 525 531) the Hoare annotation is: true [2022-12-14 08:02:37,608 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 525 531) no Hoare annotation was computed. [2022-12-14 08:02:37,609 INFO L899 garLoopResultBuilder]: For program point L659(line 659) no Hoare annotation was computed. [2022-12-14 08:02:37,609 INFO L895 garLoopResultBuilder]: At program point ldv_kobject_create_returnLabel#1(lines 738 747) the Hoare annotation is: (let ((.cse1 (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|))) (or (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|))) (.cse2 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) 12))) (and (<= .cse0 1) (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) .cse1 (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (<= .cse2 1) (<= 1 .cse0) (<= 1 .cse2) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) (or (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| 0))))) (and .cse1 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0)))) [2022-12-14 08:02:37,609 INFO L895 garLoopResultBuilder]: At program point L659-1(line 659) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|))) (.cse1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) 12))) (and (<= .cse0 1) (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (<= |ULTIMATE.start_ldv_atomic_add_return_~temp~0#1| 1) (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (<= |ULTIMATE.start_ldv_atomic_add_return_~i#1| 1) (<= .cse1 1) (<= 1 .cse0) (<= 1 .cse1) (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.offset| 0) (not (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_get_~kobj#1.base|) 12)) (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| 0) (= (+ |ULTIMATE.start_entry_point_~kobj~2#1.offset| 12) |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) (<= (select (select |#memory_int| |ULTIMATE.start_ldv_atomic_add_return_~v#1.base|) |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) |ULTIMATE.start_ldv_atomic_add_return_~temp~0#1|) (= |ULTIMATE.start_ldv_atomic_add_return_~v#1.base| |ULTIMATE.start_entry_point_~kobj~2#1.base|) (<= 1 |ULTIMATE.start_ldv_atomic_add_return_~i#1|) (= |ULTIMATE.start_entry_point_~kobj~2#1.base| |ULTIMATE.start_ldv_kobject_get_~kobj#1.base|) (not (= |ULTIMATE.start_entry_point_~kobj~2#1.base| 0)) (or (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| 0))))) [2022-12-14 08:02:37,609 INFO L899 garLoopResultBuilder]: For program point L717(lines 717 718) no Hoare annotation was computed. [2022-12-14 08:02:37,609 INFO L895 garLoopResultBuilder]: At program point L717-2(lines 717 718) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|)) (.cse3 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0)) (.cse2 (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| 0)) (.cse1 (= |ULTIMATE.start_entry_point_~kobj~2#1.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ |ULTIMATE.start_entry_point_~kobj~2#1.offset| 12))) (let ((.cse4 (select (select |#memory_int| |ULTIMATE.start_entry_point_~kobj~2#1.base|) .cse5))) (and (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) .cse0 (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (< .cse4 2147483649) (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) 12)) (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.offset| 0) (not .cse3) .cse2 (<= 2 .cse4) (= .cse5 |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) (<= (select (select |#memory_int| |ULTIMATE.start_ldv_atomic_add_return_~v#1.base|) |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) |ULTIMATE.start_ldv_atomic_add_return_~temp~0#1|) (= |ULTIMATE.start_ldv_atomic_add_return_~v#1.base| |ULTIMATE.start_entry_point_~kobj~2#1.base|) (<= 1 |ULTIMATE.start_ldv_atomic_add_return_~i#1|) (= |ULTIMATE.start_entry_point_~kobj~2#1.base| |ULTIMATE.start_ldv_kobject_get_~kobj#1.base|) (not .cse1) (or (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| 0)))))))) [2022-12-14 08:02:37,609 INFO L895 garLoopResultBuilder]: At program point ldv_kobject_init_returnLabel#1(lines 728 737) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)))) (and (<= .cse0 1) (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (<= 1 .cse0) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) (or (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| 0))))) [2022-12-14 08:02:37,609 INFO L899 garLoopResultBuilder]: For program point L742(lines 742 743) no Hoare annotation was computed. [2022-12-14 08:02:37,609 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 659) no Hoare annotation was computed. [2022-12-14 08:02:37,610 INFO L895 garLoopResultBuilder]: At program point L-1-2(line -1) the Hoare annotation is: (and (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0))) [2022-12-14 08:02:37,610 INFO L899 garLoopResultBuilder]: For program point L730(lines 730 732) no Hoare annotation was computed. [2022-12-14 08:02:37,610 INFO L895 garLoopResultBuilder]: At program point L726(line 726) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|)))) (and (<= .cse0 1) (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (<= 1 .cse0))) [2022-12-14 08:02:37,610 INFO L895 garLoopResultBuilder]: At program point L726-1(lines 721 727) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)))) (and (<= .cse0 1) (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (<= 1 .cse0) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) (or (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| 0))))) [2022-12-14 08:02:37,610 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 659) no Hoare annotation was computed. [2022-12-14 08:02:37,610 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-14 08:02:37,610 INFO L895 garLoopResultBuilder]: At program point L768(line 768) the Hoare annotation is: (let ((.cse1 (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|)) (.cse5 (= |ULTIMATE.start_entry_point_~kobj~2#1.base| 0)) (.cse3 (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| 0)) (.cse2 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0))) (or (let ((.cse4 (+ |ULTIMATE.start_entry_point_~kobj~2#1.offset| 12))) (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_entry_point_~kobj~2#1.base|) .cse4))) (and (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.offset| |ULTIMATE.start_entry_point_~kobj~2#1.offset|) (<= .cse0 2147483647) (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_f_22_put_~kobj#1.offset| |ULTIMATE.start_entry_point_~kobj~2#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (or (not .cse1) (not .cse2)) (<= 1 .cse0) .cse3 (= .cse4 |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) (= |ULTIMATE.start_entry_point_~kobj~2#1.base| |ULTIMATE.start_f_22_put_~kobj#1.base|) (= |ULTIMATE.start_ldv_atomic_add_return_~v#1.base| |ULTIMATE.start_entry_point_~kobj~2#1.base|) (= |ULTIMATE.start_entry_point_~kobj~2#1.base| |ULTIMATE.start_ldv_kobject_get_~kobj#1.base|) (not .cse5) (or (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| 0)))))) (and (= |ULTIMATE.start_f_22_put_~kobj#1.base| 0) .cse1 .cse5 .cse3 (= |ULTIMATE.start_f_22_put_~kobj#1.offset| 0) .cse2))) [2022-12-14 08:02:37,610 INFO L899 garLoopResultBuilder]: For program point L768-1(lines 763 769) no Hoare annotation was computed. [2022-12-14 08:02:37,610 INFO L899 garLoopResultBuilder]: For program point L723(lines 723 724) no Hoare annotation was computed. [2022-12-14 08:02:37,611 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-14 08:02:37,611 INFO L895 garLoopResultBuilder]: At program point L761(line 761) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|)) (.cse4 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0)) (.cse2 (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| 0)) (.cse3 (= |ULTIMATE.start_f_22_put_~kobj#1.offset| 0)) (.cse1 (= |ULTIMATE.start_entry_point_~kobj~2#1.base| 0))) (or (and (= |ULTIMATE.start_f_22_put_~kobj#1.base| 0) .cse0 .cse1 .cse2 .cse3 .cse4) (let ((.cse5 (+ |ULTIMATE.start_entry_point_~kobj~2#1.offset| 12))) (and (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) .cse0 (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) 12)) (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.offset| 0) (not .cse4) (< (select (select |#memory_int| |ULTIMATE.start_f_22_put_~kobj#1.base|) (+ |ULTIMATE.start_f_22_put_~kobj#1.offset| 12)) 2147483649) .cse2 (<= 2 (select (select |#memory_int| |ULTIMATE.start_entry_point_~kobj~2#1.base|) .cse5)) (= .cse5 |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) .cse3 (<= (select (select |#memory_int| |ULTIMATE.start_ldv_atomic_add_return_~v#1.base|) |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) |ULTIMATE.start_ldv_atomic_add_return_~temp~0#1|) (= |ULTIMATE.start_entry_point_~kobj~2#1.base| |ULTIMATE.start_f_22_put_~kobj#1.base|) (= |ULTIMATE.start_ldv_atomic_add_return_~v#1.base| |ULTIMATE.start_entry_point_~kobj~2#1.base|) (<= 1 |ULTIMATE.start_ldv_atomic_add_return_~i#1|) (= |ULTIMATE.start_entry_point_~kobj~2#1.base| |ULTIMATE.start_ldv_kobject_get_~kobj#1.base|) (not .cse1) (or (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| 0))))))) [2022-12-14 08:02:37,611 INFO L899 garLoopResultBuilder]: For program point L761-1(lines 760 762) no Hoare annotation was computed. [2022-12-14 08:02:37,611 INFO L902 garLoopResultBuilder]: At program point L741(line 741) the Hoare annotation is: true [2022-12-14 08:02:37,611 INFO L899 garLoopResultBuilder]: For program point L741-1(line 741) no Hoare annotation was computed. [2022-12-14 08:02:37,611 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 538 542) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-12-14 08:02:37,611 INFO L899 garLoopResultBuilder]: For program point LDV_INIT_LIST_HEADEXIT(lines 538 542) no Hoare annotation was computed. [2022-12-14 08:02:37,611 INFO L899 garLoopResultBuilder]: For program point L667(line 667) no Hoare annotation was computed. [2022-12-14 08:02:37,612 INFO L895 garLoopResultBuilder]: At program point L667-1(line 667) the Hoare annotation is: (let ((.cse10 (+ |ldv_kobject_put_#in~kobj#1.offset| 12)) (.cse11 (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|))) (let ((.cse0 (not (= |ldv_kobject_put_#in~kobj#1.offset| 0))) (.cse2 (select .cse11 12)) (.cse1 (select .cse11 .cse10)) (.cse3 (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| .cse10)) (.cse4 (= |ldv_kobject_put_~kobj#1.base| |ldv_kobject_put_#in~kobj#1.base|)) (.cse5 (<= (select (select |#memory_int| |ldv_kobject_put_ldv_atomic_sub_return_~v#1.base|) |ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset|) |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1|)) (.cse6 (<= |ldv_kobject_put_ldv_atomic_sub_return_~i#1| 1)) (.cse7 (= |#memory_int| |old(#memory_int)|)) (.cse8 (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| |ldv_kobject_put_#in~kobj#1.base|)) (.cse9 (= |ldv_kobject_put_~kobj#1.offset| 0))) (and (or .cse0 (not (< .cse1 2147483649)) (not (<= 2 .cse2)) (and .cse3 .cse4 .cse5 .cse6 .cse7 (<= |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1| (+ |ldv_kobject_put_ldv_atomic_sub_return_~i#1| 2147483647)) .cse8 .cse9)) (or .cse0 (not (= |ldv_kobject_put_#in~kobj#1.base| 0))) (or .cse0 (not (<= 1 .cse2)) (not (<= .cse1 2147483647)) (and .cse3 .cse4 .cse5 (<= |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1| 2147483647) .cse6 .cse7 .cse8 .cse9 (<= 1 |ldv_kobject_put_ldv_atomic_sub_return_~i#1|)))))) [2022-12-14 08:02:37,612 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 667) no Hoare annotation was computed. [2022-12-14 08:02:37,612 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 709 714) the Hoare annotation is: (let ((.cse4 (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|))) (let ((.cse0 (not (= |ldv_kobject_put_#in~kobj#1.offset| 0))) (.cse2 (= |#memory_int| |old(#memory_int)|)) (.cse3 (select .cse4 (+ |ldv_kobject_put_#in~kobj#1.offset| 12))) (.cse1 (select .cse4 12))) (and (or .cse0 (not (<= 1 .cse1)) .cse2 (not (<= .cse3 2147483647))) (or .cse0 .cse2 (not (< .cse3 2147483649)) (not (<= 2 .cse1)))))) [2022-12-14 08:02:37,612 INFO L899 garLoopResultBuilder]: For program point L711(lines 711 713) no Hoare annotation was computed. [2022-12-14 08:02:37,612 INFO L899 garLoopResultBuilder]: For program point L711-2(lines 709 714) no Hoare annotation was computed. [2022-12-14 08:02:37,612 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putEXIT(lines 709 714) no Hoare annotation was computed. [2022-12-14 08:02:37,612 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 667) no Hoare annotation was computed. [2022-12-14 08:02:37,614 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:02:37,616 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 08:02:37,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 08:02:37 BoogieIcfgContainer [2022-12-14 08:02:37,629 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 08:02:37,630 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 08:02:37,630 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 08:02:37,630 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 08:02:37,630 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 08:02:11" (3/4) ... [2022-12-14 08:02:37,632 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-14 08:02:37,636 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-12-14 08:02:37,636 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2022-12-14 08:02:37,637 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2022-12-14 08:02:37,640 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 49 nodes and edges [2022-12-14 08:02:37,640 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2022-12-14 08:02:37,640 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-12-14 08:02:37,656 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((unknown-#memory_int-unknown[kobj][12 + kobj] <= 1 && 0 == kobj) && kobj == kobj) && 0 == \result) && kobj == kobj) && unknown-#memory_int-unknown[\result][12] <= 1) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && 1 <= unknown-#memory_int-unknown[\result][12]) && !(kobj == 0)) && (!(kobj == 0) || !(kobj == 0))) || (0 == \result && \result == 0) [2022-12-14 08:02:37,656 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == \result && kobj == 0) && kobj == 0) && \result == 0) || ((((((((((((((((((0 == kobj && kobj == kobj) && 0 == \result) && kobj == kobj) && unknown-#memory_int-unknown[kobj][kobj + 12] < 2147483649) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && 1 <= unknown-#memory_int-unknown[\result][12]) && kobj == 0) && !(\result == 0)) && kobj == 0) && 2 <= unknown-#memory_int-unknown[kobj][kobj + 12]) && kobj + 12 == v) && !(kobj == 0)) && unknown-#memory_int-unknown[v][v] <= temp) && v == kobj) && 1 <= i) && kobj == kobj) && !(kobj == 0)) && (!(kobj == 0) || !(kobj == 0))) [2022-12-14 08:02:37,657 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((unknown-#memory_int-unknown[kobj][12 + kobj] <= 1 && 0 == kobj) && kobj == kobj) && temp <= 1) && 0 == \result) && kobj == kobj) && i <= 1) && unknown-#memory_int-unknown[\result][12] <= 1) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && 1 <= unknown-#memory_int-unknown[\result][12]) && kobj == 0) && !(\result == 0)) && 1 <= unknown-#memory_int-unknown[kobj][12]) && kobj == 0) && kobj + 12 == v) && !(kobj == 0)) && unknown-#memory_int-unknown[v][v] <= temp) && v == kobj) && 1 <= i) && kobj == kobj) && !(kobj == 0)) && (!(kobj == 0) || !(kobj == 0)) [2022-12-14 08:02:37,657 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(kobj == 0) || !(\old(unknown-#memory_int-unknown)[kobj][kobj + 12] < 2147483649)) || !(2 <= \old(unknown-#memory_int-unknown)[kobj][12])) || (((((((v == kobj + 12 && kobj == kobj) && unknown-#memory_int-unknown[v][v] <= temp) && i <= 1) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && temp <= i + 2147483647) && v == kobj) && kobj == 0)) && (!(kobj == 0) || !(kobj == 0))) && (((!(kobj == 0) || !(1 <= \old(unknown-#memory_int-unknown)[kobj][12])) || !(\old(unknown-#memory_int-unknown)[kobj][kobj + 12] <= 2147483647)) || ((((((((v == kobj + 12 && kobj == kobj) && unknown-#memory_int-unknown[v][v] <= temp) && temp <= 2147483647) && i <= 1) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && v == kobj) && kobj == 0) && 1 <= i)) [2022-12-14 08:02:37,672 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 08:02:37,672 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 08:02:37,672 INFO L158 Benchmark]: Toolchain (without parser) took 26996.64ms. Allocated memory was 153.1MB in the beginning and 222.3MB in the end (delta: 69.2MB). Free memory was 118.6MB in the beginning and 118.2MB in the end (delta: 431.7kB). Peak memory consumption was 70.2MB. Max. memory is 16.1GB. [2022-12-14 08:02:37,672 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 80.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 08:02:37,673 INFO L158 Benchmark]: CACSL2BoogieTranslator took 358.46ms. Allocated memory is still 153.1MB. Free memory was 118.6MB in the beginning and 97.1MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-12-14 08:02:37,673 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.00ms. Allocated memory is still 153.1MB. Free memory was 97.1MB in the beginning and 94.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 08:02:37,673 INFO L158 Benchmark]: Boogie Preprocessor took 32.63ms. Allocated memory is still 153.1MB. Free memory was 94.4MB in the beginning and 92.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 08:02:37,673 INFO L158 Benchmark]: RCFGBuilder took 409.16ms. Allocated memory is still 153.1MB. Free memory was 92.3MB in the beginning and 65.0MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-14 08:02:37,674 INFO L158 Benchmark]: TraceAbstraction took 26098.62ms. Allocated memory was 153.1MB in the beginning and 222.3MB in the end (delta: 69.2MB). Free memory was 64.6MB in the beginning and 122.4MB in the end (delta: -57.7MB). Peak memory consumption was 78.6MB. Max. memory is 16.1GB. [2022-12-14 08:02:37,674 INFO L158 Benchmark]: Witness Printer took 42.14ms. Allocated memory is still 222.3MB. Free memory was 122.4MB in the beginning and 118.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 08:02:37,675 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 109.1MB. Free memory is still 80.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 358.46ms. Allocated memory is still 153.1MB. Free memory was 118.6MB in the beginning and 97.1MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.00ms. Allocated memory is still 153.1MB. Free memory was 97.1MB in the beginning and 94.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.63ms. Allocated memory is still 153.1MB. Free memory was 94.4MB in the beginning and 92.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 409.16ms. Allocated memory is still 153.1MB. Free memory was 92.3MB in the beginning and 65.0MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 26098.62ms. Allocated memory was 153.1MB in the beginning and 222.3MB in the end (delta: 69.2MB). Free memory was 64.6MB in the beginning and 122.4MB in the end (delta: -57.7MB). Peak memory consumption was 78.6MB. Max. memory is 16.1GB. * Witness Printer took 42.14ms. Allocated memory is still 222.3MB. Free memory was 122.4MB in the beginning and 118.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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: 659]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 659]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 667]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 667]: 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 4 procedures, 34 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 26.0s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 349 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 343 mSDsluCounter, 1336 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 191 IncrementalHoareTripleChecker+Unchecked, 1075 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1893 IncrementalHoareTripleChecker+Invalid, 2175 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 261 mSDtfsCounter, 1893 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 451 GetRequests, 164 SyntacticMatches, 2 SemanticMatches, 285 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2885 ImplicationChecksByTransitivity, 15.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=10, InterpolantAutomatonStates: 141, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 36 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 60 PreInvPairs, 76 NumberOfFragments, 808 HoareAnnotationTreeSize, 60 FomulaSimplifications, 282 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 14 FomulaSimplificationsInter, 1978 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 429 NumberOfCodeBlocks, 429 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 469 ConstructedInterpolants, 6 QuantifiedInterpolants, 2149 SizeOfPredicates, 337 NumberOfNonLiveVariables, 1871 ConjunctsInSsa, 751 ConjunctsInUnsatCore, 21 InterpolantComputations, 10 PerfectInterpolantSequences, 27/63 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 4 specifications checked. All of them hold - InvariantResult [Line: 667]: Loop Invariant Derived loop invariant: ((((!(kobj == 0) || !(\old(unknown-#memory_int-unknown)[kobj][kobj + 12] < 2147483649)) || !(2 <= \old(unknown-#memory_int-unknown)[kobj][12])) || (((((((v == kobj + 12 && kobj == kobj) && unknown-#memory_int-unknown[v][v] <= temp) && i <= 1) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && temp <= i + 2147483647) && v == kobj) && kobj == 0)) && (!(kobj == 0) || !(kobj == 0))) && (((!(kobj == 0) || !(1 <= \old(unknown-#memory_int-unknown)[kobj][12])) || !(\old(unknown-#memory_int-unknown)[kobj][kobj + 12] <= 2147483647)) || ((((((((v == kobj + 12 && kobj == kobj) && unknown-#memory_int-unknown[v][v] <= temp) && temp <= 2147483647) && i <= 1) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && v == kobj) && kobj == 0) && 1 <= i)) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 0 == kobj && !(kobj == 0) - InvariantResult [Line: 728]: Loop Invariant Derived loop invariant: (((((unknown-#memory_int-unknown[kobj][12 + kobj] <= 1 && 0 == kobj) && kobj == kobj) && kobj == kobj) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && !(kobj == 0)) && (!(kobj == 0) || !(kobj == 0)) - InvariantResult [Line: 659]: Loop Invariant Derived loop invariant: ((((((((((((((((((((unknown-#memory_int-unknown[kobj][12 + kobj] <= 1 && 0 == kobj) && kobj == kobj) && temp <= 1) && 0 == \result) && kobj == kobj) && i <= 1) && unknown-#memory_int-unknown[\result][12] <= 1) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && 1 <= unknown-#memory_int-unknown[\result][12]) && kobj == 0) && !(\result == 0)) && 1 <= unknown-#memory_int-unknown[kobj][12]) && kobj == 0) && kobj + 12 == v) && !(kobj == 0)) && unknown-#memory_int-unknown[v][v] <= temp) && v == kobj) && 1 <= i) && kobj == kobj) && !(kobj == 0)) && (!(kobj == 0) || !(kobj == 0)) - InvariantResult [Line: 721]: Loop Invariant Derived loop invariant: (((((unknown-#memory_int-unknown[kobj][12 + kobj] <= 1 && 0 == kobj) && kobj == kobj) && kobj == kobj) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && !(kobj == 0)) && (!(kobj == 0) || !(kobj == 0)) - InvariantResult [Line: 738]: Loop Invariant Derived loop invariant: (((((((((unknown-#memory_int-unknown[kobj][12 + kobj] <= 1 && 0 == kobj) && kobj == kobj) && 0 == \result) && kobj == kobj) && unknown-#memory_int-unknown[\result][12] <= 1) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && 1 <= unknown-#memory_int-unknown[\result][12]) && !(kobj == 0)) && (!(kobj == 0) || !(kobj == 0))) || (0 == \result && \result == 0) - InvariantResult [Line: 717]: Loop Invariant Derived loop invariant: (((0 == \result && kobj == 0) && kobj == 0) && \result == 0) || ((((((((((((((((((0 == kobj && kobj == kobj) && 0 == \result) && kobj == kobj) && unknown-#memory_int-unknown[kobj][kobj + 12] < 2147483649) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && 1 <= unknown-#memory_int-unknown[\result][12]) && kobj == 0) && !(\result == 0)) && kobj == 0) && 2 <= unknown-#memory_int-unknown[kobj][kobj + 12]) && kobj + 12 == v) && !(kobj == 0)) && unknown-#memory_int-unknown[v][v] <= temp) && v == kobj) && 1 <= i) && kobj == kobj) && !(kobj == 0)) && (!(kobj == 0) || !(kobj == 0))) RESULT: Ultimate proved your program to be correct! [2022-12-14 08:02:37,697 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c838ad6-3476-469c-8fea-5d3d04d05d8b/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE