./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 27e059eb1633b1ab9c045484375455e2667fa3360a55d0bc53eccfa53fe7600f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-26 01:05:14,047 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 01:05:14,049 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 01:05:14,073 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 01:05:14,074 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 01:05:14,077 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 01:05:14,081 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 01:05:14,085 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 01:05:14,087 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 01:05:14,092 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 01:05:14,094 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 01:05:14,096 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 01:05:14,096 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 01:05:14,101 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 01:05:14,104 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 01:05:14,106 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 01:05:14,108 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 01:05:14,109 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 01:05:14,110 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 01:05:14,117 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 01:05:14,118 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 01:05:14,120 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 01:05:14,122 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 01:05:14,123 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 01:05:14,132 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 01:05:14,133 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 01:05:14,133 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 01:05:14,135 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 01:05:14,135 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 01:05:14,137 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 01:05:14,137 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 01:05:14,138 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 01:05:14,140 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 01:05:14,141 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 01:05:14,143 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 01:05:14,143 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 01:05:14,144 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 01:05:14,144 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 01:05:14,145 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 01:05:14,146 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 01:05:14,147 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 01:05:14,148 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-26 01:05:14,187 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 01:05:14,187 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 01:05:14,188 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 01:05:14,188 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 01:05:14,209 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 01:05:14,209 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 01:05:14,210 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 01:05:14,210 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 01:05:14,210 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 01:05:14,210 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 01:05:14,211 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 01:05:14,212 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 01:05:14,212 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 01:05:14,212 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 01:05:14,213 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 01:05:14,213 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 01:05:14,213 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 01:05:14,213 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 01:05:14,215 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 01:05:14,215 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 01:05:14,215 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-26 01:05:14,215 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 01:05:14,216 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 01:05:14,216 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 01:05:14,216 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 01:05:14,216 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 01:05:14,217 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 01:05:14,217 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-26 01:05:14,218 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 01:05:14,218 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 01:05:14,218 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 01:05:14,219 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 01:05:14,219 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 01:05:14,219 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 01:05:14,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 01:05:14,220 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 01:05:14,220 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 01:05:14,220 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 01:05:14,221 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 01:05:14,221 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 01:05:14,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 01:05:14,222 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 01:05:14,222 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 01:05:14,222 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_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 27e059eb1633b1ab9c045484375455e2667fa3360a55d0bc53eccfa53fe7600f [2022-11-26 01:05:14,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 01:05:14,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 01:05:14,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 01:05:14,592 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 01:05:14,593 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 01:05:14,594 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i [2022-11-26 01:05:17,704 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 01:05:18,059 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 01:05:18,059 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i [2022-11-26 01:05:18,072 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/data/a0355c5f7/8e26143666c64354811cca6c0e1f6349/FLAG152630966 [2022-11-26 01:05:18,087 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/data/a0355c5f7/8e26143666c64354811cca6c0e1f6349 [2022-11-26 01:05:18,090 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 01:05:18,091 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 01:05:18,093 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 01:05:18,093 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 01:05:18,097 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 01:05:18,098 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 01:05:18" (1/1) ... [2022-11-26 01:05:18,099 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11068e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:05:18, skipping insertion in model container [2022-11-26 01:05:18,099 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 01:05:18" (1/1) ... [2022-11-26 01:05:18,107 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 01:05:18,146 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 01:05:18,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 01:05:18,625 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 01:05:18,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 01:05:18,712 INFO L208 MainTranslator]: Completed translation [2022-11-26 01:05:18,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:05:18 WrapperNode [2022-11-26 01:05:18,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 01:05:18,714 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 01:05:18,714 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 01:05:18,714 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 01:05:18,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:05:18" (1/1) ... [2022-11-26 01:05:18,739 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:05:18" (1/1) ... [2022-11-26 01:05:18,758 INFO L138 Inliner]: procedures = 164, calls = 73, calls flagged for inlining = 21, calls inlined = 3, statements flattened = 53 [2022-11-26 01:05:18,758 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 01:05:18,759 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 01:05:18,759 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 01:05:18,759 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 01:05:18,769 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:05:18" (1/1) ... [2022-11-26 01:05:18,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:05:18" (1/1) ... [2022-11-26 01:05:18,772 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:05:18" (1/1) ... [2022-11-26 01:05:18,772 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:05:18" (1/1) ... [2022-11-26 01:05:18,778 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:05:18" (1/1) ... [2022-11-26 01:05:18,782 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:05:18" (1/1) ... [2022-11-26 01:05:18,783 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:05:18" (1/1) ... [2022-11-26 01:05:18,785 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:05:18" (1/1) ... [2022-11-26 01:05:18,787 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 01:05:18,788 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 01:05:18,788 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 01:05:18,788 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 01:05:18,789 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:05:18" (1/1) ... [2022-11-26 01:05:18,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 01:05:18,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:05:18,822 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 01:05:18,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 01:05:18,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-26 01:05:18,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-26 01:05:18,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-26 01:05:18,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 01:05:18,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-26 01:05:18,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-26 01:05:18,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-26 01:05:18,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-26 01:05:18,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 01:05:18,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 01:05:19,003 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 01:05:19,005 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 01:05:19,212 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 01:05:19,280 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 01:05:19,280 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-26 01:05:19,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:05:19 BoogieIcfgContainer [2022-11-26 01:05:19,283 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 01:05:19,286 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 01:05:19,286 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 01:05:19,289 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 01:05:19,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 01:05:18" (1/3) ... [2022-11-26 01:05:19,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f02927c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 01:05:19, skipping insertion in model container [2022-11-26 01:05:19,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:05:18" (2/3) ... [2022-11-26 01:05:19,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f02927c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 01:05:19, skipping insertion in model container [2022-11-26 01:05:19,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:05:19" (3/3) ... [2022-11-26 01:05:19,292 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test18_2.i [2022-11-26 01:05:19,312 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 01:05:19,313 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-11-26 01:05:19,362 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 01:05:19,372 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;@2a8fea02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 01:05:19,372 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-26 01:05:19,377 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 01:05:19,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-26 01:05:19,386 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:05:19,387 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:05:19,388 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-26 01:05:19,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:05:19,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1948391324, now seen corresponding path program 1 times [2022-11-26 01:05:19,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:05:19,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593581914] [2022-11-26 01:05:19,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:05:19,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:05:19,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:05:19,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 01:05:19,826 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:05:19,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593581914] [2022-11-26 01:05:19,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593581914] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:05:19,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:05:19,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 01:05:19,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955646607] [2022-11-26 01:05:19,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:05:19,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:05:19,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:05:19,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:05:19,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:05:19,866 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 21 states have internal predecessors, (25), 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) Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 01:05:19,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:05:19,955 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-11-26 01:05:19,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:05:19,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 13 [2022-11-26 01:05:19,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:05:19,966 INFO L225 Difference]: With dead ends: 44 [2022-11-26 01:05:19,966 INFO L226 Difference]: Without dead ends: 36 [2022-11-26 01:05:19,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 01:05:19,972 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:05:19,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 47 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:05:19,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-26 01:05:20,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2022-11-26 01:05:20,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.380952380952381) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-26 01:05:20,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2022-11-26 01:05:20,016 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 13 [2022-11-26 01:05:20,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:05:20,017 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2022-11-26 01:05:20,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 01:05:20,018 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-11-26 01:05:20,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-26 01:05:20,020 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:05:20,020 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:05:20,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 01:05:20,021 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-26 01:05:20,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:05:20,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1997394328, now seen corresponding path program 1 times [2022-11-26 01:05:20,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:05:20,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181522560] [2022-11-26 01:05:20,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:05:20,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:05:20,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:05:20,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 01:05:20,164 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:05:20,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181522560] [2022-11-26 01:05:20,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181522560] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:05:20,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:05:20,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 01:05:20,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760289401] [2022-11-26 01:05:20,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:05:20,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:05:20,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:05:20,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:05:20,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:05:20,168 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 01:05:20,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:05:20,212 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-11-26 01:05:20,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:05:20,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 16 [2022-11-26 01:05:20,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:05:20,214 INFO L225 Difference]: With dead ends: 37 [2022-11-26 01:05:20,214 INFO L226 Difference]: Without dead ends: 29 [2022-11-26 01:05:20,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 01:05:20,216 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:05:20,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 49 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:05:20,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-26 01:05:20,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-11-26 01:05:20,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.368421052631579) internal successors, (26), 24 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-26 01:05:20,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-11-26 01:05:20,222 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 16 [2022-11-26 01:05:20,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:05:20,223 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-11-26 01:05:20,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 01:05:20,224 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-11-26 01:05:20,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-26 01:05:20,224 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:05:20,225 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:05:20,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 01:05:20,225 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-26 01:05:20,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:05:20,226 INFO L85 PathProgramCache]: Analyzing trace with hash 511982759, now seen corresponding path program 1 times [2022-11-26 01:05:20,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:05:20,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854900337] [2022-11-26 01:05:20,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:05:20,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:05:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:05:20,500 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 01:05:20,502 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:05:20,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854900337] [2022-11-26 01:05:20,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854900337] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:05:20,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666511292] [2022-11-26 01:05:20,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:05:20,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:05:20,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:05:20,507 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:05:20,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 01:05:20,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:05:20,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 01:05:20,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:05:20,742 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 01:05:20,743 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 01:05:20,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666511292] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:05:20,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 01:05:20,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-26 01:05:20,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894539374] [2022-11-26 01:05:20,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:05:20,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 01:05:20,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:05:20,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 01:05:20,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-26 01:05:20,747 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-26 01:05:20,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:05:20,842 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-11-26 01:05:20,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 01:05:20,843 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 21 [2022-11-26 01:05:20,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:05:20,847 INFO L225 Difference]: With dead ends: 29 [2022-11-26 01:05:20,848 INFO L226 Difference]: Without dead ends: 27 [2022-11-26 01:05:20,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-11-26 01:05:20,850 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 16 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:05:20,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 55 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:05:20,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-26 01:05:20,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-26 01:05:20,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.263157894736842) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-26 01:05:20,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-11-26 01:05:20,856 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 21 [2022-11-26 01:05:20,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:05:20,857 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-11-26 01:05:20,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-26 01:05:20,857 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-11-26 01:05:20,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-26 01:05:20,858 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:05:20,858 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:05:20,864 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-26 01:05:21,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:05:21,063 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-26 01:05:21,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:05:21,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1308403589, now seen corresponding path program 1 times [2022-11-26 01:05:21,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:05:21,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034110541] [2022-11-26 01:05:21,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:05:21,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:05:21,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:05:21,211 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 01:05:21,212 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:05:21,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034110541] [2022-11-26 01:05:21,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034110541] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:05:21,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726108181] [2022-11-26 01:05:21,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:05:21,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:05:21,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:05:21,214 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:05:21,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 01:05:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:05:21,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 01:05:21,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:05:21,368 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 01:05:21,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:05:21,447 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 01:05:21,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726108181] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:05:21,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [279490119] [2022-11-26 01:05:21,466 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-26 01:05:21,467 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:05:21,470 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:05:21,476 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:05:21,476 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:05:21,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-26 01:05:21,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-26 01:05:21,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-26 01:05:21,912 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 9 treesize of output 7 [2022-11-26 01:05:22,077 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 9 treesize of output 7 [2022-11-26 01:05:22,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-26 01:05:22,189 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:05:22,205 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-26 01:05:22,206 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 177 treesize of output 173 [2022-11-26 01:05:22,223 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:05:22,235 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 01:05:22,236 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 169 treesize of output 161 [2022-11-26 01:05:22,307 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 23 treesize of output 1 [2022-11-26 01:05:22,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-26 01:05:22,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-26 01:05:22,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-26 01:05:22,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-26 01:05:23,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-26 01:05:23,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-26 01:05:23,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-26 01:05:23,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-26 01:05:23,198 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 23 treesize of output 1 [2022-11-26 01:05:23,207 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 11 [2022-11-26 01:05:23,225 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 11 [2022-11-26 01:05:23,378 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 11 [2022-11-26 01:05:23,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-26 01:05:23,403 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 11 [2022-11-26 01:05:23,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-26 01:05:23,607 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 9 treesize of output 7 [2022-11-26 01:05:23,751 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 9 treesize of output 7 [2022-11-26 01:05:23,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-26 01:05:23,806 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 15 treesize of output 11 [2022-11-26 01:05:23,814 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 11 [2022-11-26 01:05:23,820 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 23 treesize of output 1 [2022-11-26 01:05:23,922 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 31 for LOIs [2022-11-26 01:05:23,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-26 01:05:23,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-26 01:05:23,968 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:05:25,411 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '503#(and (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0) (= |~#ldv_global_msg_list~0.offset| 0) (<= 0 |ULTIMATE.start_entry_point_~i~0#1|) (= |ULTIMATE.start_entry_point_~p~0#1.offset| 0) (= 10 |ULTIMATE.start_entry_point_~len~0#1|) (< 2147483646 |ULTIMATE.start_entry_point_#t~post39#1|) (= |~#ldv_global_msg_list~0.base| 1) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-26 01:05:25,412 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:05:25,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:05:25,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-11-26 01:05:25,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63094940] [2022-11-26 01:05:25,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:05:25,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-26 01:05:25,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:05:25,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-26 01:05:25,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2022-11-26 01:05:25,414 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-26 01:05:25,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:05:25,584 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2022-11-26 01:05:25,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-26 01:05:25,585 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 22 [2022-11-26 01:05:25,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:05:25,586 INFO L225 Difference]: With dead ends: 68 [2022-11-26 01:05:25,586 INFO L226 Difference]: Without dead ends: 66 [2022-11-26 01:05:25,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2022-11-26 01:05:25,587 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 34 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:05:25,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 132 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:05:25,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-26 01:05:25,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 47. [2022-11-26 01:05:25,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 39 states have internal predecessors, (44), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-26 01:05:25,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2022-11-26 01:05:25,595 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 22 [2022-11-26 01:05:25,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:05:25,596 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2022-11-26 01:05:25,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-26 01:05:25,596 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-11-26 01:05:25,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-26 01:05:25,597 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:05:25,597 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:05:25,605 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-26 01:05:25,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:05:25,798 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-26 01:05:25,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:05:25,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1009183101, now seen corresponding path program 1 times [2022-11-26 01:05:25,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:05:25,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871328133] [2022-11-26 01:05:25,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:05:25,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:05:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:05:25,851 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-26 01:05:25,851 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:05:25,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871328133] [2022-11-26 01:05:25,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871328133] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:05:25,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:05:25,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 01:05:25,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497849832] [2022-11-26 01:05:25,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:05:25,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:05:25,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:05:25,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:05:25,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:05:25,853 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-26 01:05:25,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:05:25,867 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2022-11-26 01:05:25,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:05:25,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-11-26 01:05:25,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:05:25,869 INFO L225 Difference]: With dead ends: 47 [2022-11-26 01:05:25,869 INFO L226 Difference]: Without dead ends: 46 [2022-11-26 01:05:25,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:05:25,870 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 2 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:05:25,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 30 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:05:25,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-26 01:05:25,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-11-26 01:05:25,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 38 states have internal predecessors, (43), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-26 01:05:25,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2022-11-26 01:05:25,877 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 24 [2022-11-26 01:05:25,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:05:25,877 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2022-11-26 01:05:25,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-26 01:05:25,877 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-11-26 01:05:25,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-26 01:05:25,878 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:05:25,878 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:05:25,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-26 01:05:25,879 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-26 01:05:25,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:05:25,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1219905147, now seen corresponding path program 1 times [2022-11-26 01:05:25,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:05:25,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899133030] [2022-11-26 01:05:25,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:05:25,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:05:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:05:26,003 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 01:05:26,004 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:05:26,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899133030] [2022-11-26 01:05:26,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899133030] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:05:26,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635957836] [2022-11-26 01:05:26,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:05:26,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:05:26,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:05:26,006 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:05:26,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 01:05:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:05:26,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-26 01:05:26,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:05:26,144 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 01:05:26,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:05:26,221 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 01:05:26,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635957836] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:05:26,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1178964052] [2022-11-26 01:05:26,225 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-26 01:05:26,226 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:05:26,226 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:05:26,226 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:05:26,226 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:05:26,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-26 01:05:26,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-26 01:05:26,460 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 9 treesize of output 7 [2022-11-26 01:05:26,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-26 01:05:26,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-26 01:05:26,566 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 9 treesize of output 7 [2022-11-26 01:05:26,633 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 23 treesize of output 1 [2022-11-26 01:05:26,645 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:05:26,657 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 01:05:26,657 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 177 treesize of output 169 [2022-11-26 01:05:26,671 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:05:26,685 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-26 01:05:26,685 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 177 treesize of output 173 [2022-11-26 01:05:26,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-26 01:05:26,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-26 01:05:27,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-26 01:05:27,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-26 01:05:27,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 01:05:27,207 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 15 treesize of output 11 [2022-11-26 01:05:27,213 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 23 treesize of output 1 [2022-11-26 01:05:27,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 01:05:27,272 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 15 treesize of output 11 [2022-11-26 01:05:27,281 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 23 treesize of output 1 [2022-11-26 01:05:27,444 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 14 treesize of output 13 [2022-11-26 01:05:27,461 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 30 for LOIs [2022-11-26 01:05:27,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-26 01:05:27,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-26 01:05:27,500 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:05:29,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1178964052] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:05:29,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:05:29,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6, 6, 6] total 26 [2022-11-26 01:05:29,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295517758] [2022-11-26 01:05:29,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:05:29,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-26 01:05:29,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:05:29,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-26 01:05:29,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2022-11-26 01:05:29,100 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 15 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 01:05:29,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:05:29,961 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2022-11-26 01:05:29,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-26 01:05:29,970 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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 25 [2022-11-26 01:05:29,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:05:29,971 INFO L225 Difference]: With dead ends: 50 [2022-11-26 01:05:29,971 INFO L226 Difference]: Without dead ends: 49 [2022-11-26 01:05:29,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=119, Invalid=811, Unknown=0, NotChecked=0, Total=930 [2022-11-26 01:05:29,972 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-26 01:05:29,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 14 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-26 01:05:29,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-26 01:05:29,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-11-26 01:05:29,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 41 states have internal predecessors, (46), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-26 01:05:29,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2022-11-26 01:05:29,985 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 25 [2022-11-26 01:05:29,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:05:29,986 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2022-11-26 01:05:29,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 01:05:29,986 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2022-11-26 01:05:29,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-26 01:05:29,987 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:05:29,988 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:05:29,999 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-26 01:05:30,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:05:30,191 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-26 01:05:30,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:05:30,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1818921777, now seen corresponding path program 1 times [2022-11-26 01:05:30,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:05:30,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663400618] [2022-11-26 01:05:30,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:05:30,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:05:30,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:05:30,333 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 01:05:30,334 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:05:30,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663400618] [2022-11-26 01:05:30,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663400618] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:05:30,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294916691] [2022-11-26 01:05:30,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:05:30,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:05:30,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:05:30,336 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:05:30,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-26 01:05:30,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:05:30,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-26 01:05:30,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:05:30,465 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 01:05:30,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:05:30,536 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 01:05:30,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294916691] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:05:30,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1806153236] [2022-11-26 01:05:30,540 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-26 01:05:30,540 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:05:30,540 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:05:30,540 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:05:30,540 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:05:30,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-26 01:05:30,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-26 01:05:30,726 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 9 treesize of output 7 [2022-11-26 01:05:30,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-26 01:05:30,806 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 9 treesize of output 7 [2022-11-26 01:05:30,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-26 01:05:30,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-26 01:05:30,908 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:05:30,919 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 01:05:30,920 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 177 treesize of output 169 [2022-11-26 01:05:30,931 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:05:30,945 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-26 01:05:30,945 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 177 treesize of output 173 [2022-11-26 01:05:31,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-26 01:05:31,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-26 01:05:31,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-26 01:05:31,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-26 01:05:31,404 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 15 treesize of output 11 [2022-11-26 01:05:31,410 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 11 [2022-11-26 01:05:31,416 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 23 treesize of output 1 [2022-11-26 01:05:31,475 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 11 [2022-11-26 01:05:31,481 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 15 treesize of output 11 [2022-11-26 01:05:31,487 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 23 treesize of output 1 [2022-11-26 01:05:31,624 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 14 treesize of output 13 [2022-11-26 01:05:31,649 INFO L321 Elim1Store]: treesize reduction 58, result has 19.4 percent of original size [2022-11-26 01:05:31,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 29 treesize of output 31 [2022-11-26 01:05:31,747 INFO L321 Elim1Store]: treesize reduction 140, result has 17.2 percent of original size [2022-11-26 01:05:31,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 118 treesize of output 112 [2022-11-26 01:05:31,810 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 14 treesize of output 13 [2022-11-26 01:05:31,836 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 30 for LOIs [2022-11-26 01:05:31,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-26 01:05:31,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-26 01:05:31,879 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:05:33,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1806153236] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:05:33,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:05:33,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [8, 8, 8] total 23 [2022-11-26 01:05:33,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330806673] [2022-11-26 01:05:33,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:05:33,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-26 01:05:33,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:05:33,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-26 01:05:33,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2022-11-26 01:05:33,449 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 15 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 01:05:34,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:05:34,358 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2022-11-26 01:05:34,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-26 01:05:34,359 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 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 28 [2022-11-26 01:05:34,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:05:34,360 INFO L225 Difference]: With dead ends: 49 [2022-11-26 01:05:34,360 INFO L226 Difference]: Without dead ends: 40 [2022-11-26 01:05:34,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 62 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=87, Invalid=669, Unknown=0, NotChecked=0, Total=756 [2022-11-26 01:05:34,361 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 7 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-26 01:05:34,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 3 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-26 01:05:34,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-26 01:05:34,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-11-26 01:05:34,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.064516129032258) internal successors, (33), 32 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-26 01:05:34,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2022-11-26 01:05:34,372 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 28 [2022-11-26 01:05:34,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:05:34,372 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2022-11-26 01:05:34,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 01:05:34,372 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-11-26 01:05:34,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-26 01:05:34,373 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:05:34,373 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2022-11-26 01:05:34,383 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-26 01:05:34,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-26 01:05:34,579 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-26 01:05:34,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:05:34,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1164701562, now seen corresponding path program 2 times [2022-11-26 01:05:34,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:05:34,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712068088] [2022-11-26 01:05:34,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:05:34,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:05:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:05:34,940 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-26 01:05:34,940 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:05:34,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712068088] [2022-11-26 01:05:34,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712068088] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:05:34,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320920849] [2022-11-26 01:05:34,941 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 01:05:34,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:05:34,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:05:34,943 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:05:34,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-26 01:05:35,059 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-26 01:05:35,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:05:35,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-26 01:05:35,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:05:35,135 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-11-26 01:05:35,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:05:35,233 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-11-26 01:05:35,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320920849] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:05:35,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1257501220] [2022-11-26 01:05:35,237 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-26 01:05:35,238 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:05:35,238 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:05:35,238 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:05:35,238 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:05:35,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-26 01:05:35,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-26 01:05:35,395 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 9 treesize of output 7 [2022-11-26 01:05:35,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-26 01:05:35,496 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 9 treesize of output 7 [2022-11-26 01:05:35,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-26 01:05:35,558 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 23 treesize of output 1 [2022-11-26 01:05:35,568 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:05:35,581 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-26 01:05:35,582 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 177 treesize of output 173 [2022-11-26 01:05:35,593 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:05:35,602 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 01:05:35,603 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 169 treesize of output 161 [2022-11-26 01:05:35,812 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 23 treesize of output 1 [2022-11-26 01:05:35,825 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 11 [2022-11-26 01:05:35,831 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 11 [2022-11-26 01:05:35,975 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 11 [2022-11-26 01:05:35,981 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 11 [2022-11-26 01:05:35,990 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 23 treesize of output 1 [2022-11-26 01:05:36,046 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 63 for LOIs [2022-11-26 01:05:36,126 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:05:37,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1257501220] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:05:37,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:05:37,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11, 4, 4] total 27 [2022-11-26 01:05:37,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549230432] [2022-11-26 01:05:37,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:05:37,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-26 01:05:37,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:05:37,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-26 01:05:37,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2022-11-26 01:05:37,874 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 12 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 01:05:39,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:05:39,683 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-11-26 01:05:39,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-26 01:05:39,684 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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 46 [2022-11-26 01:05:39,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:05:39,684 INFO L225 Difference]: With dead ends: 40 [2022-11-26 01:05:39,684 INFO L226 Difference]: Without dead ends: 0 [2022-11-26 01:05:39,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 115 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=276, Invalid=1130, Unknown=0, NotChecked=0, Total=1406 [2022-11-26 01:05:39,686 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 01:05:39,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 01:05:39,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-26 01:05:39,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-26 01:05:39,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:05:39,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-26 01:05:39,687 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2022-11-26 01:05:39,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:05:39,687 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-26 01:05:39,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 01:05:39,688 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-26 01:05:39,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-26 01:05:39,690 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2022-11-26 01:05:39,691 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2022-11-26 01:05:39,691 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2022-11-26 01:05:39,691 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2022-11-26 01:05:39,691 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2022-11-26 01:05:39,691 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2022-11-26 01:05:39,702 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-26 01:05:39,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-26 01:05:39,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-26 01:05:40,863 INFO L895 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 525 531) the Hoare annotation is: (or (not (= |~#ldv_global_msg_list~0.offset| 0)) (not (<= |~#ldv_global_msg_list~0.base| 1)) (not (<= 1 |~#ldv_global_msg_list~0.base|)) (not (= |#NULL.base| 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (<= 0 |#StackHeapBarrier|)) (let ((.cse0 (not (= |#NULL.offset| 0)))) (and (let ((.cse2 (select |#memory_$Pointer$.base| |~#ldv_global_msg_list~0.base|)) (.cse1 (select |#memory_$Pointer$.offset| |~#ldv_global_msg_list~0.base|)) (.cse3 (+ |~#ldv_global_msg_list~0.offset| 4))) (or (not (= (select |old(#valid)| 1) 1)) .cse0 (not (= 40 |ldv_malloc_#in~size|)) (not (< 0 |#StackHeapBarrier|)) (not (= (select |old(#length)| 1) 8)) (not (= (select .cse1 |~#ldv_global_msg_list~0.offset|) |~#ldv_global_msg_list~0.offset|)) (not (= |~#ldv_global_msg_list~0.base| (select .cse2 .cse3))) (not (= (select |old(#valid)| 0) 0)) (not (= |~#ldv_global_msg_list~0.base| (select .cse2 |~#ldv_global_msg_list~0.offset|))) (not (= |~#ldv_global_msg_list~0.offset| (select .cse1 .cse3))))) (or .cse0 (not (= |ldv_malloc_#in~size| 4)))))) [2022-11-26 01:05:40,864 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 525 531) no Hoare annotation was computed. [2022-11-26 01:05:40,864 INFO L899 garLoopResultBuilder]: For program point L774-5(line 774) no Hoare annotation was computed. [2022-11-26 01:05:40,864 INFO L895 garLoopResultBuilder]: At program point L774-6(lines 774 776) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_entry_point_~j~0#1| 1))) (or (and (<= .cse0 0) (= |ULTIMATE.start_entry_point_~i~0#1| 0)) (and (let ((.cse1 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0)) (.cse2 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse3 (= |ULTIMATE.start_entry_point_~p~0#1.offset| 0)) (.cse4 (= 10 |ULTIMATE.start_entry_point_~len~0#1|)) (.cse5 (<= |ULTIMATE.start_entry_point_~i~0#1| 2147483648))) (or (and .cse1 .cse2 (= |ULTIMATE.start_entry_point_~i~0#1| .cse0) .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 .cse0) (<= |ULTIMATE.start_entry_point_~j~0#1| 2147483646)))) (= |~#ldv_global_msg_list~0.base| 1) (= |#NULL.offset| 0) (<= 1 |ULTIMATE.start_entry_point_~i~0#1|) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_entry_point_~p~0#1.base| 0) (= |#NULL.base| 0)))) [2022-11-26 01:05:40,864 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 774) no Hoare annotation was computed. [2022-11-26 01:05:40,864 INFO L899 garLoopResultBuilder]: For program point L766(line 766) no Hoare annotation was computed. [2022-11-26 01:05:40,865 INFO L895 garLoopResultBuilder]: At program point L762(line 762) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |~#ldv_global_msg_list~0.base|)) (.cse1 (+ |~#ldv_global_msg_list~0.offset| 4)) (.cse2 (select |#memory_$Pointer$.offset| |~#ldv_global_msg_list~0.base|))) (and (= |~#ldv_global_msg_list~0.base| (select .cse0 |~#ldv_global_msg_list~0.offset|)) (= (select |#length| 1) 8) (= |~#ldv_global_msg_list~0.base| (select .cse0 .cse1)) (= |~#ldv_global_msg_list~0.offset| 0) (= 10 |ULTIMATE.start_entry_point_~len~0#1|) (= |~#ldv_global_msg_list~0.offset| (select .cse2 .cse1)) (= (select |#valid| 1) 1) (= |~#ldv_global_msg_list~0.base| 1) (= (select |#valid| 0) 0) (= |#NULL.offset| 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= (select .cse2 |~#ldv_global_msg_list~0.offset|) |~#ldv_global_msg_list~0.offset|))) [2022-11-26 01:05:40,865 INFO L899 garLoopResultBuilder]: For program point L762-1(line 762) no Hoare annotation was computed. [2022-11-26 01:05:40,865 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 767) no Hoare annotation was computed. [2022-11-26 01:05:40,865 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-26 01:05:40,865 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 774) no Hoare annotation was computed. [2022-11-26 01:05:40,865 INFO L899 garLoopResultBuilder]: For program point L767-3(line 767) no Hoare annotation was computed. [2022-11-26 01:05:40,865 INFO L899 garLoopResultBuilder]: For program point L767-4(line 767) no Hoare annotation was computed. [2022-11-26 01:05:40,866 INFO L895 garLoopResultBuilder]: At program point L767-5(lines 767 771) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0)) (.cse3 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse4 (= 10 |ULTIMATE.start_entry_point_~len~0#1|)) (.cse6 (= |~#ldv_global_msg_list~0.base| 1)) (.cse7 (= |#NULL.offset| 0)) (.cse8 (= |#NULL.base| 0))) (or (let ((.cse0 (select |#memory_$Pointer$.base| |~#ldv_global_msg_list~0.base|)) (.cse1 (+ |~#ldv_global_msg_list~0.offset| 4)) (.cse5 (select |#memory_$Pointer$.offset| |~#ldv_global_msg_list~0.base|))) (and (< |ULTIMATE.start_entry_point_~array~0#1.base| |#StackHeapBarrier|) (= |~#ldv_global_msg_list~0.base| (select .cse0 |~#ldv_global_msg_list~0.offset|)) (= (select |#length| 1) 8) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (* (mod |ULTIMATE.start_entry_point_~len~0#1| 1073741824) 4)) (= |~#ldv_global_msg_list~0.base| (select .cse0 .cse1)) .cse2 (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) 1) .cse3 .cse4 (= |~#ldv_global_msg_list~0.offset| (select .cse5 .cse1)) (= (select |#valid| 1) 1) .cse6 (= (select |#valid| 0) 0) .cse7 (= |ULTIMATE.start_entry_point_~i~0#1| 0) (< 0 |#StackHeapBarrier|) .cse8 (= (select .cse5 |~#ldv_global_msg_list~0.offset|) |~#ldv_global_msg_list~0.offset|))) (let ((.cse9 (+ (* |ULTIMATE.start_entry_point_~i~0#1| 4) (- 4) |ULTIMATE.start_entry_point_~array~0#1.offset|))) (and (<= |ULTIMATE.start_entry_point_~i~0#1| 10) .cse2 .cse3 (= |ULTIMATE.start_entry_point_~p~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~array~0#1.base|) .cse9) |ULTIMATE.start_entry_point_~p~0#1.base|) (= |ULTIMATE.start_entry_point_~p~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~array~0#1.base|) .cse9)) .cse4 .cse6 .cse7 (not (= |ULTIMATE.start_entry_point_~p~0#1.base| 0)) (<= 1 |ULTIMATE.start_entry_point_~i~0#1|) (<= 0 |#StackHeapBarrier|) .cse8)))) [2022-11-26 01:05:40,866 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 767) no Hoare annotation was computed. [2022-11-26 01:05:40,866 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-26 01:05:40,867 INFO L895 garLoopResultBuilder]: At program point L768(line 768) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0)) (.cse1 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse3 (= 10 |ULTIMATE.start_entry_point_~len~0#1|)) (.cse4 (= |~#ldv_global_msg_list~0.base| 1)) (.cse5 (= |#NULL.offset| 0)) (.cse6 (= |#NULL.base| 0))) (or (let ((.cse2 (+ (* |ULTIMATE.start_entry_point_~i~0#1| 4) (- 4) |ULTIMATE.start_entry_point_~array~0#1.offset|))) (and .cse0 (< |ULTIMATE.start_entry_point_~i~0#1| |ULTIMATE.start_entry_point_~len~0#1|) .cse1 (= |ULTIMATE.start_entry_point_~p~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~array~0#1.base|) .cse2) |ULTIMATE.start_entry_point_~p~0#1.base|) (= |ULTIMATE.start_entry_point_~p~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~array~0#1.base|) .cse2)) .cse3 .cse4 .cse5 (not (= |ULTIMATE.start_entry_point_~p~0#1.base| 0)) (<= 1 |ULTIMATE.start_entry_point_~i~0#1|) (<= 0 |#StackHeapBarrier|) .cse6)) (let ((.cse7 (select |#memory_$Pointer$.base| |~#ldv_global_msg_list~0.base|)) (.cse8 (+ |~#ldv_global_msg_list~0.offset| 4)) (.cse9 (select |#memory_$Pointer$.offset| |~#ldv_global_msg_list~0.base|))) (and (< |ULTIMATE.start_entry_point_~array~0#1.base| |#StackHeapBarrier|) (= |~#ldv_global_msg_list~0.base| (select .cse7 |~#ldv_global_msg_list~0.offset|)) (= (select |#length| 1) 8) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (* (mod |ULTIMATE.start_entry_point_~len~0#1| 1073741824) 4)) (= |~#ldv_global_msg_list~0.base| (select .cse7 .cse8)) .cse0 (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) 1) .cse1 .cse3 (= |~#ldv_global_msg_list~0.offset| (select .cse9 .cse8)) (= (select |#valid| 1) 1) .cse4 (= (select |#valid| 0) 0) .cse5 (= |ULTIMATE.start_entry_point_~i~0#1| 0) (< 0 |#StackHeapBarrier|) .cse6 (= (select .cse9 |~#ldv_global_msg_list~0.offset|) |~#ldv_global_msg_list~0.offset|))))) [2022-11-26 01:05:40,867 INFO L899 garLoopResultBuilder]: For program point L768-1(line 768) no Hoare annotation was computed. [2022-11-26 01:05:40,867 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 774) no Hoare annotation was computed. [2022-11-26 01:05:40,867 INFO L899 garLoopResultBuilder]: For program point L769(line 769) no Hoare annotation was computed. [2022-11-26 01:05:40,867 INFO L895 garLoopResultBuilder]: At program point L769-1(lines 760 779) the Hoare annotation is: (or (and (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0) (= |~#ldv_global_msg_list~0.offset| 0) (< |ULTIMATE.start_entry_point_~i~0#1| 2147483647) (= |ULTIMATE.start_entry_point_~p~0#1.offset| 0) (= 10 |ULTIMATE.start_entry_point_~len~0#1|) (= |~#ldv_global_msg_list~0.base| 1) (= |#NULL.offset| 0) (<= 1 |ULTIMATE.start_entry_point_~i~0#1|) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_entry_point_~p~0#1.base| 0) (= |#NULL.base| 0)) (= |ULTIMATE.start_entry_point_~i~0#1| 0)) [2022-11-26 01:05:40,867 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 774) no Hoare annotation was computed. [2022-11-26 01:05:40,867 INFO L902 garLoopResultBuilder]: At program point L778(lines 760 779) the Hoare annotation is: true [2022-11-26 01:05:40,867 INFO L899 garLoopResultBuilder]: For program point L774(line 774) no Hoare annotation was computed. [2022-11-26 01:05:40,868 INFO L899 garLoopResultBuilder]: For program point L774-4(line 774) no Hoare annotation was computed. [2022-11-26 01:05:40,877 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-11-26 01:05:40,880 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-26 01:05:40,911 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 01:05:40,912 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 01:05:40,916 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 01:05:40,916 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 01:05:40,920 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 01:05:40,921 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 01:05:40,922 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 01:05:40,933 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 01:05:40,933 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 01:05:40,933 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 01:05:40,934 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 01:05:40,934 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 01:05:40,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 01:05:40 BoogieIcfgContainer [2022-11-26 01:05:40,935 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-26 01:05:40,936 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-26 01:05:40,936 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-26 01:05:40,936 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-26 01:05:40,937 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:05:19" (3/4) ... [2022-11-26 01:05:40,940 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-26 01:05:40,946 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-11-26 01:05:40,950 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-11-26 01:05:40,951 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-26 01:05:40,952 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-26 01:05:40,994 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-26 01:05:40,994 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-26 01:05:40,995 INFO L158 Benchmark]: Toolchain (without parser) took 22904.07ms. Allocated memory was 151.0MB in the beginning and 432.0MB in the end (delta: 281.0MB). Free memory was 104.9MB in the beginning and 358.4MB in the end (delta: -253.5MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. [2022-11-26 01:05:40,996 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 151.0MB. Free memory was 119.5MB in the beginning and 119.3MB in the end (delta: 141.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 01:05:40,996 INFO L158 Benchmark]: CACSL2BoogieTranslator took 620.47ms. Allocated memory is still 151.0MB. Free memory was 104.9MB in the beginning and 83.0MB in the end (delta: 21.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-26 01:05:40,997 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.42ms. Allocated memory is still 151.0MB. Free memory was 83.0MB in the beginning and 80.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 01:05:40,997 INFO L158 Benchmark]: Boogie Preprocessor took 27.86ms. Allocated memory is still 151.0MB. Free memory was 80.9MB in the beginning and 79.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 01:05:40,998 INFO L158 Benchmark]: RCFGBuilder took 495.20ms. Allocated memory is still 151.0MB. Free memory was 79.7MB in the beginning and 65.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-26 01:05:40,998 INFO L158 Benchmark]: TraceAbstraction took 21649.81ms. Allocated memory was 151.0MB in the beginning and 432.0MB in the end (delta: 281.0MB). Free memory was 64.7MB in the beginning and 361.5MB in the end (delta: -296.8MB). Peak memory consumption was 205.4MB. Max. memory is 16.1GB. [2022-11-26 01:05:40,999 INFO L158 Benchmark]: Witness Printer took 58.71ms. Allocated memory is still 432.0MB. Free memory was 360.5MB in the beginning and 358.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 01:05:41,000 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.30ms. Allocated memory is still 151.0MB. Free memory was 119.5MB in the beginning and 119.3MB in the end (delta: 141.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 620.47ms. Allocated memory is still 151.0MB. Free memory was 104.9MB in the beginning and 83.0MB in the end (delta: 21.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.42ms. Allocated memory is still 151.0MB. Free memory was 83.0MB in the beginning and 80.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.86ms. Allocated memory is still 151.0MB. Free memory was 80.9MB in the beginning and 79.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 495.20ms. Allocated memory is still 151.0MB. Free memory was 79.7MB in the beginning and 65.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 21649.81ms. Allocated memory was 151.0MB in the beginning and 432.0MB in the end (delta: 281.0MB). Free memory was 64.7MB in the beginning and 361.5MB in the end (delta: -296.8MB). Peak memory consumption was 205.4MB. Max. memory is 16.1GB. * Witness Printer took 58.71ms. Allocated memory is still 432.0MB. Free memory was 360.5MB in the beginning and 358.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * 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: 767]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 767]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 774]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 774]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 774]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 774]: 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 2 procedures, 25 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 21.5s, OverallIterations: 8, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 116 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 116 mSDsluCounter, 333 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 238 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 824 IncrementalHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 95 mSDtfsCounter, 824 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 446 GetRequests, 298 SyntacticMatches, 16 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 9.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=6, InterpolantAutomatonStates: 77, 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, 8 MinimizatonAttempts, 24 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 12 PreInvPairs, 26 NumberOfFragments, 583 HoareAnnotationTreeSize, 12 FomulaSimplifications, 508 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1532 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 337 NumberOfCodeBlocks, 307 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 441 ConstructedInterpolants, 0 QuantifiedInterpolants, 997 SizeOfPredicates, 13 NumberOfNonLiveVariables, 665 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 264/411 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: OVERALL_TIME: 3.5s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 6, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 57, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 84, TOOLS_POST_TIME: 1.3s, TOOLS_POST_CALL_APPLICATIONS: 30, TOOLS_POST_CALL_TIME: 1.1s, TOOLS_POST_RETURN_APPLICATIONS: 24, TOOLS_POST_RETURN_TIME: 0.7s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 138, TOOLS_QUANTIFIERELIM_TIME: 3.0s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 197, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 24, DOMAIN_JOIN_TIME: 0.2s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 5, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 9, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 57, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 4, LOOP_SUMMARIZER_CACHE_MISSES: 4, LOOP_SUMMARIZER_OVERALL_TIME: 2.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 2.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 9, CALL_SUMMARIZER_APPLICATIONS: 24, CALL_SUMMARIZER_CACHE_MISSES: 3, CALL_SUMMARIZER_OVERALL_TIME: 0.1s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.1s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 693, DAG_COMPRESSION_RETAINED_NODES: 165, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 774]: Loop Invariant Derived loop invariant: (j + 1 <= 0 && i == 0) || ((((((((((((array == 0 && ldv_global_msg_list == 0) && i == j + 1) && p == 0) && 10 == len) && i <= 2147483648) || ((((((array == 0 && ldv_global_msg_list == 0) && p == 0) && 10 == len) && i <= 2147483648) && 0 <= j + 1) && j <= 2147483646)) && ldv_global_msg_list == 1) && #NULL == 0) && 1 <= i) && 0 <= unknown-#StackHeapBarrier-unknown) && p == 0) && #NULL == 0) - InvariantResult [Line: 760]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 760]: Loop Invariant Derived loop invariant: ((((((((((array == 0 && ldv_global_msg_list == 0) && i < 2147483647) && p == 0) && 10 == len) && ldv_global_msg_list == 1) && #NULL == 0) && 1 <= i) && 0 <= unknown-#StackHeapBarrier-unknown) && p == 0) && #NULL == 0) || i == 0 - InvariantResult [Line: 767]: Loop Invariant [2022-11-26 01:05:41,017 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 01:05:41,017 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 01:05:41,017 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 01:05:41,018 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 01:05:41,018 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 01:05:41,018 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 01:05:41,031 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 01:05:41,031 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 01:05:41,031 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 01:05:41,031 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 01:05:41,032 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 01:05:41,032 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((array < unknown-#StackHeapBarrier-unknown && ldv_global_msg_list == #memory_$Pointer$[ldv_global_msg_list][ldv_global_msg_list]) && unknown-#length-unknown[1] == 8) && unknown-#length-unknown[array] == len % 1073741824 * 4) && ldv_global_msg_list == #memory_$Pointer$[ldv_global_msg_list][ldv_global_msg_list + 4]) && array == 0) && \valid[array] == 1) && ldv_global_msg_list == 0) && 10 == len) && ldv_global_msg_list == #memory_$Pointer$[ldv_global_msg_list][ldv_global_msg_list + 4]) && \valid[1] == 1) && ldv_global_msg_list == 1) && \valid[0] == 0) && #NULL == 0) && i == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && #memory_$Pointer$[ldv_global_msg_list][ldv_global_msg_list] == ldv_global_msg_list) || ((((((((((((i <= 10 && array == 0) && ldv_global_msg_list == 0) && p == 0) && #memory_$Pointer$[array][i * 4 + -4 + array] == p) && p == #memory_$Pointer$[array][i * 4 + -4 + array]) && 10 == len) && ldv_global_msg_list == 1) && #NULL == 0) && !(p == 0)) && 1 <= i) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) RESULT: Ultimate proved your program to be correct! [2022-11-26 01:05:41,055 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73818caf-38e3-4762-8a29-a32eb8cfe5d6/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE