./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 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/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_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW --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-4e7fbc6 [2022-11-23 14:24:07,732 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 14:24:07,735 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 14:24:07,755 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 14:24:07,756 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 14:24:07,757 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 14:24:07,758 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 14:24:07,760 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 14:24:07,762 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 14:24:07,763 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 14:24:07,764 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 14:24:07,765 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 14:24:07,765 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 14:24:07,766 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 14:24:07,768 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 14:24:07,769 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 14:24:07,770 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 14:24:07,771 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 14:24:07,773 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 14:24:07,775 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 14:24:07,776 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 14:24:07,779 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 14:24:07,784 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 14:24:07,787 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 14:24:07,792 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 14:24:07,797 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 14:24:07,799 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 14:24:07,801 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 14:24:07,801 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 14:24:07,802 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 14:24:07,804 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 14:24:07,805 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 14:24:07,806 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 14:24:07,807 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 14:24:07,809 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 14:24:07,810 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 14:24:07,811 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 14:24:07,811 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 14:24:07,811 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 14:24:07,812 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 14:24:07,814 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 14:24:07,815 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-23 14:24:07,874 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 14:24:07,875 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 14:24:07,875 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 14:24:07,876 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 14:24:07,876 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 14:24:07,877 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 14:24:07,877 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 14:24:07,877 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 14:24:07,877 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 14:24:07,878 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 14:24:07,879 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 14:24:07,879 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 14:24:07,879 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 14:24:07,880 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 14:24:07,880 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 14:24:07,880 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 14:24:07,880 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 14:24:07,880 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 14:24:07,881 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 14:24:07,881 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 14:24:07,882 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 14:24:07,882 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 14:24:07,882 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 14:24:07,882 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 14:24:07,882 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 14:24:07,883 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 14:24:07,883 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 14:24:07,883 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-23 14:24:07,884 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 14:24:07,884 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 14:24:07,884 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 14:24:07,884 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 14:24:07,885 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 14:24:07,885 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 14:24:07,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:24:07,885 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 14:24:07,885 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 14:24:07,886 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 14:24:07,886 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 14:24:07,886 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 14:24:07,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 14:24:07,886 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 14:24:07,887 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 14:24:07,895 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_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/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_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW 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-11-23 14:24:08,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 14:24:08,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 14:24:08,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 14:24:08,183 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 14:24:08,184 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 14:24:08,185 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i [2022-11-23 14:24:11,275 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 14:24:11,566 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 14:24:11,574 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i [2022-11-23 14:24:11,598 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/data/eb1c88f39/9d415a04e3744835a472e94d50c42f3e/FLAG18d007d70 [2022-11-23 14:24:11,616 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/data/eb1c88f39/9d415a04e3744835a472e94d50c42f3e [2022-11-23 14:24:11,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 14:24:11,620 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 14:24:11,638 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 14:24:11,638 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 14:24:11,661 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 14:24:11,663 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:24:11" (1/1) ... [2022-11-23 14:24:11,666 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5899c4b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:11, skipping insertion in model container [2022-11-23 14:24:11,666 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:24:11" (1/1) ... [2022-11-23 14:24:11,685 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 14:24:11,733 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 14:24:12,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:24:12,202 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 14:24:12,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:24:12,347 INFO L208 MainTranslator]: Completed translation [2022-11-23 14:24:12,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:12 WrapperNode [2022-11-23 14:24:12,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 14:24:12,349 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 14:24:12,349 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 14:24:12,349 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 14:24:12,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:12" (1/1) ... [2022-11-23 14:24:12,371 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:12" (1/1) ... [2022-11-23 14:24:12,397 INFO L138 Inliner]: procedures = 166, calls = 73, calls flagged for inlining = 25, calls inlined = 19, statements flattened = 125 [2022-11-23 14:24:12,397 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 14:24:12,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 14:24:12,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 14:24:12,399 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 14:24:12,411 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:12" (1/1) ... [2022-11-23 14:24:12,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:12" (1/1) ... [2022-11-23 14:24:12,419 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:12" (1/1) ... [2022-11-23 14:24:12,420 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:12" (1/1) ... [2022-11-23 14:24:12,430 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:12" (1/1) ... [2022-11-23 14:24:12,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:12" (1/1) ... [2022-11-23 14:24:12,436 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:12" (1/1) ... [2022-11-23 14:24:12,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:12" (1/1) ... [2022-11-23 14:24:12,440 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 14:24:12,441 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 14:24:12,442 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 14:24:12,442 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 14:24:12,443 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:12" (1/1) ... [2022-11-23 14:24:12,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:24:12,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:24:12,476 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 14:24:12,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 14:24:12,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 14:24:12,538 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2022-11-23 14:24:12,538 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2022-11-23 14:24:12,538 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-23 14:24:12,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-23 14:24:12,539 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2022-11-23 14:24:12,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2022-11-23 14:24:12,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 14:24:12,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 14:24:12,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 14:24:12,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-23 14:24:12,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-23 14:24:12,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 14:24:12,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-23 14:24:12,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 14:24:12,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 14:24:12,773 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 14:24:12,775 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 14:24:13,093 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 14:24:13,233 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 14:24:13,234 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 14:24:13,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:24:13 BoogieIcfgContainer [2022-11-23 14:24:13,236 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 14:24:13,239 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 14:24:13,239 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 14:24:13,242 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 14:24:13,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:24:11" (1/3) ... [2022-11-23 14:24:13,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5f08a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:24:13, skipping insertion in model container [2022-11-23 14:24:13,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:12" (2/3) ... [2022-11-23 14:24:13,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5f08a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:24:13, skipping insertion in model container [2022-11-23 14:24:13,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:24:13" (3/3) ... [2022-11-23 14:24:13,245 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3-1.i [2022-11-23 14:24:13,265 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 14:24:13,265 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-23 14:24:13,312 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 14:24:13,318 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;@2143603a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 14:24:13,319 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-23 14:24:13,322 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-11-23 14:24:13,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 14:24:13,330 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:13,331 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:24:13,331 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-11-23 14:24:13,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:13,337 INFO L85 PathProgramCache]: Analyzing trace with hash 441482866, now seen corresponding path program 1 times [2022-11-23 14:24:13,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:13,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705060027] [2022-11-23 14:24:13,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:13,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:13,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:13,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:13,826 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:13,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705060027] [2022-11-23 14:24:13,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705060027] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:24:13,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:24:13,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:24:13,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299480796] [2022-11-23 14:24:13,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:24:13,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:24:13,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:13,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:24:13,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:24:13,874 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-11-23 14:24:13,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:13,987 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2022-11-23 14:24:13,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 14:24:13,989 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-11-23 14:24:13,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:13,997 INFO L225 Difference]: With dead ends: 66 [2022-11-23 14:24:13,997 INFO L226 Difference]: Without dead ends: 42 [2022-11-23 14:24:14,000 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-11-23 14:24:14,003 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:14,004 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.1s Time] [2022-11-23 14:24:14,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-23 14:24:14,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2022-11-23 14:24:14,039 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-11-23 14:24:14,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-11-23 14:24:14,042 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 9 [2022-11-23 14:24:14,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:14,042 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-11-23 14:24:14,043 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-11-23 14:24:14,043 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-11-23 14:24:14,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 14:24:14,044 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:14,044 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:24:14,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 14:24:14,044 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-11-23 14:24:14,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:14,045 INFO L85 PathProgramCache]: Analyzing trace with hash 2106414958, now seen corresponding path program 1 times [2022-11-23 14:24:14,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:14,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20382570] [2022-11-23 14:24:14,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:14,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:14,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:14,337 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:14,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20382570] [2022-11-23 14:24:14,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20382570] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:24:14,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:24:14,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 14:24:14,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049700183] [2022-11-23 14:24:14,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:24:14,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 14:24:14,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:14,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 14:24:14,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-23 14:24:14,341 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-11-23 14:24:14,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:14,487 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-11-23 14:24:14,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 14:24:14,488 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-11-23 14:24:14,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:14,490 INFO L225 Difference]: With dead ends: 54 [2022-11-23 14:24:14,490 INFO L226 Difference]: Without dead ends: 34 [2022-11-23 14:24:14,491 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-11-23 14:24:14,492 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-11-23 14:24:14,493 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-11-23 14:24:14,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-23 14:24:14,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-11-23 14:24:14,500 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-11-23 14:24:14,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-11-23 14:24:14,501 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 13 [2022-11-23 14:24:14,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:14,502 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-11-23 14:24:14,502 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-11-23 14:24:14,502 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-11-23 14:24:14,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-23 14:24:14,503 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:14,503 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:24:14,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 14:24:14,503 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-11-23 14:24:14,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:14,504 INFO L85 PathProgramCache]: Analyzing trace with hash 863853883, now seen corresponding path program 1 times [2022-11-23 14:24:14,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:14,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073123807] [2022-11-23 14:24:14,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:14,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:14,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:14,761 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:14,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073123807] [2022-11-23 14:24:14,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073123807] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:24:14,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:24:14,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 14:24:14,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296861072] [2022-11-23 14:24:14,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:24:14,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 14:24:14,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:14,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 14:24:14,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 14:24:14,772 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-11-23 14:24:14,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:14,930 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-11-23 14:24:14,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 14:24:14,931 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-11-23 14:24:14,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:14,934 INFO L225 Difference]: With dead ends: 59 [2022-11-23 14:24:14,934 INFO L226 Difference]: Without dead ends: 43 [2022-11-23 14:24:14,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-23 14:24:14,939 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 35 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-11-23 14:24:14,940 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-11-23 14:24:14,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-23 14:24:14,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2022-11-23 14:24:14,951 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-11-23 14:24:14,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-11-23 14:24:14,957 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 12 [2022-11-23 14:24:14,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:14,957 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-11-23 14:24:14,958 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-11-23 14:24:14,958 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-11-23 14:24:14,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 14:24:14,959 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:14,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:24:14,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 14:24:14,960 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-11-23 14:24:14,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:14,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1576126940, now seen corresponding path program 1 times [2022-11-23 14:24:14,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:14,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468795454] [2022-11-23 14:24:14,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:14,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:14,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:15,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:15,092 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:15,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468795454] [2022-11-23 14:24:15,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468795454] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:24:15,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:24:15,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 14:24:15,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863101552] [2022-11-23 14:24:15,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:24:15,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:24:15,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:15,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:24:15,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:24:15,095 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-11-23 14:24:15,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:15,169 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2022-11-23 14:24:15,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 14:24:15,170 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-11-23 14:24:15,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:15,171 INFO L225 Difference]: With dead ends: 55 [2022-11-23 14:24:15,171 INFO L226 Difference]: Without dead ends: 32 [2022-11-23 14:24:15,171 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-11-23 14:24:15,172 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-11-23 14:24:15,173 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-11-23 14:24:15,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-23 14:24:15,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-11-23 14:24:15,180 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-11-23 14:24:15,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-11-23 14:24:15,181 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 14 [2022-11-23 14:24:15,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:15,182 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-11-23 14:24:15,182 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-11-23 14:24:15,182 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-11-23 14:24:15,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-23 14:24:15,183 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:15,183 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:24:15,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 14:24:15,184 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-11-23 14:24:15,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:15,184 INFO L85 PathProgramCache]: Analyzing trace with hash -106383637, now seen corresponding path program 1 times [2022-11-23 14:24:15,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:15,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085787193] [2022-11-23 14:24:15,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:15,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:15,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:15,376 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:15,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085787193] [2022-11-23 14:24:15,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085787193] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:24:15,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:24:15,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:24:15,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453770107] [2022-11-23 14:24:15,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:24:15,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:24:15,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:15,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:24:15,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:24:15,379 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-11-23 14:24:15,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:15,415 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2022-11-23 14:24:15,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:24:15,416 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-11-23 14:24:15,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:15,417 INFO L225 Difference]: With dead ends: 58 [2022-11-23 14:24:15,417 INFO L226 Difference]: Without dead ends: 33 [2022-11-23 14:24:15,417 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-11-23 14:24:15,418 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-11-23 14:24:15,419 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-11-23 14:24:15,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-23 14:24:15,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-11-23 14:24:15,427 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-11-23 14:24:15,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-11-23 14:24:15,428 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 17 [2022-11-23 14:24:15,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:15,428 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-11-23 14:24:15,428 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-11-23 14:24:15,428 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-11-23 14:24:15,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 14:24:15,429 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:15,429 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:24:15,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 14:24:15,429 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-11-23 14:24:15,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:15,430 INFO L85 PathProgramCache]: Analyzing trace with hash -2099083920, now seen corresponding path program 1 times [2022-11-23 14:24:15,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:15,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234634816] [2022-11-23 14:24:15,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:15,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:15,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:15,639 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:15,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234634816] [2022-11-23 14:24:15,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234634816] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:24:15,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286044173] [2022-11-23 14:24:15,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:15,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:15,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:24:15,647 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:24:15,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 14:24:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:15,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 90 conjunts are in the unsatisfiable core [2022-11-23 14:24:15,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:24:16,045 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-11-23 14:24:16,145 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_81 Int) (LDV_INIT_LIST_HEAD_~list.offset Int) (v_ArrVal_82 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_82) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_81))) (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2022-11-23 14:24:16,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:16,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:16,227 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-11-23 14:24:16,345 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-11-23 14:24:16,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 14:24:16,374 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:24:16,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286044173] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:24:16,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 14:24:16,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 16 [2022-11-23 14:24:16,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374312623] [2022-11-23 14:24:16,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:24:16,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 14:24:16,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:16,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 14:24:16,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=177, Unknown=1, NotChecked=26, Total=240 [2022-11-23 14:24:16,386 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-11-23 14:24:16,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:16,830 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-11-23 14:24:16,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-23 14:24:16,831 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-11-23 14:24:16,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:16,831 INFO L225 Difference]: With dead ends: 43 [2022-11-23 14:24:16,831 INFO L226 Difference]: Without dead ends: 42 [2022-11-23 14:24:16,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=386, Unknown=1, NotChecked=40, Total=506 [2022-11-23 14:24:16,833 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 40 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:16,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 145 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 235 Invalid, 0 Unknown, 45 Unchecked, 0.3s Time] [2022-11-23 14:24:16,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-23 14:24:16,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2022-11-23 14:24:16,852 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-11-23 14:24:16,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-11-23 14:24:16,858 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2022-11-23 14:24:16,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:16,859 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-11-23 14:24:16,860 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-11-23 14:24:16,860 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-11-23 14:24:16,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-23 14:24:16,861 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:16,861 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-11-23 14:24:16,874 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-23 14:24:17,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-23 14:24:17,069 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-11-23 14:24:17,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:17,069 INFO L85 PathProgramCache]: Analyzing trace with hash -647092000, now seen corresponding path program 1 times [2022-11-23 14:24:17,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:17,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565679748] [2022-11-23 14:24:17,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:17,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:17,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:17,275 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:17,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565679748] [2022-11-23 14:24:17,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565679748] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:24:17,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102259811] [2022-11-23 14:24:17,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:17,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:17,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:24:17,279 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:24:17,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 14:24:17,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:17,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 92 conjunts are in the unsatisfiable core [2022-11-23 14:24:17,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:24:17,426 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-11-23 14:24:17,531 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-11-23 14:24:17,580 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|) (= |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_135) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_138))))) is different from true [2022-11-23 14:24:17,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:17,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:17,602 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-11-23 14:24:17,682 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-11-23 14:24:17,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 14:24:17,704 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:24:17,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102259811] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:24:17,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 14:24:17,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 16 [2022-11-23 14:24:17,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326220294] [2022-11-23 14:24:17,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:24:17,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 14:24:17,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:17,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 14:24:17,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=177, Unknown=1, NotChecked=26, Total=240 [2022-11-23 14:24:17,708 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-11-23 14:24:18,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:18,017 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-11-23 14:24:18,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-23 14:24:18,018 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-11-23 14:24:18,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:18,019 INFO L225 Difference]: With dead ends: 38 [2022-11-23 14:24:18,019 INFO L226 Difference]: Without dead ends: 37 [2022-11-23 14:24:18,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=349, Unknown=1, NotChecked=38, Total=462 [2022-11-23 14:24:18,020 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 42 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:18,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 100 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 178 Invalid, 0 Unknown, 37 Unchecked, 0.2s Time] [2022-11-23 14:24:18,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-23 14:24:18,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2022-11-23 14:24:18,030 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-11-23 14:24:18,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-11-23 14:24:18,037 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 19 [2022-11-23 14:24:18,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:18,038 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-11-23 14:24:18,038 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-11-23 14:24:18,038 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-11-23 14:24:18,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-23 14:24:18,039 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:18,040 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-11-23 14:24:18,047 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 14:24:18,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:18,246 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-11-23 14:24:18,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:18,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1347965076, now seen corresponding path program 1 times [2022-11-23 14:24:18,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:18,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427130443] [2022-11-23 14:24:18,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:18,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:18,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:18,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 14:24:18,409 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:18,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427130443] [2022-11-23 14:24:18,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427130443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:24:18,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:24:18,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 14:24:18,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566097546] [2022-11-23 14:24:18,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:24:18,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:24:18,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:18,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:24:18,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:24:18,412 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-11-23 14:24:18,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:18,489 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-11-23 14:24:18,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 14:24:18,490 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-11-23 14:24:18,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:18,490 INFO L225 Difference]: With dead ends: 43 [2022-11-23 14:24:18,490 INFO L226 Difference]: Without dead ends: 31 [2022-11-23 14:24:18,491 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-11-23 14:24:18,492 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-11-23 14:24:18,492 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-11-23 14:24:18,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-23 14:24:18,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-11-23 14:24:18,500 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-11-23 14:24:18,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-11-23 14:24:18,501 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 22 [2022-11-23 14:24:18,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:18,502 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-11-23 14:24:18,502 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-11-23 14:24:18,502 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-11-23 14:24:18,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 14:24:18,503 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:18,503 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-11-23 14:24:18,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 14:24:18,503 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-11-23 14:24:18,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:18,504 INFO L85 PathProgramCache]: Analyzing trace with hash 575608362, now seen corresponding path program 1 times [2022-11-23 14:24:18,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:18,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820981142] [2022-11-23 14:24:18,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:18,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:18,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:18,642 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:18,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820981142] [2022-11-23 14:24:18,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820981142] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:24:18,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102833084] [2022-11-23 14:24:18,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:18,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:18,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:24:18,655 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:24:18,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 14:24:18,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:18,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 148 conjunts are in the unsatisfiable core [2022-11-23 14:24:18,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:24:18,946 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-11-23 14:24:18,997 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_230 Int) (LDV_INIT_LIST_HEAD_~list.offset Int) (v_ArrVal_229 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_230) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_229)) |c_#memory_int|) (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2022-11-23 14:24:19,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:19,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:19,037 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-11-23 14:24:19,183 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:24:19,186 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:24:19,187 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-11-23 14:24:19,315 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-11-23 14:24:19,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:19,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:24:19,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102833084] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:24:19,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [230792095] [2022-11-23 14:24:19,983 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-23 14:24:19,983 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:24:19,987 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:24:19,992 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:24:19,992 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:24:20,047 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-11-23 14:24:20,052 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-11-23 14:24:20,179 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-11-23 14:24:20,193 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:24:20,205 INFO L321 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2022-11-23 14:24:20,205 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-11-23 14:24:20,218 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:24:20,232 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-23 14:24:20,232 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-11-23 14:24:20,304 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-11-23 14:24:20,318 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-11-23 14:24:20,326 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-11-23 14:24:20,385 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-11-23 14:24:20,399 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-11-23 14:24:20,419 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-11-23 14:24:20,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:20,539 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-11-23 14:24:20,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:20,547 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-11-23 14:24:20,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:20,560 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-11-23 14:24:20,615 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-11-23 14:24:20,772 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-11-23 14:24:20,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-11-23 14:24:20,940 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-11-23 14:24:20,958 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-11-23 14:24:21,103 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_kobject_put with input of size 39 for LOIs [2022-11-23 14:24:21,136 INFO L197 IcfgInterpreter]: Interpreting procedure LDV_INIT_LIST_HEAD with input of size 33 for LOIs [2022-11-23 14:24:21,148 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 43 for LOIs [2022-11-23 14:24:21,172 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:24:26,573 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-11-23 14:24:26,573 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:24:26,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:24:26,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 19] total 22 [2022-11-23 14:24:26,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058950763] [2022-11-23 14:24:26,574 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:24:26,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-23 14:24:26,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:26,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-23 14:24:26,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2648, Unknown=1, NotChecked=104, Total=2970 [2022-11-23 14:24:26,577 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-11-23 14:24:27,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:27,511 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2022-11-23 14:24:27,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-23 14:24:27,514 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-11-23 14:24:27,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:27,514 INFO L225 Difference]: With dead ends: 66 [2022-11-23 14:24:27,514 INFO L226 Difference]: Without dead ends: 41 [2022-11-23 14:24:27,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=344, Invalid=4081, Unknown=1, NotChecked=130, Total=4556 [2022-11-23 14:24:27,517 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 56 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:27,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 95 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 405 Invalid, 0 Unknown, 35 Unchecked, 0.4s Time] [2022-11-23 14:24:27,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-23 14:24:27,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2022-11-23 14:24:27,526 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-11-23 14:24:27,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2022-11-23 14:24:27,527 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 24 [2022-11-23 14:24:27,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:27,527 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2022-11-23 14:24:27,527 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-11-23 14:24:27,528 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-11-23 14:24:27,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-23 14:24:27,528 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:27,528 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-11-23 14:24:27,535 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 14:24:27,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:27,735 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-11-23 14:24:27,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:27,735 INFO L85 PathProgramCache]: Analyzing trace with hash -2136135414, now seen corresponding path program 1 times [2022-11-23 14:24:27,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:27,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074937144] [2022-11-23 14:24:27,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:27,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:27,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:27,943 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:27,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074937144] [2022-11-23 14:24:27,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074937144] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:24:27,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353673068] [2022-11-23 14:24:27,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:27,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:27,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:24:27,945 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:24:27,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 14:24:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:28,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 106 conjunts are in the unsatisfiable core [2022-11-23 14:24:28,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:24:28,197 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-11-23 14:24:28,265 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-11-23 14:24:28,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:28,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:24:28,393 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-11-23 14:24:28,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 14:24:28,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353673068] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-23 14:24:28,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:24:28,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5, 10] total 18 [2022-11-23 14:24:28,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65232595] [2022-11-23 14:24:28,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:24:28,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 14:24:28,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:28,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 14:24:28,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2022-11-23 14:24:28,430 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-11-23 14:24:28,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:28,691 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2022-11-23 14:24:28,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 14:24:28,692 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-11-23 14:24:28,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:28,692 INFO L225 Difference]: With dead ends: 48 [2022-11-23 14:24:28,692 INFO L226 Difference]: Without dead ends: 43 [2022-11-23 14:24:28,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2022-11-23 14:24:28,694 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-11-23 14:24:28,694 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-11-23 14:24:28,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-23 14:24:28,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-11-23 14:24:28,702 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-11-23 14:24:28,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2022-11-23 14:24:28,703 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 26 [2022-11-23 14:24:28,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:28,703 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2022-11-23 14:24:28,703 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-11-23 14:24:28,703 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2022-11-23 14:24:28,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-23 14:24:28,704 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:28,704 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-11-23 14:24:28,711 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 14:24:28,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-23 14:24:28,905 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-11-23 14:24:28,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:28,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1451732896, now seen corresponding path program 1 times [2022-11-23 14:24:28,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:28,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776369681] [2022-11-23 14:24:28,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:28,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:28,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:29,176 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 14:24:29,176 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:29,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776369681] [2022-11-23 14:24:29,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776369681] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:24:29,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:24:29,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-23 14:24:29,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601367117] [2022-11-23 14:24:29,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:24:29,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 14:24:29,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:29,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 14:24:29,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-23 14:24:29,178 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-11-23 14:24:29,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:29,316 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-11-23 14:24:29,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 14:24:29,317 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-11-23 14:24:29,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:29,317 INFO L225 Difference]: With dead ends: 45 [2022-11-23 14:24:29,317 INFO L226 Difference]: Without dead ends: 36 [2022-11-23 14:24:29,318 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-11-23 14:24:29,318 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 24 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:29,319 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.1s Time] [2022-11-23 14:24:29,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-23 14:24:29,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-11-23 14:24:29,326 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-11-23 14:24:29,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2022-11-23 14:24:29,326 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 32 [2022-11-23 14:24:29,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:29,327 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2022-11-23 14:24:29,327 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-11-23 14:24:29,328 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-11-23 14:24:29,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-23 14:24:29,328 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:29,329 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-11-23 14:24:29,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 14:24:29,329 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-11-23 14:24:29,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:29,330 INFO L85 PathProgramCache]: Analyzing trace with hash 602302323, now seen corresponding path program 1 times [2022-11-23 14:24:29,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:29,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282701019] [2022-11-23 14:24:29,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:29,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:29,670 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:29,671 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:29,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282701019] [2022-11-23 14:24:29,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282701019] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:24:29,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226100135] [2022-11-23 14:24:29,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:29,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:29,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:24:29,673 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:24:29,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 14:24:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:29,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 202 conjunts are in the unsatisfiable core [2022-11-23 14:24:29,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:24:30,008 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-11-23 14:24:30,054 WARN L859 $PredicateComparison]: unable to prove that (exists ((LDV_INIT_LIST_HEAD_~list.offset Int) (v_ArrVal_448 Int) (v_ArrVal_446 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_446) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_448)) |c_#memory_int|))) is different from true [2022-11-23 14:24:30,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:30,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:30,068 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-11-23 14:24:30,223 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:24:30,226 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:24:30,226 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-11-23 14:24:30,452 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 (<= 0 (+ v_ArrVal_451 2147483648)) (= |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-11-23 14:24:30,473 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:24:30,476 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:24:30,476 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-11-23 14:24:30,591 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-11-23 14:24:30,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:30,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:24:31,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226100135] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:24:31,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [426015319] [2022-11-23 14:24:31,102 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-23 14:24:31,102 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:24:31,102 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:24:31,102 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:24:31,103 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:24:31,125 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-11-23 14:24:31,130 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-11-23 14:24:31,221 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:24:31,234 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-23 14:24:31,234 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-11-23 14:24:31,248 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:24:31,258 INFO L321 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2022-11-23 14:24:31,258 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-11-23 14:24:31,295 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-11-23 14:24:31,328 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-11-23 14:24:31,342 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-11-23 14:24:31,349 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-11-23 14:24:31,406 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-11-23 14:24:31,422 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-11-23 14:24:31,431 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-11-23 14:24:31,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:31,533 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-11-23 14:24:31,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:31,539 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-11-23 14:24:31,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:31,547 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-11-23 14:24:31,598 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-11-23 14:24:31,723 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-11-23 14:24:31,846 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-11-23 14:24:31,858 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-11-23 14:24:31,874 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-11-23 14:24:32,012 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-11-23 14:24:32,034 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-11-23 14:24:32,065 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:24:32,066 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-11-23 14:24:32,095 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-11-23 14:24:32,111 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-11-23 14:24:32,292 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-11-23 14:24:32,461 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-11-23 14:24:32,750 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_kobject_put with input of size 51 for LOIs [2022-11-23 14:24:33,110 INFO L197 IcfgInterpreter]: Interpreting procedure LDV_INIT_LIST_HEAD with input of size 33 for LOIs [2022-11-23 14:24:33,121 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 43 for LOIs [2022-11-23 14:24:33,142 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:24:40,304 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2169#(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-11-23 14:24:40,304 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:24:40,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:24:40,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 25] total 29 [2022-11-23 14:24:40,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670179631] [2022-11-23 14:24:40,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:24:40,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-23 14:24:40,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:40,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-23 14:24:40,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=2957, Unknown=2, NotChecked=222, Total=3422 [2022-11-23 14:24:40,307 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand has 29 states, 25 states have (on average 2.04) internal successors, (51), 26 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-11-23 14:24:41,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:41,144 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2022-11-23 14:24:41,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-23 14:24:41,145 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 2.04) internal successors, (51), 26 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-11-23 14:24:41,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:41,146 INFO L225 Difference]: With dead ends: 63 [2022-11-23 14:24:41,146 INFO L226 Difference]: Without dead ends: 36 [2022-11-23 14:24:41,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1246 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=352, Invalid=4346, Unknown=2, NotChecked=270, Total=4970 [2022-11-23 14:24:41,148 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 46 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:41,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 50 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 350 Invalid, 0 Unknown, 71 Unchecked, 0.3s Time] [2022-11-23 14:24:41,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-23 14:24:41,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-11-23 14:24:41,156 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-11-23 14:24:41,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2022-11-23 14:24:41,156 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2022-11-23 14:24:41,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:41,156 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2022-11-23 14:24:41,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 2.04) internal successors, (51), 26 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-11-23 14:24:41,157 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-11-23 14:24:41,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-23 14:24:41,158 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:41,158 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-11-23 14:24:41,167 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 14:24:41,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-23 14:24:41,359 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-11-23 14:24:41,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:41,359 INFO L85 PathProgramCache]: Analyzing trace with hash -863177865, now seen corresponding path program 1 times [2022-11-23 14:24:41,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:41,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698668216] [2022-11-23 14:24:41,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:41,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:41,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:41,654 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:41,655 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:41,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698668216] [2022-11-23 14:24:41,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698668216] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:24:41,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779079858] [2022-11-23 14:24:41,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:41,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:41,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:24:41,657 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:24:41,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 14:24:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:41,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 202 conjunts are in the unsatisfiable core [2022-11-23 14:24:41,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:24:42,030 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-11-23 14:24:42,080 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_565 Int) (v_ArrVal_563 Int) (LDV_INIT_LIST_HEAD_~list.offset 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_565) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_563)) |c_#memory_int|) (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2022-11-23 14:24:42,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:42,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:42,094 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-11-23 14:24:42,257 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:24:42,260 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:24:42,261 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-11-23 14:24:42,486 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 32 treesize of output 16 [2022-11-23 14:24:42,610 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-11-23 14:24:42,656 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 14:24:42,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:24:43,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779079858] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:24:43,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [829670608] [2022-11-23 14:24:43,170 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-23 14:24:43,171 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:24:43,171 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:24:43,171 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:24:43,171 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:24:43,194 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-11-23 14:24:43,199 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-11-23 14:24:43,277 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:24:43,290 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-23 14:24:43,291 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-11-23 14:24:43,306 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:24:43,320 INFO L321 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2022-11-23 14:24:43,320 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-11-23 14:24:43,348 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-11-23 14:24:43,377 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-11-23 14:24:43,390 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-11-23 14:24:43,397 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-11-23 14:24:43,448 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-11-23 14:24:43,458 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-11-23 14:24:43,471 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-11-23 14:24:43,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:43,579 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-11-23 14:24:43,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:43,585 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-11-23 14:24:43,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:43,590 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-11-23 14:24:43,622 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-11-23 14:24:43,764 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-11-23 14:24:43,873 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-11-23 14:24:43,886 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-11-23 14:24:43,900 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-11-23 14:24:44,039 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:24:44,039 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-11-23 14:24:44,056 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-11-23 14:24:44,093 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-11-23 14:24:44,115 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-11-23 14:24:44,133 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-11-23 14:24:44,268 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-11-23 14:24:44,470 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-11-23 14:24:44,738 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_kobject_put with input of size 51 for LOIs [2022-11-23 14:24:45,077 INFO L197 IcfgInterpreter]: Interpreting procedure LDV_INIT_LIST_HEAD with input of size 33 for LOIs [2022-11-23 14:24:45,087 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 43 for LOIs [2022-11-23 14:24:45,108 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:24:52,547 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2526#(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-11-23 14:24:52,547 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:24:52,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:24:52,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 24] total 29 [2022-11-23 14:24:52,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912676554] [2022-11-23 14:24:52,548 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:24:52,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-23 14:24:52,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:52,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-23 14:24:52,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=3070, Unknown=1, NotChecked=112, Total=3422 [2022-11-23 14:24:52,551 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand has 29 states, 25 states have (on average 2.2) internal successors, (55), 26 states have internal predecessors, (55), 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-11-23 14:24:53,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:53,746 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2022-11-23 14:24:53,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-23 14:24:53,747 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 2.2) internal successors, (55), 26 states have internal predecessors, (55), 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 35 [2022-11-23 14:24:53,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:53,747 INFO L225 Difference]: With dead ends: 62 [2022-11-23 14:24:53,747 INFO L226 Difference]: Without dead ends: 0 [2022-11-23 14:24:53,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1282 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=373, Invalid=4886, Unknown=1, NotChecked=142, Total=5402 [2022-11-23 14:24:53,749 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 37 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:53,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 88 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 539 Invalid, 0 Unknown, 31 Unchecked, 0.4s Time] [2022-11-23 14:24:53,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-23 14:24:53,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-23 14:24:53,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:24:53,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-23 14:24:53,751 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2022-11-23 14:24:53,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:53,751 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-23 14:24:53,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 2.2) internal successors, (55), 26 states have internal predecessors, (55), 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-11-23 14:24:53,752 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-23 14:24:53,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-23 14:24:53,754 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-11-23 14:24:53,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-11-23 14:24:53,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-11-23 14:24:53,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-11-23 14:24:53,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 14:24:53,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:53,964 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-23 14:24:55,227 INFO L902 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 525 531) the Hoare annotation is: true [2022-11-23 14:24:55,227 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 525 531) no Hoare annotation was computed. [2022-11-23 14:24:55,227 INFO L899 garLoopResultBuilder]: For program point L659(line 659) no Hoare annotation was computed. [2022-11-23 14:24:55,228 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-11-23 14:24:55,228 INFO L899 garLoopResultBuilder]: For program point L717(lines 717 718) no Hoare annotation was computed. [2022-11-23 14:24:55,228 INFO L895 garLoopResultBuilder]: At program point L717-2(lines 717 718) the Hoare annotation is: (let ((.cse2 (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|)) (.cse5 (= |ULTIMATE.start_entry_point_~kobj~2#1.base| 0)) (.cse4 (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| 0)) (.cse3 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0))) (or (let ((.cse1 (+ |ULTIMATE.start_entry_point_~kobj~2#1.offset| 12)) (.cse0 (select |#memory_int| |ULTIMATE.start_entry_point_~kobj~2#1.base|))) (and (<= (select .cse0 .cse1) 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|) .cse2 (= |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 .cse3) .cse4 (= .cse1 |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|) (<= 2 (select .cse0 12)) (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 .cse2 .cse5 .cse4 .cse3))) [2022-11-23 14:24:55,229 INFO L895 garLoopResultBuilder]: At program point L746(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-11-23 14:24:55,229 INFO L899 garLoopResultBuilder]: For program point L742(lines 742 743) no Hoare annotation was computed. [2022-11-23 14:24:55,229 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 659) no Hoare annotation was computed. [2022-11-23 14:24:55,229 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-23 14:24:55,229 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-11-23 14:24:55,229 INFO L899 garLoopResultBuilder]: For program point L730(lines 730 732) no Hoare annotation was computed. [2022-11-23 14:24:55,230 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-11-23 14:24:55,230 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-11-23 14:24:55,230 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 659) no Hoare annotation was computed. [2022-11-23 14:24:55,230 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-23 14:24:55,231 INFO L895 garLoopResultBuilder]: At program point L768(line 768) the Hoare annotation is: (let ((.cse5 (= |ULTIMATE.start_f_22_put_~kobj#1.base| 0)) (.cse1 (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|)) (.cse7 (= |ULTIMATE.start_entry_point_~kobj~2#1.base| 0)) (.cse3 (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| 0)) (.cse4 (= |ULTIMATE.start_f_22_put_~kobj#1.offset| 0)) (.cse2 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0))) (or (let ((.cse6 (+ |ULTIMATE.start_entry_point_~kobj~2#1.offset| 12))) (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_entry_point_~kobj~2#1.base|) .cse6))) (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_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (or (not .cse1) (not .cse2)) (< (select (select |#memory_int| |ULTIMATE.start_f_22_put_~kobj#1.base|) (+ |ULTIMATE.start_f_22_put_~kobj#1.offset| 12)) 2147483649) (<= 1 .cse0) .cse3 (or (not .cse4) (not .cse5)) (= .cse6 |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) (= |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 .cse7) (or (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| 0)))))) (and .cse5 .cse1 .cse7 .cse3 .cse4 .cse2))) [2022-11-23 14:24:55,231 INFO L899 garLoopResultBuilder]: For program point L768-1(lines 763 769) no Hoare annotation was computed. [2022-11-23 14:24:55,231 INFO L895 garLoopResultBuilder]: At program point L731(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-11-23 14:24:55,231 INFO L899 garLoopResultBuilder]: For program point L723(lines 723 724) no Hoare annotation was computed. [2022-11-23 14:24:55,231 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 ((.cse6 (+ |ULTIMATE.start_entry_point_~kobj~2#1.offset| 12)) (.cse5 (select |#memory_int| |ULTIMATE.start_entry_point_~kobj~2#1.base|))) (and (<= (select .cse5 .cse6) 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|) .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) .cse2 (= .cse6 |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|) (<= 2 (select .cse5 12)) (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-11-23 14:24:55,232 INFO L899 garLoopResultBuilder]: For program point L761-1(lines 760 762) no Hoare annotation was computed. [2022-11-23 14:24:55,232 INFO L902 garLoopResultBuilder]: At program point L741(line 741) the Hoare annotation is: true [2022-11-23 14:24:55,232 INFO L899 garLoopResultBuilder]: For program point L741-1(line 741) no Hoare annotation was computed. [2022-11-23 14:24:55,232 INFO L895 garLoopResultBuilder]: At program point LDV_INIT_LIST_HEADENTRY(lines 538 542) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-11-23 14:24:55,232 INFO L899 garLoopResultBuilder]: For program point LDV_INIT_LIST_HEADEXIT(lines 538 542) no Hoare annotation was computed. [2022-11-23 14:24:55,232 INFO L899 garLoopResultBuilder]: For program point L667(line 667) no Hoare annotation was computed. [2022-11-23 14:24:55,233 INFO L895 garLoopResultBuilder]: At program point L667-1(line 667) the Hoare annotation is: (let ((.cse0 (not (= |ldv_kobject_put_#in~kobj#1.offset| 0)))) (and (let ((.cse1 (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|)) (.cse2 (+ |ldv_kobject_put_#in~kobj#1.offset| 12))) (or .cse0 (not (<= 1 (select .cse1 12))) (and (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| .cse2) (= |ldv_kobject_put_~kobj#1.base| |ldv_kobject_put_#in~kobj#1.base|) (<= (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_atomic_sub_return_~temp~1#1| 2147483647) (<= |ldv_kobject_put_ldv_atomic_sub_return_~i#1| 1) (= |#memory_int| |old(#memory_int)|) (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| |ldv_kobject_put_#in~kobj#1.base|) (= |ldv_kobject_put_~kobj#1.offset| 0) (<= 1 |ldv_kobject_put_ldv_atomic_sub_return_~i#1|)) (forall ((v_ArrVal_569 Int)) (or (not (= v_ArrVal_569 (select .cse1 .cse2))) (not (<= v_ArrVal_569 2147483647)))))) (or .cse0 (not (= |ldv_kobject_put_#in~kobj#1.base| 0))))) [2022-11-23 14:24:55,233 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 667) no Hoare annotation was computed. [2022-11-23 14:24:55,234 INFO L895 garLoopResultBuilder]: At program point ldv_kobject_putENTRY(lines 709 714) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|))) (or (not (= |ldv_kobject_put_#in~kobj#1.offset| 0)) (not (<= 1 (select .cse0 12))) (= |#memory_int| |old(#memory_int)|) (forall ((v_ArrVal_569 Int)) (or (not (= v_ArrVal_569 (select .cse0 (+ |ldv_kobject_put_#in~kobj#1.offset| 12)))) (not (<= v_ArrVal_569 2147483647)))))) [2022-11-23 14:24:55,234 INFO L899 garLoopResultBuilder]: For program point L711(lines 711 713) no Hoare annotation was computed. [2022-11-23 14:24:55,234 INFO L899 garLoopResultBuilder]: For program point L711-2(lines 709 714) no Hoare annotation was computed. [2022-11-23 14:24:55,234 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putEXIT(lines 709 714) no Hoare annotation was computed. [2022-11-23 14:24:55,234 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 667) no Hoare annotation was computed. [2022-11-23 14:24:55,238 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:24:55,240 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 14:24:55,261 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_569,QUANTIFIED] [2022-11-23 14:24:55,262 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_569,QUANTIFIED] [2022-11-23 14:24:55,270 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_569,QUANTIFIED] [2022-11-23 14:24:55,270 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_569,QUANTIFIED] [2022-11-23 14:24:55,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:24:55 BoogieIcfgContainer [2022-11-23 14:24:55,294 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 14:24:55,294 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 14:24:55,295 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 14:24:55,295 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 14:24:55,295 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:24:13" (3/4) ... [2022-11-23 14:24:55,298 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-23 14:24:55,304 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-11-23 14:24:55,304 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2022-11-23 14:24:55,304 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2022-11-23 14:24:55,313 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 49 nodes and edges [2022-11-23 14:24:55,313 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2022-11-23 14:24:55,314 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-23 14:24:55,344 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-11-23 14:24:55,345 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((unknown-#memory_int-unknown[kobj][kobj + 12] <= 2147483647 && 0 == kobj) && kobj == kobj) && 0 == \result) && kobj == kobj) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && 1 <= unknown-#memory_int-unknown[\result][12]) && kobj == 0) && !(\result == 0)) && kobj == 0) && kobj + 12 == v) && !(kobj == 0)) && unknown-#memory_int-unknown[v][v] <= temp) && v == kobj) && 1 <= i) && kobj == kobj) && 2 <= unknown-#memory_int-unknown[kobj][12]) && !(kobj == 0)) && (!(kobj == 0) || !(kobj == 0))) || (((0 == \result && kobj == 0) && kobj == 0) && \result == 0) [2022-11-23 14:24:55,347 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-11-23 14:24:55,348 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(#in~kobj == 0) || !(1 <= \old(unknown-#memory_int-unknown)[#in~kobj][12])) || ((((((((v == #in~kobj + 12 && kobj == #in~kobj) && unknown-#memory_int-unknown[v][v] <= temp) && temp <= 2147483647) && i <= 1) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && v == #in~kobj) && kobj == 0) && 1 <= i)) || (forall v_ArrVal_569 : int :: !(v_ArrVal_569 == \old(unknown-#memory_int-unknown)[#in~kobj][#in~kobj + 12]) || !(v_ArrVal_569 <= 2147483647))) && (!(#in~kobj == 0) || !(#in~kobj == 0)) [2022-11-23 14:24:55,369 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/witness.graphml [2022-11-23 14:24:55,369 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 14:24:55,369 INFO L158 Benchmark]: Toolchain (without parser) took 43749.81ms. Allocated memory was 132.1MB in the beginning and 302.0MB in the end (delta: 169.9MB). Free memory was 67.8MB in the beginning and 251.0MB in the end (delta: -183.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 14:24:55,369 INFO L158 Benchmark]: CDTParser took 0.61ms. Allocated memory is still 132.1MB. Free memory is still 99.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 14:24:55,370 INFO L158 Benchmark]: CACSL2BoogieTranslator took 710.03ms. Allocated memory is still 174.1MB. Free memory was 145.5MB in the beginning and 124.0MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-23 14:24:55,370 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.93ms. Allocated memory is still 174.1MB. Free memory was 124.0MB in the beginning and 121.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 14:24:55,370 INFO L158 Benchmark]: Boogie Preprocessor took 42.56ms. Allocated memory is still 174.1MB. Free memory was 121.3MB in the beginning and 119.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 14:24:55,370 INFO L158 Benchmark]: RCFGBuilder took 795.14ms. Allocated memory is still 174.1MB. Free memory was 119.3MB in the beginning and 91.5MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-23 14:24:55,371 INFO L158 Benchmark]: TraceAbstraction took 42055.45ms. Allocated memory was 174.1MB in the beginning and 302.0MB in the end (delta: 127.9MB). Free memory was 91.0MB in the beginning and 255.2MB in the end (delta: -164.2MB). Peak memory consumption was 131.9MB. Max. memory is 16.1GB. [2022-11-23 14:24:55,371 INFO L158 Benchmark]: Witness Printer took 74.30ms. Allocated memory is still 302.0MB. Free memory was 255.2MB in the beginning and 251.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-23 14:24:55,373 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.61ms. Allocated memory is still 132.1MB. Free memory is still 99.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 710.03ms. Allocated memory is still 174.1MB. Free memory was 145.5MB in the beginning and 124.0MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.93ms. Allocated memory is still 174.1MB. Free memory was 124.0MB in the beginning and 121.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.56ms. Allocated memory is still 174.1MB. Free memory was 121.3MB in the beginning and 119.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 795.14ms. Allocated memory is still 174.1MB. Free memory was 119.3MB in the beginning and 91.5MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 42055.45ms. Allocated memory was 174.1MB in the beginning and 302.0MB in the end (delta: 127.9MB). Free memory was 91.0MB in the beginning and 255.2MB in the end (delta: -164.2MB). Peak memory consumption was 131.9MB. Max. memory is 16.1GB. * Witness Printer took 74.30ms. Allocated memory is still 302.0MB. Free memory was 255.2MB in the beginning and 251.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_569,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_569,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_569,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_569,QUANTIFIED] * 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: 41.9s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 388 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 382 mSDsluCounter, 1234 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 219 IncrementalHoareTripleChecker+Unchecked, 982 mSDsCounter, 115 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2152 IncrementalHoareTripleChecker+Invalid, 2486 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 115 mSolverCounterUnsat, 252 mSDtfsCounter, 2152 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 433 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 310 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 3742 ImplicationChecksByTransitivity, 25.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=10, InterpolantAutomatonStates: 151, 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, 745 HoareAnnotationTreeSize, 60 FomulaSimplifications, 294 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 14 FomulaSimplificationsInter, 2117 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 429 NumberOfCodeBlocks, 429 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 435 ConstructedInterpolants, 9 QuantifiedInterpolants, 2323 SizeOfPredicates, 371 NumberOfNonLiveVariables, 1871 ConjunctsInSsa, 840 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 19/53 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: 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: 667]: Loop Invariant [2022-11-23 14:24:55,392 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_569,QUANTIFIED] [2022-11-23 14:24:55,392 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_569,QUANTIFIED] [2022-11-23 14:24:55,393 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_569,QUANTIFIED] [2022-11-23 14:24:55,399 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_569,QUANTIFIED] Derived loop invariant: (((!(#in~kobj == 0) || !(1 <= \old(unknown-#memory_int-unknown)[#in~kobj][12])) || ((((((((v == #in~kobj + 12 && kobj == #in~kobj) && unknown-#memory_int-unknown[v][v] <= temp) && temp <= 2147483647) && i <= 1) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && v == #in~kobj) && kobj == 0) && 1 <= i)) || (forall v_ArrVal_569 : int :: !(v_ArrVal_569 == \old(unknown-#memory_int-unknown)[#in~kobj][#in~kobj + 12]) || !(v_ArrVal_569 <= 2147483647))) && (!(#in~kobj == 0) || !(#in~kobj == 0)) - 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: 717]: Loop Invariant Derived loop invariant: ((((((((((((((((((unknown-#memory_int-unknown[kobj][kobj + 12] <= 2147483647 && 0 == kobj) && kobj == kobj) && 0 == \result) && kobj == kobj) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && 1 <= unknown-#memory_int-unknown[\result][12]) && kobj == 0) && !(\result == 0)) && kobj == 0) && kobj + 12 == v) && !(kobj == 0)) && unknown-#memory_int-unknown[v][v] <= temp) && v == kobj) && 1 <= i) && kobj == kobj) && 2 <= unknown-#memory_int-unknown[kobj][12]) && !(kobj == 0)) && (!(kobj == 0) || !(kobj == 0))) || (((0 == \result && kobj == 0) && kobj == 0) && \result == 0) RESULT: Ultimate proved your program to be correct! [2022-11-23 14:24:55,423 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cad9e51f-68a2-4451-ab08-6ceffae3799f/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE