./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 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/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_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur --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-38b53e6 [2022-11-26 01:11:27,472 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 01:11:27,475 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 01:11:27,501 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 01:11:27,502 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 01:11:27,504 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 01:11:27,506 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 01:11:27,508 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 01:11:27,511 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 01:11:27,512 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 01:11:27,514 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 01:11:27,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 01:11:27,516 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 01:11:27,518 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 01:11:27,519 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 01:11:27,521 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 01:11:27,522 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 01:11:27,524 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 01:11:27,526 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 01:11:27,529 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 01:11:27,531 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 01:11:27,533 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 01:11:27,534 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 01:11:27,536 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 01:11:27,546 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 01:11:27,557 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 01:11:27,558 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 01:11:27,559 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 01:11:27,560 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 01:11:27,561 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 01:11:27,562 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 01:11:27,563 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 01:11:27,564 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 01:11:27,565 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 01:11:27,567 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 01:11:27,576 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 01:11:27,578 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 01:11:27,578 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 01:11:27,579 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 01:11:27,580 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 01:11:27,581 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 01:11:27,582 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-26 01:11:27,612 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 01:11:27,612 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 01:11:27,613 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 01:11:27,613 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 01:11:27,614 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 01:11:27,615 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 01:11:27,615 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 01:11:27,615 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 01:11:27,616 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 01:11:27,616 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 01:11:27,616 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 01:11:27,617 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 01:11:27,617 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 01:11:27,617 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 01:11:27,618 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 01:11:27,618 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 01:11:27,618 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 01:11:27,619 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 01:11:27,620 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 01:11:27,620 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 01:11:27,620 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-26 01:11:27,621 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 01:11:27,621 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 01:11:27,621 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 01:11:27,622 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 01:11:27,622 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 01:11:27,622 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 01:11:27,623 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-26 01:11:27,623 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 01:11:27,623 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 01:11:27,623 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 01:11:27,624 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 01:11:27,624 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 01:11:27,624 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 01:11:27,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 01:11:27,625 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 01:11:27,625 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 01:11:27,626 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 01:11:27,626 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 01:11:27,626 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 01:11:27,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 01:11:27,627 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 01:11:27,627 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 01:11:27,627 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_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/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_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur 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-26 01:11:27,952 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 01:11:27,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 01:11:27,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 01:11:27,986 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 01:11:27,987 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 01:11:27,989 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i [2022-11-26 01:11:31,320 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 01:11:31,705 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 01:11:31,706 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i [2022-11-26 01:11:31,722 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/data/9b6b1a196/486eed601dc84eebbaac3b0ea57d561f/FLAG4ec3d322b [2022-11-26 01:11:31,739 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/data/9b6b1a196/486eed601dc84eebbaac3b0ea57d561f [2022-11-26 01:11:31,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 01:11:31,744 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 01:11:31,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 01:11:31,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 01:11:31,751 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 01:11:31,752 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 01:11:31" (1/1) ... [2022-11-26 01:11:31,753 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8892b77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:11:31, skipping insertion in model container [2022-11-26 01:11:31,753 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 01:11:31" (1/1) ... [2022-11-26 01:11:31,762 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 01:11:31,805 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 01:11:32,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 01:11:32,414 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 01:11:32,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 01:11:32,588 INFO L208 MainTranslator]: Completed translation [2022-11-26 01:11:32,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:11:32 WrapperNode [2022-11-26 01:11:32,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 01:11:32,591 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 01:11:32,591 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 01:11:32,591 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 01:11:32,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:11:32" (1/1) ... [2022-11-26 01:11:32,634 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:11:32" (1/1) ... [2022-11-26 01:11:32,681 INFO L138 Inliner]: procedures = 166, calls = 73, calls flagged for inlining = 25, calls inlined = 19, statements flattened = 125 [2022-11-26 01:11:32,682 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 01:11:32,684 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 01:11:32,685 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 01:11:32,685 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 01:11:32,697 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:11:32" (1/1) ... [2022-11-26 01:11:32,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:11:32" (1/1) ... [2022-11-26 01:11:32,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:11:32" (1/1) ... [2022-11-26 01:11:32,715 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:11:32" (1/1) ... [2022-11-26 01:11:32,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:11:32" (1/1) ... [2022-11-26 01:11:32,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:11:32" (1/1) ... [2022-11-26 01:11:32,733 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:11:32" (1/1) ... [2022-11-26 01:11:32,735 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:11:32" (1/1) ... [2022-11-26 01:11:32,739 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 01:11:32,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 01:11:32,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 01:11:32,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 01:11:32,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:11:32" (1/1) ... [2022-11-26 01:11:32,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 01:11:32,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:11:32,819 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 01:11:32,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 01:11:32,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-26 01:11:32,869 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2022-11-26 01:11:32,869 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2022-11-26 01:11:32,870 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-26 01:11:32,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-26 01:11:32,871 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2022-11-26 01:11:32,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2022-11-26 01:11:32,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-26 01:11:32,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-26 01:11:32,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 01:11:32,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-26 01:11:32,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-26 01:11:32,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-26 01:11:32,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-26 01:11:32,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 01:11:32,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 01:11:33,054 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 01:11:33,056 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 01:11:33,392 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 01:11:33,609 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 01:11:33,609 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-26 01:11:33,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:11:33 BoogieIcfgContainer [2022-11-26 01:11:33,612 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 01:11:33,614 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 01:11:33,615 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 01:11:33,619 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 01:11:33,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 01:11:31" (1/3) ... [2022-11-26 01:11:33,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5de76b4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 01:11:33, skipping insertion in model container [2022-11-26 01:11:33,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:11:32" (2/3) ... [2022-11-26 01:11:33,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5de76b4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 01:11:33, skipping insertion in model container [2022-11-26 01:11:33,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:11:33" (3/3) ... [2022-11-26 01:11:33,623 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3-1.i [2022-11-26 01:11:33,661 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 01:11:33,661 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-26 01:11:33,747 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 01:11:33,759 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;@2aea2e81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 01:11:33,759 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-26 01:11:33,765 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-26 01:11:33,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 01:11:33,799 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:11:33,800 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:11:33,800 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-26 01:11:33,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:11:33,812 INFO L85 PathProgramCache]: Analyzing trace with hash 441482866, now seen corresponding path program 1 times [2022-11-26 01:11:33,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:11:33,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415657342] [2022-11-26 01:11:33,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:11:33,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:11:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:11:34,386 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-26 01:11:34,387 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:11:34,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415657342] [2022-11-26 01:11:34,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415657342] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:11:34,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:11:34,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 01:11:34,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887971228] [2022-11-26 01:11:34,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:11:34,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:11:34,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:11:34,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:11:34,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:11:34,436 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-26 01:11:34,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:11:34,574 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2022-11-26 01:11:34,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 01:11:34,577 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-26 01:11:34,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:11:34,586 INFO L225 Difference]: With dead ends: 66 [2022-11-26 01:11:34,587 INFO L226 Difference]: Without dead ends: 42 [2022-11-26 01:11:34,590 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-26 01:11:34,594 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-26 01:11:34,596 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-26 01:11:34,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-26 01:11:34,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2022-11-26 01:11:34,641 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-26 01:11:34,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-11-26 01:11:34,645 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 9 [2022-11-26 01:11:34,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:11:34,646 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-11-26 01:11:34,646 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-26 01:11:34,647 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-11-26 01:11:34,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-26 01:11:34,650 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:11:34,650 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:11:34,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 01:11:34,651 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-26 01:11:34,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:11:34,653 INFO L85 PathProgramCache]: Analyzing trace with hash 2106414958, now seen corresponding path program 1 times [2022-11-26 01:11:34,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:11:34,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593737423] [2022-11-26 01:11:34,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:11:34,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:11:34,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:11:35,031 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-26 01:11:35,031 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:11:35,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593737423] [2022-11-26 01:11:35,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593737423] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:11:35,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:11:35,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-26 01:11:35,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041635227] [2022-11-26 01:11:35,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:11:35,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-26 01:11:35,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:11:35,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-26 01:11:35,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-26 01:11:35,036 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-26 01:11:35,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:11:35,193 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-11-26 01:11:35,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-26 01:11:35,194 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-26 01:11:35,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:11:35,197 INFO L225 Difference]: With dead ends: 54 [2022-11-26 01:11:35,198 INFO L226 Difference]: Without dead ends: 34 [2022-11-26 01:11:35,203 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-26 01:11:35,211 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-26 01:11:35,212 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-26 01:11:35,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-26 01:11:35,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-11-26 01:11:35,223 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-26 01:11:35,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-11-26 01:11:35,228 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 13 [2022-11-26 01:11:35,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:11:35,228 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-11-26 01:11:35,229 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-26 01:11:35,229 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-11-26 01:11:35,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-26 01:11:35,230 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:11:35,230 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:11:35,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 01:11:35,231 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-26 01:11:35,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:11:35,232 INFO L85 PathProgramCache]: Analyzing trace with hash 863853883, now seen corresponding path program 1 times [2022-11-26 01:11:35,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:11:35,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865622773] [2022-11-26 01:11:35,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:11:35,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:11:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:11:35,554 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-26 01:11:35,557 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:11:35,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865622773] [2022-11-26 01:11:35,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865622773] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:11:35,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:11:35,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-26 01:11:35,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044327908] [2022-11-26 01:11:35,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:11:35,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 01:11:35,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:11:35,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 01:11:35,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-26 01:11:35,567 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-26 01:11:35,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:11:35,759 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-11-26 01:11:35,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-26 01:11:35,760 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-26 01:11:35,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:11:35,764 INFO L225 Difference]: With dead ends: 59 [2022-11-26 01:11:35,765 INFO L226 Difference]: Without dead ends: 43 [2022-11-26 01:11:35,767 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-26 01:11:35,771 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-26 01:11:35,772 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-26 01:11:35,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-26 01:11:35,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2022-11-26 01:11:35,789 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-26 01:11:35,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-11-26 01:11:35,796 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 12 [2022-11-26 01:11:35,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:11:35,797 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-11-26 01:11:35,797 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-26 01:11:35,798 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-11-26 01:11:35,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-26 01:11:35,799 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:11:35,799 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:11:35,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-26 01:11:35,800 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-26 01:11:35,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:11:35,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1576126940, now seen corresponding path program 1 times [2022-11-26 01:11:35,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:11:35,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429168438] [2022-11-26 01:11:35,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:11:35,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:11:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:11:35,987 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-26 01:11:35,987 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:11:35,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429168438] [2022-11-26 01:11:35,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429168438] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:11:35,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:11:35,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-26 01:11:35,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483446450] [2022-11-26 01:11:35,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:11:35,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 01:11:35,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:11:35,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 01:11:35,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 01:11:35,990 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-26 01:11:36,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:11:36,097 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2022-11-26 01:11:36,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 01:11:36,099 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-26 01:11:36,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:11:36,099 INFO L225 Difference]: With dead ends: 55 [2022-11-26 01:11:36,100 INFO L226 Difference]: Without dead ends: 32 [2022-11-26 01:11:36,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-26 01:11:36,101 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.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:11:36,102 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.1s Time] [2022-11-26 01:11:36,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-26 01:11:36,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-11-26 01:11:36,110 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-26 01:11:36,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-11-26 01:11:36,111 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 14 [2022-11-26 01:11:36,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:11:36,112 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-11-26 01:11:36,112 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-26 01:11:36,112 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-11-26 01:11:36,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-26 01:11:36,113 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:11:36,113 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:11:36,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-26 01:11:36,114 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-26 01:11:36,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:11:36,114 INFO L85 PathProgramCache]: Analyzing trace with hash -106383637, now seen corresponding path program 1 times [2022-11-26 01:11:36,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:11:36,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070263373] [2022-11-26 01:11:36,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:11:36,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:11:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:11:36,239 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-26 01:11:36,239 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:11:36,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070263373] [2022-11-26 01:11:36,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070263373] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:11:36,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:11:36,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 01:11:36,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682399184] [2022-11-26 01:11:36,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:11:36,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:11:36,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:11:36,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:11:36,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:11:36,242 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-26 01:11:36,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:11:36,287 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2022-11-26 01:11:36,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:11:36,288 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-26 01:11:36,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:11:36,289 INFO L225 Difference]: With dead ends: 58 [2022-11-26 01:11:36,289 INFO L226 Difference]: Without dead ends: 33 [2022-11-26 01:11:36,290 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-26 01:11:36,291 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-26 01:11:36,291 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-26 01:11:36,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-26 01:11:36,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-11-26 01:11:36,300 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-26 01:11:36,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-11-26 01:11:36,301 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 17 [2022-11-26 01:11:36,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:11:36,302 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-11-26 01:11:36,302 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-26 01:11:36,302 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-11-26 01:11:36,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-26 01:11:36,303 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:11:36,303 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-26 01:11:36,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-26 01:11:36,304 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-26 01:11:36,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:11:36,304 INFO L85 PathProgramCache]: Analyzing trace with hash -2099083920, now seen corresponding path program 1 times [2022-11-26 01:11:36,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:11:36,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522532274] [2022-11-26 01:11:36,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:11:36,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:11:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:11:36,462 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-26 01:11:36,462 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:11:36,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522532274] [2022-11-26 01:11:36,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522532274] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:11:36,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804566719] [2022-11-26 01:11:36,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:11:36,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:11:36,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:11:36,468 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:11:36,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 01:11:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:11:36,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 90 conjunts are in the unsatisfiable core [2022-11-26 01:11:36,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:11:36,857 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-26 01:11:36,941 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-26 01:11:36,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:36,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:36,980 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-26 01:11:37,115 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-26 01:11:37,140 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-26 01:11:37,141 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 01:11:37,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804566719] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:11:37,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 01:11:37,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 16 [2022-11-26 01:11:37,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992619206] [2022-11-26 01:11:37,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:11:37,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 01:11:37,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:11:37,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 01:11:37,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=177, Unknown=1, NotChecked=26, Total=240 [2022-11-26 01:11:37,144 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-26 01:11:37,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:11:37,616 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-11-26 01:11:37,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-26 01:11:37,616 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-26 01:11:37,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:11:37,618 INFO L225 Difference]: With dead ends: 43 [2022-11-26 01:11:37,618 INFO L226 Difference]: Without dead ends: 42 [2022-11-26 01:11:37,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=386, Unknown=1, NotChecked=40, Total=506 [2022-11-26 01:11:37,620 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 37 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-26 01:11:37,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 145 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 235 Invalid, 0 Unknown, 45 Unchecked, 0.3s Time] [2022-11-26 01:11:37,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-26 01:11:37,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2022-11-26 01:11:37,634 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-26 01:11:37,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-11-26 01:11:37,636 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2022-11-26 01:11:37,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:11:37,637 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-11-26 01:11:37,638 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-26 01:11:37,638 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-11-26 01:11:37,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-26 01:11:37,639 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:11:37,639 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-26 01:11:37,648 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-26 01:11:37,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-26 01:11:37,846 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-26 01:11:37,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:11:37,847 INFO L85 PathProgramCache]: Analyzing trace with hash -647092000, now seen corresponding path program 1 times [2022-11-26 01:11:37,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:11:37,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517701483] [2022-11-26 01:11:37,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:11:37,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:11:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:11:38,110 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-26 01:11:38,111 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:11:38,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517701483] [2022-11-26 01:11:38,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517701483] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:11:38,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360786751] [2022-11-26 01:11:38,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:11:38,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:11:38,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:11:38,113 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:11:38,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 01:11:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:11:38,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 92 conjunts are in the unsatisfiable core [2022-11-26 01:11:38,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:11:38,306 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-26 01:11:38,444 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-26 01:11:38,509 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-26 01:11:38,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:38,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:38,560 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-26 01:11:38,668 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-26 01:11:38,695 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-26 01:11:38,696 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 01:11:38,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360786751] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:11:38,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 01:11:38,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 16 [2022-11-26 01:11:38,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988665246] [2022-11-26 01:11:38,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:11:38,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 01:11:38,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:11:38,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 01:11:38,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=177, Unknown=1, NotChecked=26, Total=240 [2022-11-26 01:11:38,699 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-26 01:11:39,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:11:39,114 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-11-26 01:11:39,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-26 01:11:39,115 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-26 01:11:39,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:11:39,119 INFO L225 Difference]: With dead ends: 38 [2022-11-26 01:11:39,119 INFO L226 Difference]: Without dead ends: 37 [2022-11-26 01:11:39,120 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-26 01:11:39,121 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 38 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 01:11:39,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 100 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 178 Invalid, 0 Unknown, 37 Unchecked, 0.2s Time] [2022-11-26 01:11:39,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-26 01:11:39,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2022-11-26 01:11:39,147 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-26 01:11:39,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-11-26 01:11:39,149 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 19 [2022-11-26 01:11:39,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:11:39,150 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-11-26 01:11:39,150 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-26 01:11:39,150 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-11-26 01:11:39,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-26 01:11:39,151 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:11:39,151 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-26 01:11:39,164 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-26 01:11:39,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-26 01:11:39,359 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-26 01:11:39,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:11:39,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1347965076, now seen corresponding path program 1 times [2022-11-26 01:11:39,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:11:39,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382337107] [2022-11-26 01:11:39,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:11:39,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:11:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:11:39,679 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-26 01:11:39,679 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:11:39,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382337107] [2022-11-26 01:11:39,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382337107] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:11:39,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:11:39,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-26 01:11:39,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939654136] [2022-11-26 01:11:39,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:11:39,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 01:11:39,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:11:39,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 01:11:39,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 01:11:39,684 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-26 01:11:39,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:11:39,786 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-11-26 01:11:39,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 01:11:39,787 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-26 01:11:39,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:11:39,788 INFO L225 Difference]: With dead ends: 43 [2022-11-26 01:11:39,789 INFO L226 Difference]: Without dead ends: 31 [2022-11-26 01:11:39,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-26 01:11:39,791 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-26 01:11:39,791 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-26 01:11:39,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-26 01:11:39,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-11-26 01:11:39,820 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-26 01:11:39,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-11-26 01:11:39,823 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 22 [2022-11-26 01:11:39,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:11:39,824 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-11-26 01:11:39,824 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-26 01:11:39,825 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-11-26 01:11:39,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-26 01:11:39,826 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:11:39,826 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-26 01:11:39,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-26 01:11:39,827 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-26 01:11:39,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:11:39,827 INFO L85 PathProgramCache]: Analyzing trace with hash 575608362, now seen corresponding path program 1 times [2022-11-26 01:11:39,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:11:39,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966262918] [2022-11-26 01:11:39,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:11:39,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:11:39,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:11:40,090 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-26 01:11:40,090 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:11:40,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966262918] [2022-11-26 01:11:40,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966262918] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:11:40,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026541217] [2022-11-26 01:11:40,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:11:40,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:11:40,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:11:40,093 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:11:40,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 01:11:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:11:40,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 148 conjunts are in the unsatisfiable core [2022-11-26 01:11:40,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:11:40,430 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-26 01:11:40,493 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-26 01:11:40,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:40,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:40,525 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-26 01:11:40,762 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:11:40,766 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:11:40,766 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-26 01:11:40,925 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-26 01:11:40,953 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-26 01:11:40,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:11:41,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026541217] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:11:41,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2059411006] [2022-11-26 01:11:41,709 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-26 01:11:41,709 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:11:41,713 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:11:41,720 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:11:41,721 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:11:41,797 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-26 01:11:41,804 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-26 01:11:41,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-26 01:11:41,967 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:11:41,982 INFO L321 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2022-11-26 01:11:41,982 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-26 01:11:42,001 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:11:42,018 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-26 01:11:42,018 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-26 01:11:42,119 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-26 01:11:42,137 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-26 01:11:42,146 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-26 01:11:42,222 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-26 01:11:42,239 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-26 01:11:42,264 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-26 01:11:42,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:42,403 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-26 01:11:42,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:42,411 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-26 01:11:42,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:42,426 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-26 01:11:42,488 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-26 01:11:42,664 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-26 01:11:42,897 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-26 01:11:42,924 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-26 01:11:42,948 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-26 01:11:43,134 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_kobject_put with input of size 39 for LOIs [2022-11-26 01:11:43,169 INFO L197 IcfgInterpreter]: Interpreting procedure LDV_INIT_LIST_HEAD with input of size 33 for LOIs [2022-11-26 01:11:43,185 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 43 for LOIs [2022-11-26 01:11:43,223 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:11:50,009 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-26 01:11:50,009 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:11:50,009 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 01:11:50,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 19] total 22 [2022-11-26 01:11:50,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164322955] [2022-11-26 01:11:50,010 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 01:11:50,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-26 01:11:50,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:11:50,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-26 01:11:50,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2648, Unknown=1, NotChecked=104, Total=2970 [2022-11-26 01:11:50,013 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-26 01:11:51,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:11:51,094 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2022-11-26 01:11:51,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-26 01:11:51,100 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-26 01:11:51,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:11:51,101 INFO L225 Difference]: With dead ends: 66 [2022-11-26 01:11:51,101 INFO L226 Difference]: Without dead ends: 41 [2022-11-26 01:11:51,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=344, Invalid=4081, Unknown=1, NotChecked=130, Total=4556 [2022-11-26 01:11:51,112 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 52 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-26 01:11:51,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 95 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 405 Invalid, 0 Unknown, 35 Unchecked, 0.4s Time] [2022-11-26 01:11:51,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-26 01:11:51,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2022-11-26 01:11:51,129 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-26 01:11:51,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2022-11-26 01:11:51,132 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 24 [2022-11-26 01:11:51,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:11:51,134 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2022-11-26 01:11:51,134 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-26 01:11:51,135 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-11-26 01:11:51,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-26 01:11:51,138 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:11:51,138 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-26 01:11:51,151 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-26 01:11:51,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-26 01:11:51,346 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-26 01:11:51,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:11:51,346 INFO L85 PathProgramCache]: Analyzing trace with hash -2136135414, now seen corresponding path program 1 times [2022-11-26 01:11:51,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:11:51,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174011440] [2022-11-26 01:11:51,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:11:51,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:11:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:11:51,543 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-26 01:11:51,543 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:11:51,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174011440] [2022-11-26 01:11:51,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174011440] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:11:51,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502361949] [2022-11-26 01:11:51,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:11:51,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:11:51,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:11:51,546 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:11:51,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-26 01:11:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:11:51,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 106 conjunts are in the unsatisfiable core [2022-11-26 01:11:51,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:11:51,824 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-26 01:11:51,910 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-26 01:11:51,940 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-26 01:11:51,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:11:52,078 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-26 01:11:52,128 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-26 01:11:52,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502361949] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-26 01:11:52,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-26 01:11:52,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5, 10] total 18 [2022-11-26 01:11:52,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295834889] [2022-11-26 01:11:52,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:11:52,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-26 01:11:52,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:11:52,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-26 01:11:52,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2022-11-26 01:11:52,131 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-26 01:11:52,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:11:52,451 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2022-11-26 01:11:52,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-26 01:11:52,452 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-26 01:11:52,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:11:52,452 INFO L225 Difference]: With dead ends: 48 [2022-11-26 01:11:52,452 INFO L226 Difference]: Without dead ends: 43 [2022-11-26 01:11:52,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2022-11-26 01:11:52,454 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.2s IncrementalHoareTripleChecker+Time [2022-11-26 01:11:52,454 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.2s Time] [2022-11-26 01:11:52,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-26 01:11:52,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-11-26 01:11:52,462 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-26 01:11:52,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2022-11-26 01:11:52,463 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 26 [2022-11-26 01:11:52,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:11:52,463 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2022-11-26 01:11:52,463 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-26 01:11:52,463 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2022-11-26 01:11:52,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-26 01:11:52,465 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:11:52,465 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-26 01:11:52,481 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-26 01:11:52,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-26 01:11:52,673 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-26 01:11:52,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:11:52,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1451732896, now seen corresponding path program 1 times [2022-11-26 01:11:52,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:11:52,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523536793] [2022-11-26 01:11:52,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:11:52,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:11:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:11:52,986 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-26 01:11:52,986 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:11:52,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523536793] [2022-11-26 01:11:52,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523536793] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:11:52,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:11:52,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-26 01:11:52,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693298398] [2022-11-26 01:11:52,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:11:52,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-26 01:11:52,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:11:52,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-26 01:11:52,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-26 01:11:52,990 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-26 01:11:53,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:11:53,159 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-11-26 01:11:53,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-26 01:11:53,160 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-26 01:11:53,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:11:53,161 INFO L225 Difference]: With dead ends: 45 [2022-11-26 01:11:53,161 INFO L226 Difference]: Without dead ends: 36 [2022-11-26 01:11:53,161 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-26 01:11:53,162 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-26 01:11:53,162 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-26 01:11:53,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-26 01:11:53,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-11-26 01:11:53,171 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-26 01:11:53,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2022-11-26 01:11:53,171 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 32 [2022-11-26 01:11:53,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:11:53,172 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2022-11-26 01:11:53,172 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-26 01:11:53,172 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-11-26 01:11:53,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-26 01:11:53,173 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:11:53,173 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-26 01:11:53,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-26 01:11:53,174 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-26 01:11:53,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:11:53,174 INFO L85 PathProgramCache]: Analyzing trace with hash 602302323, now seen corresponding path program 1 times [2022-11-26 01:11:53,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:11:53,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492983770] [2022-11-26 01:11:53,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:11:53,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:11:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:11:53,451 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-26 01:11:53,451 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:11:53,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492983770] [2022-11-26 01:11:53,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492983770] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:11:53,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074988169] [2022-11-26 01:11:53,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:11:53,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:11:53,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:11:53,456 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:11:53,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-26 01:11:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:11:53,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 202 conjunts are in the unsatisfiable core [2022-11-26 01:11:53,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:11:53,849 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-26 01:11:53,916 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-26 01:11:53,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:53,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:53,936 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-26 01:11:54,131 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:11:54,134 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:11:54,135 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-26 01:11:54,461 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-26 01:11:54,482 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:11:54,485 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:11:54,485 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-26 01:11:54,600 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-26 01:11:54,629 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-26 01:11:54,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:11:55,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074988169] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:11:55,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [319269963] [2022-11-26 01:11:55,156 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-26 01:11:55,156 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:11:55,157 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:11:55,157 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:11:55,157 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:11:55,194 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-26 01:11:55,199 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-26 01:11:55,296 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:11:55,310 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-26 01:11:55,311 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-26 01:11:55,327 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:11:55,338 INFO L321 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2022-11-26 01:11:55,339 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-26 01:11:55,384 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-26 01:11:55,421 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-26 01:11:55,437 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-26 01:11:55,445 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-26 01:11:55,507 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-26 01:11:55,525 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-26 01:11:55,535 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-26 01:11:55,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:55,671 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-26 01:11:55,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:55,677 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-26 01:11:55,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:55,692 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-26 01:11:55,752 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-26 01:11:55,892 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-26 01:11:56,027 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-26 01:11:56,041 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-26 01:11:56,058 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-26 01:11:56,184 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-26 01:11:56,208 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-26 01:11:56,243 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:11:56,243 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-26 01:11:56,276 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-26 01:11:56,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-11-26 01:11:56,529 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-26 01:11:56,708 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-26 01:11:57,127 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_kobject_put with input of size 51 for LOIs [2022-11-26 01:11:57,554 INFO L197 IcfgInterpreter]: Interpreting procedure LDV_INIT_LIST_HEAD with input of size 33 for LOIs [2022-11-26 01:11:57,567 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 43 for LOIs [2022-11-26 01:11:57,593 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:12:05,241 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-26 01:12:05,241 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:12:05,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 01:12:05,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 25] total 29 [2022-11-26 01:12:05,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729760902] [2022-11-26 01:12:05,242 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 01:12:05,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-26 01:12:05,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:12:05,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-26 01:12:05,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=2957, Unknown=2, NotChecked=222, Total=3422 [2022-11-26 01:12:05,245 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-26 01:12:06,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:12:06,174 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2022-11-26 01:12:06,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-26 01:12:06,175 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-26 01:12:06,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:12:06,176 INFO L225 Difference]: With dead ends: 63 [2022-11-26 01:12:06,176 INFO L226 Difference]: Without dead ends: 36 [2022-11-26 01:12:06,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1246 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=352, Invalid=4346, Unknown=2, NotChecked=270, Total=4970 [2022-11-26 01:12:06,179 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 38 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-26 01:12:06,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 50 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 350 Invalid, 0 Unknown, 71 Unchecked, 0.3s Time] [2022-11-26 01:12:06,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-26 01:12:06,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-11-26 01:12:06,190 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-26 01:12:06,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2022-11-26 01:12:06,191 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2022-11-26 01:12:06,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:12:06,191 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2022-11-26 01:12:06,191 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-26 01:12:06,191 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-11-26 01:12:06,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-26 01:12:06,195 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:12:06,196 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-26 01:12:06,208 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-26 01:12:06,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-26 01:12:06,403 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-26 01:12:06,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:12:06,403 INFO L85 PathProgramCache]: Analyzing trace with hash -863177865, now seen corresponding path program 1 times [2022-11-26 01:12:06,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:12:06,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694294455] [2022-11-26 01:12:06,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:12:06,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:12:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:12:06,781 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-26 01:12:06,781 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:12:06,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694294455] [2022-11-26 01:12:06,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694294455] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:12:06,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606454507] [2022-11-26 01:12:06,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:12:06,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:12:06,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:12:06,788 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:12:06,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-26 01:12:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:12:07,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 202 conjunts are in the unsatisfiable core [2022-11-26 01:12:07,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:12:07,174 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-26 01:12:07,229 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-26 01:12:07,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:07,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:07,245 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-26 01:12:07,425 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:12:07,428 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:12:07,429 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-26 01:12:07,704 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-26 01:12:07,837 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-26 01:12:07,881 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-26 01:12:07,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:12:08,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606454507] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:12:08,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [656224882] [2022-11-26 01:12:08,409 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-26 01:12:08,409 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:12:08,410 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:12:08,410 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:12:08,410 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:12:08,442 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-26 01:12:08,447 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-26 01:12:08,538 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:12:08,553 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-26 01:12:08,554 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-26 01:12:08,567 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:12:08,579 INFO L321 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2022-11-26 01:12:08,579 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-26 01:12:08,610 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-26 01:12:08,644 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-26 01:12:08,659 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-26 01:12:08,669 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-26 01:12:08,756 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-26 01:12:08,767 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-26 01:12:08,781 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-26 01:12:08,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:08,875 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-26 01:12:08,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:08,882 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-26 01:12:08,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:08,889 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-26 01:12:08,924 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-26 01:12:09,081 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-26 01:12:09,231 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-26 01:12:09,248 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-26 01:12:09,266 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-26 01:12:09,414 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:12:09,415 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-26 01:12:09,435 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-26 01:12:09,462 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-26 01:12:09,487 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-26 01:12:09,509 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-26 01:12:09,673 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-26 01:12:09,878 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-26 01:12:10,176 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_kobject_put with input of size 51 for LOIs [2022-11-26 01:12:10,557 INFO L197 IcfgInterpreter]: Interpreting procedure LDV_INIT_LIST_HEAD with input of size 33 for LOIs [2022-11-26 01:12:10,570 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 43 for LOIs [2022-11-26 01:12:10,598 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:12:18,761 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-26 01:12:18,761 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:12:18,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 01:12:18,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 24] total 29 [2022-11-26 01:12:18,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341250649] [2022-11-26 01:12:18,761 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 01:12:18,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-26 01:12:18,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:12:18,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-26 01:12:18,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=3070, Unknown=1, NotChecked=112, Total=3422 [2022-11-26 01:12:18,764 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-26 01:12:20,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:12:20,172 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2022-11-26 01:12:20,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-26 01:12:20,172 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-26 01:12:20,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:12:20,173 INFO L225 Difference]: With dead ends: 62 [2022-11-26 01:12:20,173 INFO L226 Difference]: Without dead ends: 0 [2022-11-26 01:12:20,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1282 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=373, Invalid=4886, Unknown=1, NotChecked=142, Total=5402 [2022-11-26 01:12:20,176 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 31 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-26 01:12:20,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 88 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 539 Invalid, 0 Unknown, 31 Unchecked, 0.5s Time] [2022-11-26 01:12:20,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-26 01:12:20,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-26 01:12:20,177 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-26 01:12:20,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-26 01:12:20,178 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2022-11-26 01:12:20,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:12:20,178 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-26 01:12:20,178 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-26 01:12:20,179 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-26 01:12:20,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-26 01:12:20,182 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-11-26 01:12:20,182 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-11-26 01:12:20,183 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-11-26 01:12:20,183 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-11-26 01:12:20,192 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-26 01:12:20,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:12:20,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-26 01:12:21,856 INFO L902 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 525 531) the Hoare annotation is: true [2022-11-26 01:12:21,856 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 525 531) no Hoare annotation was computed. [2022-11-26 01:12:21,856 INFO L899 garLoopResultBuilder]: For program point L659(line 659) no Hoare annotation was computed. [2022-11-26 01:12:21,857 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-26 01:12:21,857 INFO L899 garLoopResultBuilder]: For program point L717(lines 717 718) no Hoare annotation was computed. [2022-11-26 01:12:21,857 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-26 01:12:21,857 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-26 01:12:21,860 INFO L899 garLoopResultBuilder]: For program point L742(lines 742 743) no Hoare annotation was computed. [2022-11-26 01:12:21,860 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 659) no Hoare annotation was computed. [2022-11-26 01:12:21,860 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-26 01:12:21,860 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-26 01:12:21,860 INFO L899 garLoopResultBuilder]: For program point L730(lines 730 732) no Hoare annotation was computed. [2022-11-26 01:12:21,861 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-26 01:12:21,861 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-26 01:12:21,861 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 659) no Hoare annotation was computed. [2022-11-26 01:12:21,861 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-26 01:12:21,862 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-26 01:12:21,862 INFO L899 garLoopResultBuilder]: For program point L768-1(lines 763 769) no Hoare annotation was computed. [2022-11-26 01:12:21,862 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-26 01:12:21,862 INFO L899 garLoopResultBuilder]: For program point L723(lines 723 724) no Hoare annotation was computed. [2022-11-26 01:12:21,863 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-26 01:12:21,863 INFO L899 garLoopResultBuilder]: For program point L761-1(lines 760 762) no Hoare annotation was computed. [2022-11-26 01:12:21,864 INFO L902 garLoopResultBuilder]: At program point L741(line 741) the Hoare annotation is: true [2022-11-26 01:12:21,864 INFO L899 garLoopResultBuilder]: For program point L741-1(line 741) no Hoare annotation was computed. [2022-11-26 01:12:21,865 INFO L895 garLoopResultBuilder]: At program point LDV_INIT_LIST_HEADENTRY(lines 538 542) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-11-26 01:12:21,865 INFO L899 garLoopResultBuilder]: For program point LDV_INIT_LIST_HEADEXIT(lines 538 542) no Hoare annotation was computed. [2022-11-26 01:12:21,865 INFO L899 garLoopResultBuilder]: For program point L667(line 667) no Hoare annotation was computed. [2022-11-26 01:12:21,868 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-26 01:12:21,869 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 667) no Hoare annotation was computed. [2022-11-26 01:12:21,874 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-26 01:12:21,874 INFO L899 garLoopResultBuilder]: For program point L711(lines 711 713) no Hoare annotation was computed. [2022-11-26 01:12:21,874 INFO L899 garLoopResultBuilder]: For program point L711-2(lines 709 714) no Hoare annotation was computed. [2022-11-26 01:12:21,874 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putEXIT(lines 709 714) no Hoare annotation was computed. [2022-11-26 01:12:21,875 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 667) no Hoare annotation was computed. [2022-11-26 01:12:21,879 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:12:21,883 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-26 01:12:21,913 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_569,QUANTIFIED] [2022-11-26 01:12:21,914 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_569,QUANTIFIED] [2022-11-26 01:12:21,924 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_569,QUANTIFIED] [2022-11-26 01:12:21,924 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_569,QUANTIFIED] [2022-11-26 01:12:21,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 01:12:21 BoogieIcfgContainer [2022-11-26 01:12:21,951 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-26 01:12:21,951 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-26 01:12:21,952 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-26 01:12:21,952 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-26 01:12:21,952 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:11:33" (3/4) ... [2022-11-26 01:12:21,956 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-26 01:12:21,962 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-11-26 01:12:21,963 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2022-11-26 01:12:21,963 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2022-11-26 01:12:21,972 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 49 nodes and edges [2022-11-26 01:12:21,974 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2022-11-26 01:12:21,974 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-26 01:12:22,011 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-26 01:12:22,013 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-26 01:12:22,015 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-26 01:12:22,017 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(kobj == 0) || !(1 <= \old(unknown-#memory_int-unknown)[kobj][12])) || ((((((((v == kobj + 12 && kobj == kobj) && unknown-#memory_int-unknown[v][v] <= temp) && temp <= 2147483647) && i <= 1) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && v == kobj) && kobj == 0) && 1 <= i)) || (forall v_ArrVal_569 : int :: !(v_ArrVal_569 == \old(unknown-#memory_int-unknown)[kobj][kobj + 12]) || !(v_ArrVal_569 <= 2147483647))) && (!(kobj == 0) || !(kobj == 0)) [2022-11-26 01:12:22,045 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-26 01:12:22,045 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-26 01:12:22,047 INFO L158 Benchmark]: Toolchain (without parser) took 50301.84ms. Allocated memory was 192.9MB in the beginning and 406.8MB in the end (delta: 213.9MB). Free memory was 159.6MB in the beginning and 247.9MB in the end (delta: -88.3MB). Peak memory consumption was 126.9MB. Max. memory is 16.1GB. [2022-11-26 01:12:22,047 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 142.6MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 01:12:22,048 INFO L158 Benchmark]: CACSL2BoogieTranslator took 843.78ms. Allocated memory is still 192.9MB. Free memory was 159.0MB in the beginning and 137.9MB in the end (delta: 21.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-26 01:12:22,049 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.16ms. Allocated memory is still 192.9MB. Free memory was 137.9MB in the beginning and 135.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-26 01:12:22,049 INFO L158 Benchmark]: Boogie Preprocessor took 55.61ms. Allocated memory is still 192.9MB. Free memory was 135.2MB in the beginning and 133.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 01:12:22,049 INFO L158 Benchmark]: RCFGBuilder took 861.75ms. Allocated memory is still 192.9MB. Free memory was 133.1MB in the beginning and 105.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-26 01:12:22,050 INFO L158 Benchmark]: TraceAbstraction took 48336.30ms. Allocated memory was 192.9MB in the beginning and 406.8MB in the end (delta: 213.9MB). Free memory was 105.2MB in the beginning and 252.1MB in the end (delta: -146.9MB). Peak memory consumption was 189.8MB. Max. memory is 16.1GB. [2022-11-26 01:12:22,050 INFO L158 Benchmark]: Witness Printer took 93.87ms. Allocated memory is still 406.8MB. Free memory was 252.1MB in the beginning and 247.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-26 01:12:22,052 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.25ms. Allocated memory is still 142.6MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 843.78ms. Allocated memory is still 192.9MB. Free memory was 159.0MB in the beginning and 137.9MB in the end (delta: 21.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.16ms. Allocated memory is still 192.9MB. Free memory was 137.9MB in the beginning and 135.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.61ms. Allocated memory is still 192.9MB. Free memory was 135.2MB in the beginning and 133.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 861.75ms. Allocated memory is still 192.9MB. Free memory was 133.1MB in the beginning and 105.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 48336.30ms. Allocated memory was 192.9MB in the beginning and 406.8MB in the end (delta: 213.9MB). Free memory was 105.2MB in the beginning and 252.1MB in the end (delta: -146.9MB). Peak memory consumption was 189.8MB. Max. memory is 16.1GB. * Witness Printer took 93.87ms. Allocated memory is still 406.8MB. Free memory was 252.1MB in the beginning and 247.9MB 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: 48.2s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 363 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 357 mSDsluCounter, 1234 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 219 IncrementalHoareTripleChecker+Unchecked, 982 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2152 IncrementalHoareTripleChecker+Invalid, 2474 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 252 mSDtfsCounter, 2152 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 433 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 310 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 3742 ImplicationChecksByTransitivity, 28.5s 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.2s 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.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.6s 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-26 01:12:22,082 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_569,QUANTIFIED] [2022-11-26 01:12:22,082 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_569,QUANTIFIED] [2022-11-26 01:12:22,083 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_569,QUANTIFIED] [2022-11-26 01:12:22,083 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_569,QUANTIFIED] Derived loop invariant: (((!(kobj == 0) || !(1 <= \old(unknown-#memory_int-unknown)[kobj][12])) || ((((((((v == kobj + 12 && kobj == kobj) && unknown-#memory_int-unknown[v][v] <= temp) && temp <= 2147483647) && i <= 1) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && v == kobj) && kobj == 0) && 1 <= i)) || (forall v_ArrVal_569 : int :: !(v_ArrVal_569 == \old(unknown-#memory_int-unknown)[kobj][kobj + 12]) || !(v_ArrVal_569 <= 2147483647))) && (!(kobj == 0) || !(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-26 01:12:22,119 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cad7ce7-c92b-4ce0-95ec-71dab932c611/bin/utaipan-ByfvJB40ur/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