./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6b4ec56b 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_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9 --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 beb004be26a355c223f1a45515f5377c37b18fc46f09e77727f89b964ae9789d --- 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-6b4ec56 [2022-11-20 20:16:35,766 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 20:16:35,768 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 20:16:35,808 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 20:16:35,809 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 20:16:35,813 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 20:16:35,816 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 20:16:35,819 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 20:16:35,822 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 20:16:35,827 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 20:16:35,828 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 20:16:35,830 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 20:16:35,831 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 20:16:35,833 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 20:16:35,836 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 20:16:35,840 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 20:16:35,841 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 20:16:35,842 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 20:16:35,844 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 20:16:35,851 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 20:16:35,852 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 20:16:35,855 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 20:16:35,856 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 20:16:35,857 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 20:16:35,866 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 20:16:35,868 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 20:16:35,868 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 20:16:35,870 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 20:16:35,871 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 20:16:35,872 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 20:16:35,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 20:16:35,873 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 20:16:35,875 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 20:16:35,876 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 20:16:35,878 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 20:16:35,879 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 20:16:35,880 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 20:16:35,880 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 20:16:35,881 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 20:16:35,882 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 20:16:35,882 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 20:16:35,883 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-20 20:16:35,921 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 20:16:35,922 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 20:16:35,922 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 20:16:35,923 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 20:16:35,924 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 20:16:35,924 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 20:16:35,924 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 20:16:35,925 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 20:16:35,925 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 20:16:35,925 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-20 20:16:35,927 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 20:16:35,927 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 20:16:35,927 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-20 20:16:35,928 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-20 20:16:35,928 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 20:16:35,928 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-20 20:16:35,929 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-20 20:16:35,929 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-20 20:16:35,930 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 20:16:35,930 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 20:16:35,930 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 20:16:35,931 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 20:16:35,931 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 20:16:35,931 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 20:16:35,931 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 20:16:35,932 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 20:16:35,933 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 20:16:35,933 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-20 20:16:35,933 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 20:16:35,934 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 20:16:35,934 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 20:16:35,934 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 20:16:35,935 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 20:16:35,935 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 20:16:35,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:16:35,936 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 20:16:35,936 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-20 20:16:35,936 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 20:16:35,936 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 20:16:35,937 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-20 20:16:35,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 20:16:35,937 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 20:16:35,938 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 20:16:35,938 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_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/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_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9 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 -> beb004be26a355c223f1a45515f5377c37b18fc46f09e77727f89b964ae9789d [2022-11-20 20:16:36,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 20:16:36,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 20:16:36,256 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 20:16:36,258 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 20:16:36,258 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 20:16:36,260 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i [2022-11-20 20:16:39,345 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 20:16:39,618 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 20:16:39,618 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i [2022-11-20 20:16:39,631 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/data/683752d32/95d88b8f503e4b84883601287d335733/FLAG064c55832 [2022-11-20 20:16:39,650 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/data/683752d32/95d88b8f503e4b84883601287d335733 [2022-11-20 20:16:39,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 20:16:39,656 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 20:16:39,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 20:16:39,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 20:16:39,664 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 20:16:39,664 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:16:39" (1/1) ... [2022-11-20 20:16:39,666 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@568adbef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:16:39, skipping insertion in model container [2022-11-20 20:16:39,666 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:16:39" (1/1) ... [2022-11-20 20:16:39,674 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 20:16:39,734 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 20:16:40,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:16:40,180 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 20:16:40,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:16:40,262 INFO L208 MainTranslator]: Completed translation [2022-11-20 20:16:40,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:16:40 WrapperNode [2022-11-20 20:16:40,263 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 20:16:40,264 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 20:16:40,264 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 20:16:40,264 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 20:16:40,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:16:40" (1/1) ... [2022-11-20 20:16:40,289 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:16:40" (1/1) ... [2022-11-20 20:16:40,315 INFO L138 Inliner]: procedures = 164, calls = 71, calls flagged for inlining = 23, calls inlined = 17, statements flattened = 121 [2022-11-20 20:16:40,316 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 20:16:40,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 20:16:40,317 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 20:16:40,317 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 20:16:40,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:16:40" (1/1) ... [2022-11-20 20:16:40,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:16:40" (1/1) ... [2022-11-20 20:16:40,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:16:40" (1/1) ... [2022-11-20 20:16:40,331 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:16:40" (1/1) ... [2022-11-20 20:16:40,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:16:40" (1/1) ... [2022-11-20 20:16:40,343 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:16:40" (1/1) ... [2022-11-20 20:16:40,345 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:16:40" (1/1) ... [2022-11-20 20:16:40,346 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:16:40" (1/1) ... [2022-11-20 20:16:40,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 20:16:40,350 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 20:16:40,350 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 20:16:40,351 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 20:16:40,351 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:16:40" (1/1) ... [2022-11-20 20:16:40,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:16:40,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:16:40,385 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 20:16:40,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 20:16:40,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 20:16:40,445 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2022-11-20 20:16:40,445 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2022-11-20 20:16:40,445 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-20 20:16:40,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-20 20:16:40,446 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2022-11-20 20:16:40,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2022-11-20 20:16:40,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 20:16:40,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 20:16:40,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 20:16:40,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 20:16:40,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 20:16:40,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 20:16:40,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-20 20:16:40,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 20:16:40,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 20:16:40,661 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 20:16:40,663 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 20:16:41,038 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 20:16:41,109 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 20:16:41,109 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 20:16:41,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:16:41 BoogieIcfgContainer [2022-11-20 20:16:41,112 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 20:16:41,114 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 20:16:41,115 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 20:16:41,118 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 20:16:41,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:16:39" (1/3) ... [2022-11-20 20:16:41,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@276dc2f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:16:41, skipping insertion in model container [2022-11-20 20:16:41,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:16:40" (2/3) ... [2022-11-20 20:16:41,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@276dc2f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:16:41, skipping insertion in model container [2022-11-20 20:16:41,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:16:41" (3/3) ... [2022-11-20 20:16:41,121 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2-2.i [2022-11-20 20:16:41,139 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 20:16:41,140 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-20 20:16:41,187 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 20:16:41,194 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;@592aa307, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 20:16:41,194 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-20 20:16:41,198 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 26 states have internal predecessors, (31), 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-20 20:16:41,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 20:16:41,206 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:16:41,207 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:16:41,207 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-20 20:16:41,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:16:41,213 INFO L85 PathProgramCache]: Analyzing trace with hash 442991665, now seen corresponding path program 1 times [2022-11-20 20:16:41,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:16:41,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023950552] [2022-11-20 20:16:41,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:16:41,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:16:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:16:41,601 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-20 20:16:41,602 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:16:41,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023950552] [2022-11-20 20:16:41,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023950552] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:16:41,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:16:41,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:16:41,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926794680] [2022-11-20 20:16:41,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:16:41,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:16:41,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:16:41,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:16:41,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:16:41,643 INFO L87 Difference]: Start difference. First operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 26 states have internal predecessors, (31), 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-20 20:16:41,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:16:41,778 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2022-11-20 20:16:41,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:16:41,782 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-20 20:16:41,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:16:41,791 INFO L225 Difference]: With dead ends: 62 [2022-11-20 20:16:41,791 INFO L226 Difference]: Without dead ends: 39 [2022-11-20 20:16:41,794 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-20 20:16:41,801 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 9 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:16:41,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 88 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:16:41,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-20 20:16:41,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2022-11-20 20:16:41,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 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, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 20:16:41,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-11-20 20:16:41,852 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 9 [2022-11-20 20:16:41,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:16:41,852 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-11-20 20:16:41,853 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-20 20:16:41,853 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-11-20 20:16:41,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 20:16:41,856 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:16:41,856 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:16:41,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 20:16:41,857 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-20 20:16:41,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:16:41,858 INFO L85 PathProgramCache]: Analyzing trace with hash -358829788, now seen corresponding path program 1 times [2022-11-20 20:16:41,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:16:41,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545939112] [2022-11-20 20:16:41,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:16:41,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:16:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:16:42,104 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-20 20:16:42,104 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:16:42,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545939112] [2022-11-20 20:16:42,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545939112] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:16:42,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:16:42,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 20:16:42,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682608369] [2022-11-20 20:16:42,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:16:42,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 20:16:42,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:16:42,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 20:16:42,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:16:42,113 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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-20 20:16:42,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:16:42,280 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-11-20 20:16:42,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 20:16:42,281 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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-20 20:16:42,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:16:42,283 INFO L225 Difference]: With dead ends: 51 [2022-11-20 20:16:42,283 INFO L226 Difference]: Without dead ends: 33 [2022-11-20 20:16:42,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-20 20:16:42,289 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 9 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:16:42,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 120 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:16:42,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-20 20:16:42,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2022-11-20 20:16:42,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.45) internal successors, (29), 25 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-20 20:16:42,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-11-20 20:16:42,304 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 13 [2022-11-20 20:16:42,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:16:42,305 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-11-20 20:16:42,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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-20 20:16:42,306 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-11-20 20:16:42,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 20:16:42,307 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:16:42,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:16:42,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 20:16:42,308 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-20 20:16:42,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:16:42,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1546671968, now seen corresponding path program 1 times [2022-11-20 20:16:42,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:16:42,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798155018] [2022-11-20 20:16:42,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:16:42,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:16:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:16:42,590 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-20 20:16:42,591 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:16:42,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798155018] [2022-11-20 20:16:42,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798155018] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:16:42,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:16:42,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 20:16:42,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231734512] [2022-11-20 20:16:42,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:16:42,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 20:16:42,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:16:42,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 20:16:42,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:16:42,599 INFO L87 Difference]: Start difference. First operand 31 states and 36 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-20 20:16:42,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:16:42,767 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-11-20 20:16:42,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 20:16:42,768 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-20 20:16:42,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:16:42,771 INFO L225 Difference]: With dead ends: 55 [2022-11-20 20:16:42,771 INFO L226 Difference]: Without dead ends: 40 [2022-11-20 20:16:42,774 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-20 20:16:42,776 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 29 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 106 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-20 20:16:42,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 106 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:16:42,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-20 20:16:42,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2022-11-20 20:16:42,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.391304347826087) internal successors, (32), 28 states have internal predecessors, (32), 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-20 20:16:42,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2022-11-20 20:16:42,796 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 12 [2022-11-20 20:16:42,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:16:42,796 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2022-11-20 20:16:42,796 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-20 20:16:42,796 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-11-20 20:16:42,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 20:16:42,797 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:16:42,798 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:16:42,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 20:16:42,798 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-20 20:16:42,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:16:42,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1190870089, now seen corresponding path program 1 times [2022-11-20 20:16:42,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:16:42,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429592069] [2022-11-20 20:16:42,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:16:42,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:16:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:16:42,964 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-20 20:16:42,964 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:16:42,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429592069] [2022-11-20 20:16:42,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429592069] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:16:42,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:16:42,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 20:16:42,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892159886] [2022-11-20 20:16:42,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:16:42,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 20:16:42,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:16:42,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 20:16:42,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:16:42,971 INFO L87 Difference]: Start difference. First operand 34 states and 39 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-20 20:16:43,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:16:43,081 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2022-11-20 20:16:43,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:16:43,082 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-20 20:16:43,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:16:43,082 INFO L225 Difference]: With dead ends: 53 [2022-11-20 20:16:43,082 INFO L226 Difference]: Without dead ends: 31 [2022-11-20 20:16:43,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-20 20:16:43,084 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 37 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 63 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-20 20:16:43,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 63 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:16:43,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-20 20:16:43,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-11-20 20:16:43,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.35) 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-20 20:16:43,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-11-20 20:16:43,091 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 14 [2022-11-20 20:16:43,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:16:43,091 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-11-20 20:16:43,091 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-20 20:16:43,091 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-11-20 20:16:43,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 20:16:43,092 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:16:43,092 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:16:43,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 20:16:43,093 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-20 20:16:43,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:16:43,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1803696027, now seen corresponding path program 1 times [2022-11-20 20:16:43,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:16:43,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003447226] [2022-11-20 20:16:43,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:16:43,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:16:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:16:43,262 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-20 20:16:43,263 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:16:43,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003447226] [2022-11-20 20:16:43,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003447226] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:16:43,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:16:43,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:16:43,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090230398] [2022-11-20 20:16:43,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:16:43,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:16:43,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:16:43,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:16:43,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:16:43,269 INFO L87 Difference]: Start difference. First operand 31 states and 34 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-20 20:16:43,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:16:43,322 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-11-20 20:16:43,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:16:43,323 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-20 20:16:43,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:16:43,326 INFO L225 Difference]: With dead ends: 56 [2022-11-20 20:16:43,326 INFO L226 Difference]: Without dead ends: 32 [2022-11-20 20:16:43,332 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-20 20:16:43,333 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 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-20 20:16:43,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 20:16:43,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-20 20:16:43,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-11-20 20:16:43,345 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-20 20:16:43,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-11-20 20:16:43,347 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 17 [2022-11-20 20:16:43,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:16:43,348 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-11-20 20:16:43,348 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-20 20:16:43,348 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-11-20 20:16:43,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 20:16:43,349 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:16:43,349 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-20 20:16:43,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 20:16:43,350 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-20 20:16:43,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:16:43,351 INFO L85 PathProgramCache]: Analyzing trace with hash 187744588, now seen corresponding path program 1 times [2022-11-20 20:16:43,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:16:43,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545945519] [2022-11-20 20:16:43,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:16:43,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:16:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:16:43,578 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-20 20:16:43,579 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:16:43,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545945519] [2022-11-20 20:16:43,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545945519] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:16:43,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765122917] [2022-11-20 20:16:43,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:16:43,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:16:43,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:16:43,587 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:16:43,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 20:16:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:16:43,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 82 conjunts are in the unsatisfiable core [2022-11-20 20:16:43,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:16:43,945 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-20 20:16:44,019 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-20 20:16:44,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:44,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:44,066 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-20 20:16:44,171 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-20 20:16:44,194 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-20 20:16:44,194 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:16:44,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765122917] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:16:44,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 20:16:44,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 16 [2022-11-20 20:16:44,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396826800] [2022-11-20 20:16:44,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:16:44,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 20:16:44,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:16:44,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 20:16:44,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=177, Unknown=1, NotChecked=26, Total=240 [2022-11-20 20:16:44,199 INFO L87 Difference]: Start difference. First operand 32 states and 35 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-20 20:16:44,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:16:44,528 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-11-20 20:16:44,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 20:16:44,529 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-20 20:16:44,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:16:44,529 INFO L225 Difference]: With dead ends: 37 [2022-11-20 20:16:44,529 INFO L226 Difference]: Without dead ends: 36 [2022-11-20 20:16:44,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 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-20 20:16:44,531 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 44 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:16:44,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 82 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 192 Invalid, 0 Unknown, 33 Unchecked, 0.2s Time] [2022-11-20 20:16:44,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-20 20:16:44,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2022-11-20 20:16:44,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.2857142857142858) 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-20 20:16:44,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-11-20 20:16:44,540 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 18 [2022-11-20 20:16:44,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:16:44,540 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-11-20 20:16:44,541 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-20 20:16:44,541 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-11-20 20:16:44,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 20:16:44,541 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:16:44,542 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-20 20:16:44,553 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 20:16:44,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:16:44,748 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-20 20:16:44,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:16:44,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1525115012, now seen corresponding path program 1 times [2022-11-20 20:16:44,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:16:44,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444200917] [2022-11-20 20:16:44,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:16:44,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:16:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:16:44,916 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-20 20:16:44,916 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:16:44,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444200917] [2022-11-20 20:16:44,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444200917] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:16:44,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543709633] [2022-11-20 20:16:44,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:16:44,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:16:44,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:16:44,918 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:16:44,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 20:16:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:16:45,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 84 conjunts are in the unsatisfiable core [2022-11-20 20:16:45,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:16:45,083 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-20 20:16:45,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:16:45,232 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-20 20:16:45,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:45,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:45,257 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-20 20:16:45,335 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-20 20:16:45,358 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-20 20:16:45,358 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:16:45,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543709633] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:16:45,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 20:16:45,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 16 [2022-11-20 20:16:45,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36670849] [2022-11-20 20:16:45,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:16:45,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 20:16:45,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:16:45,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 20:16:45,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=177, Unknown=1, NotChecked=26, Total=240 [2022-11-20 20:16:45,361 INFO L87 Difference]: Start difference. First operand 31 states and 34 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-20 20:16:45,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:16:45,716 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-11-20 20:16:45,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 20:16:45,716 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-20 20:16:45,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:16:45,717 INFO L225 Difference]: With dead ends: 38 [2022-11-20 20:16:45,717 INFO L226 Difference]: Without dead ends: 37 [2022-11-20 20:16:45,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=386, Unknown=1, NotChecked=40, Total=506 [2022-11-20 20:16:45,718 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 37 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:16:45,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 98 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 184 Invalid, 0 Unknown, 39 Unchecked, 0.2s Time] [2022-11-20 20:16:45,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-20 20:16:45,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2022-11-20 20:16:45,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 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-20 20:16:45,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-11-20 20:16:45,728 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 19 [2022-11-20 20:16:45,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:16:45,728 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-11-20 20:16:45,728 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-20 20:16:45,729 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-11-20 20:16:45,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 20:16:45,729 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:16:45,729 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-20 20:16:45,740 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 20:16:45,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:16:45,935 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-20 20:16:45,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:16:45,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1409554241, now seen corresponding path program 1 times [2022-11-20 20:16:45,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:16:45,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783652822] [2022-11-20 20:16:45,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:16:45,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:16:45,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:16:46,078 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-20 20:16:46,078 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:16:46,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783652822] [2022-11-20 20:16:46,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783652822] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:16:46,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:16:46,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 20:16:46,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139889372] [2022-11-20 20:16:46,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:16:46,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 20:16:46,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:16:46,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 20:16:46,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:16:46,080 INFO L87 Difference]: Start difference. First operand 30 states and 33 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-20 20:16:46,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:16:46,158 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-11-20 20:16:46,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:16:46,159 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-20 20:16:46,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:16:46,161 INFO L225 Difference]: With dead ends: 41 [2022-11-20 20:16:46,161 INFO L226 Difference]: Without dead ends: 30 [2022-11-20 20:16:46,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-20 20:16:46,163 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 15 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 68 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-20 20:16:46,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 68 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 20:16:46,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-20 20:16:46,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-20 20:16:46,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 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-20 20:16:46,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-11-20 20:16:46,172 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 22 [2022-11-20 20:16:46,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:16:46,172 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-11-20 20:16:46,173 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-20 20:16:46,173 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-11-20 20:16:46,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 20:16:46,173 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:16:46,174 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-20 20:16:46,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 20:16:46,174 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-20 20:16:46,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:16:46,175 INFO L85 PathProgramCache]: Analyzing trace with hash 882314594, now seen corresponding path program 1 times [2022-11-20 20:16:46,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:16:46,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592004805] [2022-11-20 20:16:46,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:16:46,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:16:46,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:16:46,410 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-20 20:16:46,410 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:16:46,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592004805] [2022-11-20 20:16:46,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592004805] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:16:46,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507720665] [2022-11-20 20:16:46,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:16:46,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:16:46,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:16:46,412 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:16:46,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 20:16:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:16:46,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 83 conjunts are in the unsatisfiable core [2022-11-20 20:16:46,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:16:46,694 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-20 20:16:46,770 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-20 20:16:46,789 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-20 20:16:46,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:16:46,883 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-20 20:16:46,951 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-20 20:16:46,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507720665] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-20 20:16:46,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:16:46,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4, 10] total 18 [2022-11-20 20:16:46,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010310974] [2022-11-20 20:16:46,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:16:46,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 20:16:46,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:16:46,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 20:16:46,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2022-11-20 20:16:46,953 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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-20 20:16:47,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:16:47,169 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-11-20 20:16:47,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 20:16:47,169 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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 24 [2022-11-20 20:16:47,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:16:47,170 INFO L225 Difference]: With dead ends: 30 [2022-11-20 20:16:47,170 INFO L226 Difference]: Without dead ends: 29 [2022-11-20 20:16:47,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2022-11-20 20:16:47,171 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 20 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:16:47,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 83 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:16:47,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-20 20:16:47,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-11-20 20:16:47,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 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-20 20:16:47,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-11-20 20:16:47,189 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 24 [2022-11-20 20:16:47,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:16:47,189 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-11-20 20:16:47,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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-20 20:16:47,190 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-11-20 20:16:47,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 20:16:47,190 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:16:47,190 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, 1] [2022-11-20 20:16:47,202 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 20:16:47,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:16:47,398 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-20 20:16:47,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:16:47,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1581948745, now seen corresponding path program 1 times [2022-11-20 20:16:47,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:16:47,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583114927] [2022-11-20 20:16:47,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:16:47,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:16:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:16:47,607 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-20 20:16:47,607 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:16:47,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583114927] [2022-11-20 20:16:47,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583114927] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:16:47,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166686248] [2022-11-20 20:16:47,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:16:47,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:16:47,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:16:47,609 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:16:47,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 20:16:47,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:16:47,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 132 conjunts are in the unsatisfiable core [2022-11-20 20:16:47,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:16:47,907 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-20 20:16:47,958 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_289 Int) (LDV_INIT_LIST_HEAD_~list.offset Int) (v_ArrVal_292 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_292) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_289))) (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2022-11-20 20:16:47,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:47,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:47,978 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-20 20:16:48,170 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:16:48,173 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:16:48,173 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-20 20:16:48,297 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-20 20:16:48,327 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-20 20:16:48,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:16:48,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166686248] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:16:48,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [732158746] [2022-11-20 20:16:48,823 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2022-11-20 20:16:48,823 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:16:48,827 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:16:48,832 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:16:48,833 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:16:48,896 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-20 20:16:48,902 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-20 20:16:49,042 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:16:49,053 INFO L321 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2022-11-20 20:16:49,054 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 137 treesize of output 129 [2022-11-20 20:16:49,066 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:16:49,079 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 20:16:49,080 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 135 treesize of output 131 [2022-11-20 20:16:49,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 20:16:49,192 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-20 20:16:49,203 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-20 20:16:49,219 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-20 20:16:49,269 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-20 20:16:49,286 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-20 20:16:49,294 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-20 20:16:49,389 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-20 20:16:49,400 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-20 20:16:49,429 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-20 20:16:49,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:49,557 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-20 20:16:49,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:49,564 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-20 20:16:49,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:49,577 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-20 20:16:49,662 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-20 20:16:49,855 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-20 20:16:50,016 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-20 20:16:50,036 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-20 20:16:50,056 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-20 20:16:50,253 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_kobject_put with input of size 39 for LOIs [2022-11-20 20:16:50,313 INFO L197 IcfgInterpreter]: Interpreting procedure LDV_INIT_LIST_HEAD with input of size 33 for LOIs [2022-11-20 20:16:50,326 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 43 for LOIs [2022-11-20 20:16:50,355 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:16:55,583 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1596#(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_atomic_sub_return_~temp~1#1| 2147483648) |ldv_kobject_put_ldv_atomic_sub_return_~i#1|) (= |ldv_kobject_put_ldv_kref_put_#in~release#1.offset| |ldv_kobject_put_ldv_kref_put_~release#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_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-20 20:16:55,583 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:16:55,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:16:55,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 18] total 21 [2022-11-20 20:16:55,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499396575] [2022-11-20 20:16:55,584 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:16:55,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-20 20:16:55,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:16:55,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-20 20:16:55,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2349, Unknown=1, NotChecked=98, Total=2652 [2022-11-20 20:16:55,586 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 21 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 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-20 20:16:56,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:16:56,344 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2022-11-20 20:16:56,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 20:16:56,345 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 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 25 [2022-11-20 20:16:56,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:16:56,346 INFO L225 Difference]: With dead ends: 60 [2022-11-20 20:16:56,346 INFO L226 Difference]: Without dead ends: 34 [2022-11-20 20:16:56,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 971 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=309, Invalid=3600, Unknown=1, NotChecked=122, Total=4032 [2022-11-20 20:16:56,348 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 49 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:16:56,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 67 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 353 Invalid, 0 Unknown, 33 Unchecked, 0.3s Time] [2022-11-20 20:16:56,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-20 20:16:56,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-11-20 20:16:56,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 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-20 20:16:56,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-11-20 20:16:56,358 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 25 [2022-11-20 20:16:56,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:16:56,358 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-11-20 20:16:56,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 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-20 20:16:56,359 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-11-20 20:16:56,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-20 20:16:56,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:16:56,360 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:16:56,371 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 20:16:56,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 20:16:56,566 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-20 20:16:56,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:16:56,567 INFO L85 PathProgramCache]: Analyzing trace with hash 796400006, now seen corresponding path program 1 times [2022-11-20 20:16:56,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:16:56,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697195959] [2022-11-20 20:16:56,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:16:56,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:16:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:16:56,825 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:16:56,825 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:16:56,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697195959] [2022-11-20 20:16:56,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697195959] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:16:56,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258404382] [2022-11-20 20:16:56,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:16:56,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:16:56,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:16:56,827 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:16:56,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 20:16:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:16:57,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 188 conjunts are in the unsatisfiable core [2022-11-20 20:16:57,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:16:57,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 20:16:57,190 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-20 20:16:57,244 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_398 Int) (v_ArrVal_397 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_398) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_397)) |c_#memory_int|) (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2022-11-20 20:16:57,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:57,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:57,260 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-20 20:16:57,415 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:16:57,418 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:16:57,419 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-20 20:16:57,570 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_403 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 (<= (select .cse0 .cse1) (+ v_ArrVal_403 1)) (= (store |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base| (store .cse0 .cse1 v_ArrVal_403)) |c_#memory_int|) (<= 0 (+ v_ArrVal_403 2147483648))))) is different from true [2022-11-20 20:16:57,590 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:16:57,593 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:16:57,593 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-20 20:16:57,697 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-20 20:16:57,731 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:16:57,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:17:00,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258404382] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:17:00,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [981394474] [2022-11-20 20:17:00,851 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2022-11-20 20:17:00,852 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:17:00,852 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:17:00,852 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:17:00,853 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:17:00,889 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-20 20:17:00,895 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-20 20:17:00,980 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-20 20:17:00,996 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:17:01,010 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 20:17:01,011 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-20 20:17:01,023 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:17:01,034 INFO L321 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2022-11-20 20:17:01,034 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-20 20:17:01,098 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-20 20:17:01,105 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-20 20:17:01,117 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-20 20:17:01,173 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-20 20:17:01,183 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-20 20:17:01,224 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-20 20:17:01,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:01,312 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-20 20:17:01,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:01,316 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-20 20:17:01,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:01,321 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-20 20:17:01,374 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-20 20:17:01,499 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-20 20:17:01,619 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-20 20:17:01,631 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-20 20:17:01,647 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-20 20:17:01,780 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-20 20:17:01,801 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-20 20:17:01,818 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-20 20:17:01,848 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-20 20:17:01,882 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 20:17:01,883 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-20 20:17:02,024 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-20 20:17:02,208 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-20 20:17:02,494 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_kobject_put with input of size 52 for LOIs [2022-11-20 20:17:02,889 INFO L197 IcfgInterpreter]: Interpreting procedure LDV_INIT_LIST_HEAD with input of size 33 for LOIs [2022-11-20 20:17:02,901 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 43 for LOIs [2022-11-20 20:17:02,928 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:17:10,198 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1981#(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_atomic_sub_return_~temp~1#1| 2147483648) |ldv_kobject_put_ldv_atomic_sub_return_~i#1|) (= |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_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) (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|) (= |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-20 20:17:10,199 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:17:10,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:17:10,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 23] total 27 [2022-11-20 20:17:10,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003958035] [2022-11-20 20:17:10,199 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:17:10,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-20 20:17:10,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:17:10,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-20 20:17:10,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=3742, Unknown=3, NotChecked=250, Total=4290 [2022-11-20 20:17:10,202 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 27 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 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-20 20:17:11,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:17:11,094 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2022-11-20 20:17:11,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-20 20:17:11,097 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 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-20 20:17:11,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:17:11,098 INFO L225 Difference]: With dead ends: 59 [2022-11-20 20:17:11,099 INFO L226 Difference]: Without dead ends: 0 [2022-11-20 20:17:11,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1639 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=417, Invalid=5138, Unknown=3, NotChecked=294, Total=5852 [2022-11-20 20:17:11,101 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 41 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:17:11,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 39 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 396 Invalid, 0 Unknown, 70 Unchecked, 0.4s Time] [2022-11-20 20:17:11,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-20 20:17:11,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-20 20:17:11,106 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-20 20:17:11,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-20 20:17:11,107 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2022-11-20 20:17:11,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:17:11,107 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 20:17:11,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 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-20 20:17:11,108 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-20 20:17:11,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-20 20:17:11,111 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-11-20 20:17:11,111 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-11-20 20:17:11,112 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-11-20 20:17:11,112 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-11-20 20:17:11,122 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 20:17:11,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:17:11,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-20 20:17:12,553 INFO L902 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 525 531) the Hoare annotation is: true [2022-11-20 20:17:12,553 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 525 531) no Hoare annotation was computed. [2022-11-20 20:17:12,553 INFO L899 garLoopResultBuilder]: For program point L762(lines 757 763) no Hoare annotation was computed. [2022-11-20 20:17:12,553 INFO L899 garLoopResultBuilder]: For program point L659(line 659) no Hoare annotation was computed. [2022-11-20 20:17:12,553 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) (not (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.base| 0)) (<= 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|) (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-20 20:17:12,553 INFO L899 garLoopResultBuilder]: For program point L717(lines 717 718) no Hoare annotation was computed. [2022-11-20 20:17:12,553 INFO L895 garLoopResultBuilder]: At program point L717-2(lines 717 718) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|)) (.cse2 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0)) (.cse1 (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| 0))) (or (and .cse0 (= |ULTIMATE.start_entry_point_~kobj~2#1.base| 0) .cse1 .cse2) (let ((.cse4 (+ |ULTIMATE.start_entry_point_~kobj~2#1.offset| 12)) (.cse3 (select |#memory_int| |ULTIMATE.start_entry_point_~kobj~2#1.base|))) (and (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) .cse0 (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (< (select .cse3 .cse4) 2147483649) (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|))) (not (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.base| 0)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) 12)) (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.offset| 0) (not .cse2) .cse1 (= .cse4 |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 .cse3 12)) (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-20 20:17:12,554 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-20 20:17:12,554 INFO L899 garLoopResultBuilder]: For program point L742(lines 742 743) no Hoare annotation was computed. [2022-11-20 20:17:12,554 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 659) no Hoare annotation was computed. [2022-11-20 20:17:12,554 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-20 20:17:12,554 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-20 20:17:12,554 INFO L899 garLoopResultBuilder]: For program point L730(lines 730 732) no Hoare annotation was computed. [2022-11-20 20:17:12,554 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-20 20:17:12,554 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-20 20:17:12,554 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 659) no Hoare annotation was computed. [2022-11-20 20:17:12,555 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-20 20:17:12,555 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-20 20:17:12,555 INFO L899 garLoopResultBuilder]: For program point L723(lines 723 724) no Hoare annotation was computed. [2022-11-20 20:17:12,555 INFO L895 garLoopResultBuilder]: At program point L761(line 761) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|)) (.cse2 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0)) (.cse1 (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| 0))) (or (and .cse0 (= |ULTIMATE.start_entry_point_~kobj~2#1.base| 0) .cse1 .cse2) (let ((.cse4 (+ |ULTIMATE.start_entry_point_~kobj~2#1.offset| 12)) (.cse3 (select |#memory_int| |ULTIMATE.start_entry_point_~kobj~2#1.base|))) (and (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) .cse0 (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (< (select .cse3 .cse4) 2147483649) (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|))) (not (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.base| 0)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) 12)) (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.offset| 0) (not .cse2) .cse1 (= .cse4 |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 .cse3 12)) (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-20 20:17:12,555 INFO L895 garLoopResultBuilder]: At program point L761-1(line 761) the Hoare annotation is: (let ((.cse2 (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|)) (.cse4 (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| 0)) (.cse3 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0))) (or (let ((.cse0 (select |#memory_int| |ULTIMATE.start_entry_point_~kobj~2#1.base|)) (.cse1 (+ |ULTIMATE.start_entry_point_~kobj~2#1.offset| 12))) (and (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.offset| |ULTIMATE.start_entry_point_~kobj~2#1.offset|) (<= 1 (select .cse0 12)) (= 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|) (< (select .cse0 .cse1) 2147483649) (not (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.base| 0)) (or (not .cse2) (not .cse3)) .cse4 (= .cse1 |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|) (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 (= |ULTIMATE.start_entry_point_~kobj~2#1.base| 0) .cse4 .cse3))) [2022-11-20 20:17:12,555 INFO L902 garLoopResultBuilder]: At program point L741(line 741) the Hoare annotation is: true [2022-11-20 20:17:12,556 INFO L899 garLoopResultBuilder]: For program point L741-1(line 741) no Hoare annotation was computed. [2022-11-20 20:17:12,556 INFO L895 garLoopResultBuilder]: At program point LDV_INIT_LIST_HEADENTRY(lines 538 542) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-11-20 20:17:12,556 INFO L899 garLoopResultBuilder]: For program point LDV_INIT_LIST_HEADEXIT(lines 538 542) no Hoare annotation was computed. [2022-11-20 20:17:12,556 INFO L899 garLoopResultBuilder]: For program point L667(line 667) no Hoare annotation was computed. [2022-11-20 20:17:12,556 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 (or .cse0 (not (= |ldv_kobject_put_#in~kobj#1.base| 0))) (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))) (not (< (select .cse1 .cse2) 2147483649)) (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_~i#1| 1) (= |#memory_int| |old(#memory_int)|) (<= |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1| (+ |ldv_kobject_put_ldv_atomic_sub_return_~i#1| 2147483647)) (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| |ldv_kobject_put_#in~kobj#1.base|) (= |ldv_kobject_put_~kobj#1.offset| 0)))))) [2022-11-20 20:17:12,556 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 667) no Hoare annotation was computed. [2022-11-20 20:17:12,557 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)|) (not (< (select .cse0 (+ |ldv_kobject_put_#in~kobj#1.offset| 12)) 2147483649)))) [2022-11-20 20:17:12,557 INFO L899 garLoopResultBuilder]: For program point L711(lines 711 713) no Hoare annotation was computed. [2022-11-20 20:17:12,557 INFO L899 garLoopResultBuilder]: For program point L711-2(lines 709 714) no Hoare annotation was computed. [2022-11-20 20:17:12,557 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putEXIT(lines 709 714) no Hoare annotation was computed. [2022-11-20 20:17:12,557 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 667) no Hoare annotation was computed. [2022-11-20 20:17:12,561 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:17:12,563 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 20:17:12,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:17:12 BoogieIcfgContainer [2022-11-20 20:17:12,601 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 20:17:12,601 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 20:17:12,601 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 20:17:12,602 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 20:17:12,602 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:16:41" (3/4) ... [2022-11-20 20:17:12,605 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 20:17:12,610 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-11-20 20:17:12,611 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2022-11-20 20:17:12,611 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2022-11-20 20:17:12,616 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 47 nodes and edges [2022-11-20 20:17:12,617 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2022-11-20 20:17:12,617 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-20 20:17:12,642 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-20 20:17:12,642 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == \result && kobj == 0) && kobj == 0) && \result == 0) || ((((((((((((((((((0 == kobj && kobj == kobj) && 0 == \result) && kobj == kobj) && unknown-#memory_int-unknown[kobj][kobj + 12] < 2147483649) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && !(kobj == 0)) && 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))) [2022-11-20 20:17:12,643 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]) && !(kobj == 0)) && 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)) [2022-11-20 20:17:12,644 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(kobj == 0) || !(kobj == 0)) && (((!(kobj == 0) || !(1 <= \old(unknown-#memory_int-unknown)[kobj][12])) || !(\old(unknown-#memory_int-unknown)[kobj][kobj + 12] < 2147483649)) || (((((((v == kobj + 12 && kobj == kobj) && unknown-#memory_int-unknown[v][v] <= temp) && i <= 1) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && temp <= i + 2147483647) && v == kobj) && kobj == 0)) [2022-11-20 20:17:12,660 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/witness.graphml [2022-11-20 20:17:12,660 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 20:17:12,660 INFO L158 Benchmark]: Toolchain (without parser) took 33004.67ms. Allocated memory was 174.1MB in the beginning and 302.0MB in the end (delta: 127.9MB). Free memory was 127.6MB in the beginning and 231.4MB in the end (delta: -103.8MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2022-11-20 20:17:12,661 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 132.1MB. Free memory was 75.4MB in the beginning and 75.3MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 20:17:12,661 INFO L158 Benchmark]: CACSL2BoogieTranslator took 604.17ms. Allocated memory is still 174.1MB. Free memory was 127.6MB in the beginning and 106.1MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-20 20:17:12,661 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.99ms. Allocated memory is still 174.1MB. Free memory was 106.1MB in the beginning and 103.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 20:17:12,662 INFO L158 Benchmark]: Boogie Preprocessor took 33.17ms. Allocated memory is still 174.1MB. Free memory was 103.5MB in the beginning and 101.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 20:17:12,662 INFO L158 Benchmark]: RCFGBuilder took 762.14ms. Allocated memory is still 174.1MB. Free memory was 101.4MB in the beginning and 123.0MB in the end (delta: -21.6MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2022-11-20 20:17:12,662 INFO L158 Benchmark]: TraceAbstraction took 31486.30ms. Allocated memory was 174.1MB in the beginning and 302.0MB in the end (delta: 127.9MB). Free memory was 122.0MB in the beginning and 235.6MB in the end (delta: -113.6MB). Peak memory consumption was 161.4MB. Max. memory is 16.1GB. [2022-11-20 20:17:12,663 INFO L158 Benchmark]: Witness Printer took 58.66ms. Allocated memory is still 302.0MB. Free memory was 235.6MB in the beginning and 231.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 20:17:12,664 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.28ms. Allocated memory is still 132.1MB. Free memory was 75.4MB in the beginning and 75.3MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 604.17ms. Allocated memory is still 174.1MB. Free memory was 127.6MB in the beginning and 106.1MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.99ms. Allocated memory is still 174.1MB. Free memory was 106.1MB in the beginning and 103.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.17ms. Allocated memory is still 174.1MB. Free memory was 103.5MB in the beginning and 101.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 762.14ms. Allocated memory is still 174.1MB. Free memory was 101.4MB in the beginning and 123.0MB in the end (delta: -21.6MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * TraceAbstraction took 31486.30ms. Allocated memory was 174.1MB in the beginning and 302.0MB in the end (delta: 127.9MB). Free memory was 122.0MB in the beginning and 235.6MB in the end (delta: -113.6MB). Peak memory consumption was 161.4MB. Max. memory is 16.1GB. * Witness Printer took 58.66ms. Allocated memory is still 302.0MB. Free memory was 235.6MB in the beginning and 231.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 659]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 659]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 667]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 667]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 33 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 31.4s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 296 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 290 mSDsluCounter, 863 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 175 IncrementalHoareTripleChecker+Unchecked, 652 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1456 IncrementalHoareTripleChecker+Invalid, 1724 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 211 mSDtfsCounter, 1456 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 330 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 227 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2772 ImplicationChecksByTransitivity, 18.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=3, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 26 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 55 PreInvPairs, 71 NumberOfFragments, 694 HoareAnnotationTreeSize, 55 FomulaSimplifications, 221 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 14 FomulaSimplificationsInter, 2993 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 325 NumberOfCodeBlocks, 325 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 332 ConstructedInterpolants, 6 QuantifiedInterpolants, 1642 SizeOfPredicates, 252 NumberOfNonLiveVariables, 1356 ConjunctsInSsa, 569 ConjunctsInUnsatCore, 17 InterpolantComputations, 9 PerfectInterpolantSequences, 8/24 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 Derived loop invariant: (!(kobj == 0) || !(kobj == 0)) && (((!(kobj == 0) || !(1 <= \old(unknown-#memory_int-unknown)[kobj][12])) || !(\old(unknown-#memory_int-unknown)[kobj][kobj + 12] < 2147483649)) || (((((((v == kobj + 12 && kobj == kobj) && unknown-#memory_int-unknown[v][v] <= temp) && i <= 1) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && temp <= i + 2147483647) && v == kobj) && kobj == 0)) - 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]) && !(kobj == 0)) && 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)) - 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: (((0 == \result && kobj == 0) && kobj == 0) && \result == 0) || ((((((((((((((((((0 == kobj && kobj == kobj) && 0 == \result) && kobj == kobj) && unknown-#memory_int-unknown[kobj][kobj + 12] < 2147483649) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && !(kobj == 0)) && 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))) RESULT: Ultimate proved your program to be correct! [2022-11-20 20:17:12,698 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b2ceb8-a2ef-456a-b689-c219936fdbc0/bin/utaipan-6cKwYrpEi9/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