./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8393723b 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_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS --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 bb0a504b43b0de742fcc89ebbe9d313056bb1824edece6c56238a649b6f48626 --- 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-8393723 [2022-11-19 07:18:32,045 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:18:32,047 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:18:32,074 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:18:32,081 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:18:32,082 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:18:32,084 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:18:32,085 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:18:32,087 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:18:32,093 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:18:32,094 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:18:32,095 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:18:32,097 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:18:32,098 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:18:32,101 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:18:32,103 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:18:32,104 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:18:32,105 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:18:32,106 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:18:32,108 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:18:32,110 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:18:32,111 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:18:32,112 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:18:32,113 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:18:32,117 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:18:32,117 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:18:32,118 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:18:32,119 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:18:32,119 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:18:32,120 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:18:32,120 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:18:32,121 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:18:32,122 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:18:32,123 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:18:32,124 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:18:32,124 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:18:32,125 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:18:32,125 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:18:32,126 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:18:32,127 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:18:32,127 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:18:32,128 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-19 07:18:32,153 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:18:32,154 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:18:32,154 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:18:32,154 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:18:32,155 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:18:32,155 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:18:32,156 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:18:32,156 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:18:32,156 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:18:32,156 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 07:18:32,156 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:18:32,157 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:18:32,157 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 07:18:32,157 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 07:18:32,157 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:18:32,158 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 07:18:32,158 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 07:18:32,158 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 07:18:32,159 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:18:32,159 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:18:32,159 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 07:18:32,159 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:18:32,160 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:18:32,160 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:18:32,160 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 07:18:32,160 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:18:32,160 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 07:18:32,161 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-19 07:18:32,161 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:18:32,161 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 07:18:32,161 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:18:32,161 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 07:18:32,162 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:18:32,162 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:18:32,162 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:18:32,162 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:18:32,163 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 07:18:32,163 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:18:32,163 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 07:18:32,163 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 07:18:32,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 07:18:32,164 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 07:18:32,164 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:18:32,164 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_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/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_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS 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 -> bb0a504b43b0de742fcc89ebbe9d313056bb1824edece6c56238a649b6f48626 [2022-11-19 07:18:32,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:18:32,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:18:32,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:18:32,450 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:18:32,451 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:18:32,452 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2022-11-19 07:18:32,521 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/data/e092a9a50/bff947f3c6fc436099fab22204839fc7/FLAG1ebff04b3 [2022-11-19 07:18:33,104 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:18:33,105 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2022-11-19 07:18:33,120 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/data/e092a9a50/bff947f3c6fc436099fab22204839fc7/FLAG1ebff04b3 [2022-11-19 07:18:33,385 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/data/e092a9a50/bff947f3c6fc436099fab22204839fc7 [2022-11-19 07:18:33,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:18:33,389 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:18:33,394 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:18:33,395 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:18:33,401 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:18:33,402 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:18:33" (1/1) ... [2022-11-19 07:18:33,404 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@124ab2f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:18:33, skipping insertion in model container [2022-11-19 07:18:33,404 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:18:33" (1/1) ... [2022-11-19 07:18:33,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:18:33,460 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:18:33,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:18:33,920 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:18:33,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:18:34,011 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:18:34,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:18:34 WrapperNode [2022-11-19 07:18:34,012 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:18:34,013 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:18:34,013 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:18:34,013 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:18:34,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:18:34" (1/1) ... [2022-11-19 07:18:34,059 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:18:34" (1/1) ... [2022-11-19 07:18:34,101 INFO L138 Inliner]: procedures = 166, calls = 80, calls flagged for inlining = 24, calls inlined = 6, statements flattened = 102 [2022-11-19 07:18:34,102 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:18:34,103 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:18:34,103 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:18:34,104 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:18:34,113 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:18:34" (1/1) ... [2022-11-19 07:18:34,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:18:34" (1/1) ... [2022-11-19 07:18:34,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:18:34" (1/1) ... [2022-11-19 07:18:34,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:18:34" (1/1) ... [2022-11-19 07:18:34,121 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:18:34" (1/1) ... [2022-11-19 07:18:34,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:18:34" (1/1) ... [2022-11-19 07:18:34,127 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:18:34" (1/1) ... [2022-11-19 07:18:34,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:18:34" (1/1) ... [2022-11-19 07:18:34,138 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:18:34,140 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:18:34,140 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:18:34,141 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:18:34,142 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:18:34" (1/1) ... [2022-11-19 07:18:34,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:18:34,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:18:34,169 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:18:34,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:18:34,204 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-19 07:18:34,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-19 07:18:34,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-19 07:18:34,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:18:34,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-19 07:18:34,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-19 07:18:34,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 07:18:34,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-19 07:18:34,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:18:34,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:18:34,327 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:18:34,329 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:18:34,653 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:18:34,740 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:18:34,740 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-19 07:18:34,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:18:34 BoogieIcfgContainer [2022-11-19 07:18:34,743 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:18:34,745 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:18:34,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:18:34,749 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:18:34,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:18:33" (1/3) ... [2022-11-19 07:18:34,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d43706f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:18:34, skipping insertion in model container [2022-11-19 07:18:34,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:18:34" (2/3) ... [2022-11-19 07:18:34,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d43706f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:18:34, skipping insertion in model container [2022-11-19 07:18:34,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:18:34" (3/3) ... [2022-11-19 07:18:34,753 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2-2.i [2022-11-19 07:18:34,772 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:18:34,772 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-11-19 07:18:34,823 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:18:34,830 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;@28995a8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:18:34,830 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-11-19 07:18:34,835 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 32 states have internal predecessors, (38), 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-19 07:18:34,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-19 07:18:34,843 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:18:34,843 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:18:34,844 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-19 07:18:34,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:18:34,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1760724867, now seen corresponding path program 1 times [2022-11-19 07:18:34,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:18:34,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628454848] [2022-11-19 07:18:34,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:34,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:18:34,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:35,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:18:35,236 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:18:35,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628454848] [2022-11-19 07:18:35,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628454848] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:18:35,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:18:35,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:18:35,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090082740] [2022-11-19 07:18:35,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:18:35,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:18:35,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:18:35,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:18:35,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:18:35,276 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 32 states have internal predecessors, (38), 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.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 07:18:35,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:18:35,397 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-11-19 07:18:35,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:18:35,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2022-11-19 07:18:35,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:18:35,422 INFO L225 Difference]: With dead ends: 66 [2022-11-19 07:18:35,423 INFO L226 Difference]: Without dead ends: 60 [2022-11-19 07:18:35,427 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-19 07:18:35,434 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 31 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:18:35,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 115 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:18:35,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-19 07:18:35,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 37. [2022-11-19 07:18:35,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.625) internal successors, (39), 33 states have internal predecessors, (39), 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-19 07:18:35,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2022-11-19 07:18:35,484 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 8 [2022-11-19 07:18:35,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:18:35,485 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2022-11-19 07:18:35,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 07:18:35,485 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-11-19 07:18:35,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 07:18:35,487 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:18:35,487 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:18:35,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 07:18:35,488 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-19 07:18:35,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:18:35,489 INFO L85 PathProgramCache]: Analyzing trace with hash 681145425, now seen corresponding path program 1 times [2022-11-19 07:18:35,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:18:35,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067669645] [2022-11-19 07:18:35,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:35,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:18:35,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:35,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:18:35,692 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:18:35,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067669645] [2022-11-19 07:18:35,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067669645] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:18:35,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305156998] [2022-11-19 07:18:35,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:35,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:18:35,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:18:35,703 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:18:35,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 07:18:35,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:35,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 07:18:35,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:18:35,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:18:35,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:18:35,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:18:35,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305156998] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:18:35,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [758208135] [2022-11-19 07:18:35,936 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-19 07:18:35,937 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:18:35,940 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:18:35,946 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:18:35,947 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:18:36,103 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-19 07:18:36,113 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-19 07:18:36,457 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-19 07:18:36,488 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-19 07:18:36,500 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-19 07:18:36,589 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-19 07:18:36,597 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-19 07:18:36,615 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-19 07:18:36,667 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-19 07:18:36,676 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-19 07:18:36,686 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-19 07:18:36,746 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 51 for LOIs [2022-11-19 07:18:36,798 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:18:37,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [758208135] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:18:37,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:18:37,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 5, 5] total 18 [2022-11-19 07:18:37,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412894564] [2022-11-19 07:18:37,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:18:37,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-19 07:18:37,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:18:37,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-19 07:18:37,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-11-19 07:18:37,698 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 9 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 07:18:38,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:18:38,441 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2022-11-19 07:18:38,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-19 07:18:38,442 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-11-19 07:18:38,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:18:38,443 INFO L225 Difference]: With dead ends: 50 [2022-11-19 07:18:38,443 INFO L226 Difference]: Without dead ends: 48 [2022-11-19 07:18:38,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2022-11-19 07:18:38,445 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 49 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:18:38,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 147 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:18:38,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-19 07:18:38,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2022-11-19 07:18:38,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 32 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-19 07:18:38,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-11-19 07:18:38,465 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 11 [2022-11-19 07:18:38,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:18:38,465 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-11-19 07:18:38,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 07:18:38,465 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-11-19 07:18:38,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 07:18:38,467 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:18:38,467 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:18:38,473 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-19 07:18:38,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-11-19 07:18:38,673 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-19 07:18:38,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:18:38,674 INFO L85 PathProgramCache]: Analyzing trace with hash 699757211, now seen corresponding path program 1 times [2022-11-19 07:18:38,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:18:38,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190355831] [2022-11-19 07:18:38,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:38,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:18:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:38,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:18:38,814 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:18:38,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190355831] [2022-11-19 07:18:38,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190355831] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:18:38,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:18:38,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:18:38,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618359105] [2022-11-19 07:18:38,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:18:38,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:18:38,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:18:38,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:18:38,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:18:38,817 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 07:18:38,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:18:38,881 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-11-19 07:18:38,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:18:38,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-11-19 07:18:38,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:18:38,884 INFO L225 Difference]: With dead ends: 42 [2022-11-19 07:18:38,884 INFO L226 Difference]: Without dead ends: 40 [2022-11-19 07:18:38,885 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-19 07:18:38,886 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:18:38,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 75 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:18:38,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-19 07:18:38,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-11-19 07:18:38,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 35 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-19 07:18:38,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-11-19 07:18:38,902 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 11 [2022-11-19 07:18:38,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:18:38,902 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-11-19 07:18:38,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 07:18:38,903 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-11-19 07:18:38,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 07:18:38,903 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:18:38,904 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:18:38,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 07:18:38,904 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-19 07:18:38,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:18:38,905 INFO L85 PathProgramCache]: Analyzing trace with hash -245286596, now seen corresponding path program 1 times [2022-11-19 07:18:38,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:18:38,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308121032] [2022-11-19 07:18:38,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:38,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:18:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:38,956 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-19 07:18:38,957 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:18:38,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308121032] [2022-11-19 07:18:38,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308121032] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:18:38,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:18:38,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:18:38,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721371014] [2022-11-19 07:18:38,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:18:38,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:18:38,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:18:38,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:18:38,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:18:38,959 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-19 07:18:39,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:18:39,012 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-11-19 07:18:39,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:18:39,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 14 [2022-11-19 07:18:39,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:18:39,014 INFO L225 Difference]: With dead ends: 66 [2022-11-19 07:18:39,014 INFO L226 Difference]: Without dead ends: 64 [2022-11-19 07:18:39,015 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-19 07:18:39,016 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 19 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:18:39,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 48 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:18:39,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-19 07:18:39,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 46. [2022-11-19 07:18:39,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.5) internal successors, (48), 40 states have internal predecessors, (48), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 07:18:39,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2022-11-19 07:18:39,033 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 14 [2022-11-19 07:18:39,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:18:39,034 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2022-11-19 07:18:39,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-19 07:18:39,034 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2022-11-19 07:18:39,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 07:18:39,035 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:18:39,035 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:18:39,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 07:18:39,036 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-19 07:18:39,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:18:39,036 INFO L85 PathProgramCache]: Analyzing trace with hash -245284497, now seen corresponding path program 1 times [2022-11-19 07:18:39,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:18:39,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842112493] [2022-11-19 07:18:39,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:39,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:18:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:39,098 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-19 07:18:39,098 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:18:39,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842112493] [2022-11-19 07:18:39,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842112493] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:18:39,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:18:39,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:18:39,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378722398] [2022-11-19 07:18:39,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:18:39,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:18:39,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:18:39,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:18:39,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:18:39,101 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-19 07:18:39,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:18:39,167 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-11-19 07:18:39,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:18:39,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 14 [2022-11-19 07:18:39,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:18:39,168 INFO L225 Difference]: With dead ends: 64 [2022-11-19 07:18:39,168 INFO L226 Difference]: Without dead ends: 62 [2022-11-19 07:18:39,169 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-19 07:18:39,170 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:18:39,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 68 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:18:39,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-19 07:18:39,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2022-11-19 07:18:39,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 42 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 07:18:39,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2022-11-19 07:18:39,188 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 14 [2022-11-19 07:18:39,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:18:39,188 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2022-11-19 07:18:39,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-19 07:18:39,188 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2022-11-19 07:18:39,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 07:18:39,189 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:18:39,189 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:18:39,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 07:18:39,190 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-19 07:18:39,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:18:39,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1304044262, now seen corresponding path program 1 times [2022-11-19 07:18:39,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:18:39,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086621983] [2022-11-19 07:18:39,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:39,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:18:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:39,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:18:39,265 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:18:39,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086621983] [2022-11-19 07:18:39,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086621983] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:18:39,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653961960] [2022-11-19 07:18:39,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:39,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:18:39,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:18:39,271 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:18:39,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-19 07:18:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:39,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 07:18:39,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:18:39,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:18:39,419 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:18:39,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653961960] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:18:39,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 07:18:39,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2022-11-19 07:18:39,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136279221] [2022-11-19 07:18:39,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:18:39,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:18:39,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:18:39,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:18:39,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-19 07:18:39,421 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 07:18:39,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:18:39,505 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2022-11-19 07:18:39,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:18:39,505 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-11-19 07:18:39,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:18:39,506 INFO L225 Difference]: With dead ends: 82 [2022-11-19 07:18:39,506 INFO L226 Difference]: Without dead ends: 73 [2022-11-19 07:18:39,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-19 07:18:39,508 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 42 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:18:39,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 135 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:18:39,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-19 07:18:39,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2022-11-19 07:18:39,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.46) internal successors, (73), 57 states have internal predecessors, (73), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-19 07:18:39,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2022-11-19 07:18:39,544 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 83 transitions. Word has length 14 [2022-11-19 07:18:39,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:18:39,545 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 83 transitions. [2022-11-19 07:18:39,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 07:18:39,545 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 83 transitions. [2022-11-19 07:18:39,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 07:18:39,546 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:18:39,546 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:18:39,555 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-19 07:18:39,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:18:39,753 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-19 07:18:39,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:18:39,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1593505982, now seen corresponding path program 1 times [2022-11-19 07:18:39,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:18:39,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629915406] [2022-11-19 07:18:39,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:39,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:18:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:39,829 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-19 07:18:39,830 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:18:39,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629915406] [2022-11-19 07:18:39,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629915406] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:18:39,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:18:39,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:18:39,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846833192] [2022-11-19 07:18:39,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:18:39,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:18:39,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:18:39,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:18:39,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:18:39,834 INFO L87 Difference]: Start difference. First operand 65 states and 83 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-19 07:18:39,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:18:39,905 INFO L93 Difference]: Finished difference Result 111 states and 133 transitions. [2022-11-19 07:18:39,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:18:39,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-11-19 07:18:39,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:18:39,907 INFO L225 Difference]: With dead ends: 111 [2022-11-19 07:18:39,907 INFO L226 Difference]: Without dead ends: 91 [2022-11-19 07:18:39,908 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-19 07:18:39,909 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 24 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:18:39,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 83 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:18:39,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-19 07:18:39,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 64. [2022-11-19 07:18:39,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 56 states have internal predecessors, (71), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-19 07:18:39,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 81 transitions. [2022-11-19 07:18:39,928 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 81 transitions. Word has length 17 [2022-11-19 07:18:39,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:18:39,928 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 81 transitions. [2022-11-19 07:18:39,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-19 07:18:39,928 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2022-11-19 07:18:39,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 07:18:39,929 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:18:39,929 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:18:39,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 07:18:39,930 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-19 07:18:39,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:18:39,930 INFO L85 PathProgramCache]: Analyzing trace with hash 978495982, now seen corresponding path program 1 times [2022-11-19 07:18:39,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:18:39,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394451672] [2022-11-19 07:18:39,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:39,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:18:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:40,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:18:40,000 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:18:40,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394451672] [2022-11-19 07:18:40,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394451672] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:18:40,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361689333] [2022-11-19 07:18:40,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:40,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:18:40,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:18:40,002 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:18:40,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-19 07:18:40,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:40,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 07:18:40,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:18:40,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:18:40,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:18:40,185 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:18:40,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361689333] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:18:40,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [669973328] [2022-11-19 07:18:40,191 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-19 07:18:40,191 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:18:40,191 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:18:40,192 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:18:40,192 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:18:40,246 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-19 07:18:40,252 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-19 07:18:40,395 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-19 07:18:40,404 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-19 07:18:40,420 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-19 07:18:40,476 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-19 07:18:40,485 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-19 07:18:40,498 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-19 07:18:40,536 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-19 07:18:40,542 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-19 07:18:40,549 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-19 07:18:40,578 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-19 07:18:40,586 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-19 07:18:40,592 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-19 07:18:40,637 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:18:40,661 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 51 for LOIs [2022-11-19 07:18:40,697 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:18:41,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [669973328] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:18:41,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:18:41,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5, 5, 5] total 20 [2022-11-19 07:18:41,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784110682] [2022-11-19 07:18:41,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:18:41,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-19 07:18:41,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:18:41,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-19 07:18:41,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2022-11-19 07:18:41,870 INFO L87 Difference]: Start difference. First operand 64 states and 81 transitions. Second operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 07:18:42,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:18:42,811 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-11-19 07:18:42,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-19 07:18:42,812 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-11-19 07:18:42,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:18:42,813 INFO L225 Difference]: With dead ends: 82 [2022-11-19 07:18:42,813 INFO L226 Difference]: Without dead ends: 73 [2022-11-19 07:18:42,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2022-11-19 07:18:42,814 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 56 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:18:42,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 126 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:18:42,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-19 07:18:42,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2022-11-19 07:18:42,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 56 states have internal predecessors, (70), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-19 07:18:42,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2022-11-19 07:18:42,842 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 17 [2022-11-19 07:18:42,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:18:42,842 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2022-11-19 07:18:42,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 07:18:42,843 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2022-11-19 07:18:42,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 07:18:42,849 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:18:42,850 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:18:42,858 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-19 07:18:43,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:18:43,059 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-19 07:18:43,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:18:43,059 INFO L85 PathProgramCache]: Analyzing trace with hash 904044068, now seen corresponding path program 1 times [2022-11-19 07:18:43,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:18:43,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45527336] [2022-11-19 07:18:43,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:43,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:18:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:43,161 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-19 07:18:43,162 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:18:43,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45527336] [2022-11-19 07:18:43,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45527336] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:18:43,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708096298] [2022-11-19 07:18:43,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:43,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:18:43,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:18:43,164 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:18:43,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-19 07:18:43,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:43,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 07:18:43,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:18:43,278 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-19 07:18:43,278 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:18:43,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708096298] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:18:43,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 07:18:43,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2022-11-19 07:18:43,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894303991] [2022-11-19 07:18:43,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:18:43,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:18:43,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:18:43,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:18:43,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:18:43,280 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 07:18:43,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:18:43,334 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2022-11-19 07:18:43,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:18:43,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-11-19 07:18:43,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:18:43,335 INFO L225 Difference]: With dead ends: 76 [2022-11-19 07:18:43,335 INFO L226 Difference]: Without dead ends: 49 [2022-11-19 07:18:43,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:18:43,336 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 3 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:18:43,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 76 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:18:43,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-19 07:18:43,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2022-11-19 07:18:43,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 41 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-19 07:18:43,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2022-11-19 07:18:43,348 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 22 [2022-11-19 07:18:43,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:18:43,349 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2022-11-19 07:18:43,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 07:18:43,349 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-11-19 07:18:43,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-19 07:18:43,350 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:18:43,350 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-19 07:18:43,362 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-19 07:18:43,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:18:43,562 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-19 07:18:43,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:18:43,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1125078776, now seen corresponding path program 1 times [2022-11-19 07:18:43,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:18:43,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832215496] [2022-11-19 07:18:43,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:43,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:18:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:43,646 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-19 07:18:43,647 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:18:43,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832215496] [2022-11-19 07:18:43,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832215496] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:18:43,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888188678] [2022-11-19 07:18:43,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:43,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:18:43,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:18:43,649 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:18:43,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-19 07:18:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:43,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 07:18:43,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:18:43,785 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-19 07:18:43,786 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:18:43,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888188678] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:18:43,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 07:18:43,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-11-19 07:18:43,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679512846] [2022-11-19 07:18:43,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:18:43,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:18:43,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:18:43,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:18:43,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:18:43,788 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-19 07:18:43,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:18:43,835 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-11-19 07:18:43,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:18:43,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-11-19 07:18:43,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:18:43,838 INFO L225 Difference]: With dead ends: 47 [2022-11-19 07:18:43,838 INFO L226 Difference]: Without dead ends: 46 [2022-11-19 07:18:43,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:18:43,839 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:18:43,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 47 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:18:43,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-19 07:18:43,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-11-19 07:18:43,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 40 states have internal predecessors, (46), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-19 07:18:43,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2022-11-19 07:18:43,856 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 25 [2022-11-19 07:18:43,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:18:43,857 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2022-11-19 07:18:43,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-19 07:18:43,857 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2022-11-19 07:18:43,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-19 07:18:43,858 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:18:43,858 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:18:43,874 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-19 07:18:44,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:18:44,066 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-19 07:18:44,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:18:44,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1125080875, now seen corresponding path program 1 times [2022-11-19 07:18:44,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:18:44,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716638274] [2022-11-19 07:18:44,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:44,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:18:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:44,200 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-19 07:18:44,201 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:18:44,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716638274] [2022-11-19 07:18:44,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716638274] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:18:44,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89288511] [2022-11-19 07:18:44,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:44,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:18:44,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:18:44,203 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:18:44,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-19 07:18:44,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:44,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-19 07:18:44,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:18:44,398 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:18:44,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:18:44,490 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 07:18:44,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89288511] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:18:44,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1056249541] [2022-11-19 07:18:44,492 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-19 07:18:44,492 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:18:44,493 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:18:44,493 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:18:44,493 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:18:44,535 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-19 07:18:44,542 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-19 07:18:44,646 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-19 07:18:44,657 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-19 07:18:44,666 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-19 07:18:44,706 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-19 07:18:44,713 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-19 07:18:44,728 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-19 07:18:44,777 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-19 07:18:44,787 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-19 07:18:44,795 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-19 07:18:44,942 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-19 07:18:44,956 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-19 07:18:44,971 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-19 07:18:45,267 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-19 07:18:45,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-19 07:18:45,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-19 07:18:45,512 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-19 07:18:45,521 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-19 07:18:45,529 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-19 07:18:45,627 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 65 for LOIs [2022-11-19 07:18:45,711 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:18:48,200 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2228#(and (<= 0 |ULTIMATE.start_entry_point_~len~0#1|) (<= |ULTIMATE.start_ldv_positive_#res#1| 16777216) (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0) (<= 0 (+ |ULTIMATE.start_ldv_positive_~r~1#1| 2147483648)) (<= 0 |ULTIMATE.start_entry_point_~i~2#1|) (<= 0 |ULTIMATE.start_ldv_positive_#res#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0) (= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0) (<= |ULTIMATE.start_alloc_17_#in~array#1.offset| 0) (<= 0 |ULTIMATE.start_alloc_17_~array#1.offset|) (= |~#ldv_global_msg_list~0.offset| 0) (= |ULTIMATE.start_alloc_17_~p~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_17_~array#1.base|) (+ (* |ULTIMATE.start_alloc_17_~i~0#1| 4) |ULTIMATE.start_alloc_17_~array#1.offset|))) (<= |ULTIMATE.start_alloc_17_#in~len#1| 16777216) (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|) (<= |ULTIMATE.start_entry_point_~len~0#1| 16777216) (not (<= |ULTIMATE.start_alloc_17_#t~post38#1| 2147483646)) (<= 0 |ULTIMATE.start_alloc_17_#in~len#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_17_~array#1.base|) (+ (* |ULTIMATE.start_alloc_17_~i~0#1| 4) |ULTIMATE.start_alloc_17_~array#1.offset|)) |ULTIMATE.start_alloc_17_~p~0#1.offset|) (not (= |ULTIMATE.start_alloc_17_~p~0#1.base| 0)) (<= |ULTIMATE.start_ldv_positive_~r~1#1| 16777216) (<= |ULTIMATE.start_alloc_17_~len#1| 16777216) (<= 0 |ULTIMATE.start_alloc_17_~len#1|) (= |ULTIMATE.start_alloc_17_~i~0#1| |ULTIMATE.start_alloc_17_#t~post38#1|) (= |~#ldv_global_msg_list~0.base| 1) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-19 07:18:48,200 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:18:48,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:18:48,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 15 [2022-11-19 07:18:48,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247578026] [2022-11-19 07:18:48,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:18:48,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-19 07:18:48,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:18:48,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-19 07:18:48,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2022-11-19 07:18:48,202 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 6 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-11-19 07:18:48,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:18:48,594 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2022-11-19 07:18:48,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-19 07:18:48,595 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 6 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 25 [2022-11-19 07:18:48,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:18:48,597 INFO L225 Difference]: With dead ends: 156 [2022-11-19 07:18:48,597 INFO L226 Difference]: Without dead ends: 129 [2022-11-19 07:18:48,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=142, Invalid=1118, Unknown=0, NotChecked=0, Total=1260 [2022-11-19 07:18:48,599 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 131 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:18:48,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 278 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:18:48,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-19 07:18:48,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 61. [2022-11-19 07:18:48,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 53 states have internal predecessors, (63), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-19 07:18:48,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2022-11-19 07:18:48,620 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 25 [2022-11-19 07:18:48,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:18:48,620 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2022-11-19 07:18:48,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 6 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-11-19 07:18:48,621 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-11-19 07:18:48,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-19 07:18:48,622 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:18:48,623 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:18:48,634 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-19 07:18:48,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-19 07:18:48,833 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-19 07:18:48,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:18:48,833 INFO L85 PathProgramCache]: Analyzing trace with hash -782412162, now seen corresponding path program 1 times [2022-11-19 07:18:48,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:18:48,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343090788] [2022-11-19 07:18:48,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:48,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:18:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:48,909 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 07:18:48,910 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:18:48,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343090788] [2022-11-19 07:18:48,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343090788] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:18:48,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859093824] [2022-11-19 07:18:48,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:48,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:18:48,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:18:48,912 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:18:48,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-19 07:18:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:49,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-19 07:18:49,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:18:49,110 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:18:49,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:18:49,203 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:18:49,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859093824] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:18:49,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [894075804] [2022-11-19 07:18:49,205 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-11-19 07:18:49,206 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:18:49,206 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:18:49,206 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:18:49,206 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:18:49,252 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-19 07:18:49,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-19 07:18:49,369 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-19 07:18:49,380 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-19 07:18:49,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-19 07:18:49,425 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-19 07:18:49,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-19 07:18:49,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-19 07:18:49,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-19 07:18:49,486 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-19 07:18:49,493 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-19 07:18:49,707 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-19 07:18:49,782 INFO L321 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-11-19 07:18:49,782 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 24 treesize of output 26 [2022-11-19 07:18:49,899 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-19 07:18:49,995 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-19 07:18:50,161 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 69 for LOIs [2022-11-19 07:18:50,260 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:18:54,350 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2709#(and (<= 0 |ULTIMATE.start_entry_point_~len~0#1|) (< 2147483646 |ULTIMATE.start_free_17_#t~post42#1|) (<= |ULTIMATE.start_ldv_positive_#res#1| 16777216) (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0) (<= 0 (+ |ULTIMATE.start_ldv_positive_~r~1#1| 2147483648)) (<= 0 |ULTIMATE.start_entry_point_~i~2#1|) (<= 0 |ULTIMATE.start_ldv_positive_#res#1|) (<= |ULTIMATE.start_free_17_~array#1.offset| 0) (<= 0 |ULTIMATE.start_free_17_~len#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_alloc_17_~j~0#1| 1)) (= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0) (<= |ULTIMATE.start_alloc_17_#in~array#1.offset| 0) (<= 0 |ULTIMATE.start_alloc_17_~array#1.offset|) (= |~#ldv_global_msg_list~0.offset| 0) (<= |ULTIMATE.start_alloc_17_#in~len#1| 16777216) (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|) (<= |ULTIMATE.start_entry_point_~len~0#1| 16777216) (= |ULTIMATE.start_alloc_17_~p~0#1.base| 0) (= |ULTIMATE.start_alloc_17_~i~0#1| 0) (<= 0 |ULTIMATE.start_alloc_17_#in~len#1|) (<= |ULTIMATE.start_free_17_#in~len#1| 16777216) (<= 0 |ULTIMATE.start_free_17_#in~len#1|) (<= 0 |ULTIMATE.start_free_17_~i~1#1|) (<= |ULTIMATE.start_ldv_positive_~r~1#1| 16777216) (<= |ULTIMATE.start_alloc_17_~len#1| 16777216) (<= |~#ldv_global_msg_list~0.base| 1) (<= 0 |ULTIMATE.start_alloc_17_~len#1|) (<= (+ |ULTIMATE.start_alloc_17_~j~0#1| 1) 0) (= 3 |ULTIMATE.start_alloc_17_#res#1|) (= |#NULL.offset| 0) (<= 1 |~#ldv_global_msg_list~0.base|) (<= 0 |ULTIMATE.start_free_17_~array#1.offset|) (<= |ULTIMATE.start_free_17_~len#1| 16777216) (<= 0 |ULTIMATE.start_free_17_#in~array#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_free_17_#in~array#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-19 07:18:54,350 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:18:54,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:18:54,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 16 [2022-11-19 07:18:54,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306931475] [2022-11-19 07:18:54,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:18:54,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-19 07:18:54,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:18:54,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-19 07:18:54,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=997, Unknown=0, NotChecked=0, Total=1122 [2022-11-19 07:18:54,352 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-19 07:18:54,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:18:54,662 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2022-11-19 07:18:54,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-19 07:18:54,664 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-11-19 07:18:54,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:18:54,665 INFO L225 Difference]: With dead ends: 80 [2022-11-19 07:18:54,665 INFO L226 Difference]: Without dead ends: 60 [2022-11-19 07:18:54,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=180, Invalid=1460, Unknown=0, NotChecked=0, Total=1640 [2022-11-19 07:18:54,666 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 46 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:18:54,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 247 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:18:54,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-19 07:18:54,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2022-11-19 07:18:54,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 49 states have internal predecessors, (57), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 07:18:54,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2022-11-19 07:18:54,684 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 25 [2022-11-19 07:18:54,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:18:54,685 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2022-11-19 07:18:54,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-19 07:18:54,685 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2022-11-19 07:18:54,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-19 07:18:54,686 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:18:54,686 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:18:54,704 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-19 07:18:54,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-19 07:18:54,894 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-19 07:18:54,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:18:54,895 INFO L85 PathProgramCache]: Analyzing trace with hash -493373628, now seen corresponding path program 1 times [2022-11-19 07:18:54,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:18:54,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808615618] [2022-11-19 07:18:54,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:54,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:18:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:55,007 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-19 07:18:55,007 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:18:55,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808615618] [2022-11-19 07:18:55,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808615618] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:18:55,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995641955] [2022-11-19 07:18:55,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:55,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:18:55,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:18:55,011 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:18:55,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-19 07:18:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:55,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 07:18:55,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:18:55,165 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-19 07:18:55,165 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:18:55,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995641955] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:18:55,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 07:18:55,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-19 07:18:55,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775851559] [2022-11-19 07:18:55,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:18:55,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:18:55,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:18:55,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:18:55,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:18:55,169 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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-19 07:18:55,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:18:55,243 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2022-11-19 07:18:55,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:18:55,243 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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 29 [2022-11-19 07:18:55,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:18:55,244 INFO L225 Difference]: With dead ends: 67 [2022-11-19 07:18:55,244 INFO L226 Difference]: Without dead ends: 65 [2022-11-19 07:18:55,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-19 07:18:55,249 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 37 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:18:55,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 71 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:18:55,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-19 07:18:55,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2022-11-19 07:18:55,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 47 states have internal predecessors, (55), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 07:18:55,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-11-19 07:18:55,266 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 29 [2022-11-19 07:18:55,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:18:55,268 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-11-19 07:18:55,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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-19 07:18:55,269 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-11-19 07:18:55,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-19 07:18:55,272 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:18:55,272 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:18:55,283 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-19 07:18:55,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:18:55,478 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-19 07:18:55,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:18:55,478 INFO L85 PathProgramCache]: Analyzing trace with hash 503949472, now seen corresponding path program 1 times [2022-11-19 07:18:55,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:18:55,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452539230] [2022-11-19 07:18:55,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:55,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:18:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:55,580 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-19 07:18:55,580 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:18:55,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452539230] [2022-11-19 07:18:55,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452539230] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:18:55,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600892094] [2022-11-19 07:18:55,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:55,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:18:55,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:18:55,583 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:18:55,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-19 07:18:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:55,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 07:18:55,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:18:55,706 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-19 07:18:55,706 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:18:55,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600892094] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:18:55,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 07:18:55,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-19 07:18:55,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891908699] [2022-11-19 07:18:55,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:18:55,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:18:55,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:18:55,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:18:55,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:18:55,709 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-19 07:18:55,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:18:55,778 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-11-19 07:18:55,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:18:55,779 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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 29 [2022-11-19 07:18:55,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:18:55,782 INFO L225 Difference]: With dead ends: 54 [2022-11-19 07:18:55,782 INFO L226 Difference]: Without dead ends: 53 [2022-11-19 07:18:55,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 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-19 07:18:55,783 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:18:55,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 101 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:18:55,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-19 07:18:55,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-19 07:18:55,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 43 states have (on average 1.255813953488372) internal successors, (54), 46 states have internal predecessors, (54), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 07:18:55,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2022-11-19 07:18:55,797 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 29 [2022-11-19 07:18:55,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:18:55,797 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2022-11-19 07:18:55,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-19 07:18:55,798 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2022-11-19 07:18:55,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-19 07:18:55,798 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:18:55,798 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:18:55,805 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-19 07:18:56,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:18:56,005 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-19 07:18:56,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:18:56,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1685648934, now seen corresponding path program 1 times [2022-11-19 07:18:56,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:18:56,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691558033] [2022-11-19 07:18:56,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:56,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:18:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:56,125 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-19 07:18:56,125 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:18:56,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691558033] [2022-11-19 07:18:56,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691558033] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:18:56,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316998665] [2022-11-19 07:18:56,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:56,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:18:56,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:18:56,127 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:18:56,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-19 07:18:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:56,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 07:18:56,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:18:56,292 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-19 07:18:56,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:18:56,361 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-19 07:18:56,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316998665] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:18:56,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1888526874] [2022-11-19 07:18:56,366 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-11-19 07:18:56,366 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:18:56,366 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:18:56,367 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:18:56,367 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:18:56,412 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-19 07:18:56,417 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-19 07:18:56,520 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-19 07:18:56,533 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-19 07:18:56,540 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-19 07:18:56,577 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-19 07:18:56,583 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-19 07:18:56,593 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-19 07:18:56,622 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-19 07:18:56,632 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-19 07:18:56,639 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-19 07:18:56,789 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-19 07:18:56,808 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-19 07:18:56,816 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-19 07:18:57,097 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-19 07:18:57,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-19 07:18:57,121 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-19 07:18:57,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-11-19 07:18:57,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 07:18:57,379 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-19 07:18:57,391 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-19 07:18:57,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-19 07:18:57,476 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-19 07:18:57,485 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-19 07:18:57,560 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 65 for LOIs [2022-11-19 07:18:57,662 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:19:00,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1888526874] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:19:00,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:19:00,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [6, 6, 6] total 30 [2022-11-19 07:19:00,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804857391] [2022-11-19 07:19:00,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:19:00,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-19 07:19:00,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:19:00,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-19 07:19:00,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2022-11-19 07:19:00,947 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 19 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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-19 07:19:03,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:19:03,005 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2022-11-19 07:19:03,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-19 07:19:03,005 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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 31 [2022-11-19 07:19:03,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:19:03,007 INFO L225 Difference]: With dead ends: 76 [2022-11-19 07:19:03,007 INFO L226 Difference]: Without dead ends: 74 [2022-11-19 07:19:03,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=245, Invalid=1477, Unknown=0, NotChecked=0, Total=1722 [2022-11-19 07:19:03,011 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 69 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 07:19:03,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 84 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 293 Invalid, 0 Unknown, 7 Unchecked, 0.4s Time] [2022-11-19 07:19:03,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-19 07:19:03,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 47. [2022-11-19 07:19:03,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-19 07:19:03,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2022-11-19 07:19:03,029 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 31 [2022-11-19 07:19:03,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:19:03,029 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2022-11-19 07:19:03,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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-19 07:19:03,029 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2022-11-19 07:19:03,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-19 07:19:03,030 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:19:03,030 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, 1, 1, 1] [2022-11-19 07:19:03,035 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-19 07:19:03,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-19 07:19:03,231 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-19 07:19:03,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:19:03,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1035856853, now seen corresponding path program 2 times [2022-11-19 07:19:03,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:19:03,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725364357] [2022-11-19 07:19:03,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:19:03,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:19:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:19:03,542 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:19:03,542 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:19:03,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725364357] [2022-11-19 07:19:03,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725364357] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:19:03,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749091891] [2022-11-19 07:19:03,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 07:19:03,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:19:03,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:19:03,544 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:19:03,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-19 07:19:03,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-19 07:19:03,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:19:03,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 07:19:03,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:19:03,722 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 07:19:03,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:19:03,806 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 07:19:03,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749091891] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:19:03,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [87757045] [2022-11-19 07:19:03,809 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-11-19 07:19:03,809 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:19:03,810 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:19:03,810 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:19:03,810 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:19:03,847 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-19 07:19:03,853 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-19 07:19:03,959 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-19 07:19:03,967 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-19 07:19:03,978 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-19 07:19:04,010 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-19 07:19:04,020 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-19 07:19:04,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-19 07:19:04,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-19 07:19:04,067 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-19 07:19:04,073 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-19 07:19:04,277 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-19 07:19:04,355 INFO L321 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-11-19 07:19:04,355 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 24 treesize of output 26 [2022-11-19 07:19:04,458 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-19 07:19:04,553 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-19 07:19:04,696 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 69 for LOIs [2022-11-19 07:19:04,761 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:19:08,746 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4041#(and (<= 0 |ULTIMATE.start_entry_point_~len~0#1|) (< 2147483646 |ULTIMATE.start_free_17_#t~post42#1|) (<= |ULTIMATE.start_ldv_positive_#res#1| 16777216) (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0) (<= 0 (+ |ULTIMATE.start_ldv_positive_~r~1#1| 2147483648)) (<= 0 |ULTIMATE.start_entry_point_~i~2#1|) (<= 0 |ULTIMATE.start_ldv_positive_#res#1|) (<= |ULTIMATE.start_free_17_~array#1.offset| 0) (<= 0 |ULTIMATE.start_free_17_~len#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_alloc_17_~j~0#1| 1)) (= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0) (<= |ULTIMATE.start_alloc_17_#in~array#1.offset| 0) (<= 0 |ULTIMATE.start_alloc_17_~array#1.offset|) (= |~#ldv_global_msg_list~0.offset| 0) (<= |ULTIMATE.start_alloc_17_#in~len#1| 16777216) (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|) (<= |ULTIMATE.start_entry_point_~len~0#1| 16777216) (= |ULTIMATE.start_alloc_17_~p~0#1.base| 0) (= |ULTIMATE.start_alloc_17_~i~0#1| 0) (<= 0 |ULTIMATE.start_alloc_17_#in~len#1|) (<= |ULTIMATE.start_free_17_#in~len#1| 16777216) (<= 0 |ULTIMATE.start_free_17_#in~len#1|) (<= 0 |ULTIMATE.start_free_17_~i~1#1|) (<= |ULTIMATE.start_ldv_positive_~r~1#1| 16777216) (<= |ULTIMATE.start_alloc_17_~len#1| 16777216) (<= |~#ldv_global_msg_list~0.base| 1) (<= 0 |ULTIMATE.start_alloc_17_~len#1|) (<= (+ |ULTIMATE.start_alloc_17_~j~0#1| 1) 0) (= 3 |ULTIMATE.start_alloc_17_#res#1|) (= |#NULL.offset| 0) (<= 1 |~#ldv_global_msg_list~0.base|) (<= 0 |ULTIMATE.start_free_17_~array#1.offset|) (<= |ULTIMATE.start_free_17_~len#1| 16777216) (<= 0 |ULTIMATE.start_free_17_#in~array#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_free_17_#in~array#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-19 07:19:08,746 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:19:08,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:19:08,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 4, 4] total 19 [2022-11-19 07:19:08,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558917063] [2022-11-19 07:19:08,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:19:08,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-19 07:19:08,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:19:08,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-19 07:19:08,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1172, Unknown=0, NotChecked=0, Total=1332 [2022-11-19 07:19:08,749 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 19 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 19 states have internal predecessors, (64), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-19 07:19:09,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:19:09,174 INFO L93 Difference]: Finished difference Result 85 states and 101 transitions. [2022-11-19 07:19:09,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-19 07:19:09,175 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 19 states have internal predecessors, (64), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 31 [2022-11-19 07:19:09,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:19:09,175 INFO L225 Difference]: With dead ends: 85 [2022-11-19 07:19:09,175 INFO L226 Difference]: Without dead ends: 58 [2022-11-19 07:19:09,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=297, Invalid=2153, Unknown=0, NotChecked=0, Total=2450 [2022-11-19 07:19:09,177 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 83 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:19:09,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 167 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:19:09,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-19 07:19:09,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 34. [2022-11-19 07:19:09,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-19 07:19:09,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-11-19 07:19:09,187 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 31 [2022-11-19 07:19:09,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:19:09,188 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-11-19 07:19:09,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 19 states have internal predecessors, (64), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-19 07:19:09,188 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-11-19 07:19:09,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-19 07:19:09,189 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:19:09,189 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:19:09,203 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-19 07:19:09,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-19 07:19:09,395 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-19 07:19:09,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:19:09,395 INFO L85 PathProgramCache]: Analyzing trace with hash -715509284, now seen corresponding path program 1 times [2022-11-19 07:19:09,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:19:09,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884613905] [2022-11-19 07:19:09,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:19:09,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:19:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:19:09,447 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-19 07:19:09,448 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:19:09,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884613905] [2022-11-19 07:19:09,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884613905] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:19:09,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:19:09,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:19:09,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727327821] [2022-11-19 07:19:09,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:19:09,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:19:09,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:19:09,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:19:09,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:19:09,450 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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-19 07:19:09,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:19:09,474 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-11-19 07:19:09,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:19:09,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 32 [2022-11-19 07:19:09,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:19:09,475 INFO L225 Difference]: With dead ends: 34 [2022-11-19 07:19:09,476 INFO L226 Difference]: Without dead ends: 33 [2022-11-19 07:19:09,476 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-19 07:19:09,477 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:19:09,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 30 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:19:09,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-19 07:19:09,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-11-19 07:19:09,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-19 07:19:09,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-11-19 07:19:09,486 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 32 [2022-11-19 07:19:09,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:19:09,487 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-11-19 07:19:09,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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-19 07:19:09,487 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-11-19 07:19:09,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-19 07:19:09,487 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:19:09,488 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:19:09,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-19 07:19:09,488 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-19 07:19:09,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:19:09,488 INFO L85 PathProgramCache]: Analyzing trace with hash -409649550, now seen corresponding path program 1 times [2022-11-19 07:19:09,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:19:09,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56554294] [2022-11-19 07:19:09,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:19:09,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:19:09,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:19:09,606 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-19 07:19:09,607 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:19:09,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56554294] [2022-11-19 07:19:09,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56554294] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:19:09,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712824809] [2022-11-19 07:19:09,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:19:09,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:19:09,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:19:09,611 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:19:09,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-19 07:19:09,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:19:09,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 07:19:09,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:19:09,799 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-19 07:19:09,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:19:09,867 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-19 07:19:09,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712824809] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:19:09,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1481543358] [2022-11-19 07:19:09,872 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-11-19 07:19:09,873 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:19:09,873 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:19:09,873 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:19:09,873 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:19:09,908 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-19 07:19:09,912 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-19 07:19:10,016 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-19 07:19:10,022 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-19 07:19:10,029 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-19 07:19:10,066 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-19 07:19:10,072 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-19 07:19:10,079 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-19 07:19:10,109 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-19 07:19:10,116 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-19 07:19:10,124 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-19 07:19:10,267 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-19 07:19:10,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-19 07:19:10,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-19 07:19:10,529 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-19 07:19:10,540 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-19 07:19:10,554 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-19 07:19:10,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-11-19 07:19:10,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 07:19:10,808 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-19 07:19:10,816 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-19 07:19:10,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 27 [2022-11-19 07:19:10,916 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 0 case distinctions, treesize of input 42 treesize of output 33 [2022-11-19 07:19:10,937 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 07:19:10,938 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 12 treesize of output 14 [2022-11-19 07:19:10,956 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-19 07:19:11,025 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-19 07:19:11,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-11-19 07:19:11,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 07:19:11,054 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-19 07:19:11,099 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-19 07:19:11,107 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-19 07:19:11,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-11-19 07:19:11,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 07:19:11,171 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-19 07:19:11,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-19 07:19:11,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 15 treesize of output 11 [2022-11-19 07:19:11,277 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 69 for LOIs [2022-11-19 07:19:11,377 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:19:14,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1481543358] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:19:14,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:19:14,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [8, 8, 8] total 27 [2022-11-19 07:19:14,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739302109] [2022-11-19 07:19:14,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:19:14,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-19 07:19:14,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:19:14,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-19 07:19:14,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2022-11-19 07:19:14,196 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 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-19 07:19:16,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:19:16,042 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-11-19 07:19:16,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-19 07:19:16,042 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 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 34 [2022-11-19 07:19:16,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:19:16,043 INFO L225 Difference]: With dead ends: 33 [2022-11-19 07:19:16,043 INFO L226 Difference]: Without dead ends: 0 [2022-11-19 07:19:16,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 75 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=191, Invalid=1215, Unknown=0, NotChecked=0, Total=1406 [2022-11-19 07:19:16,044 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 47 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 07:19:16,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 3 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 07:19:16,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-19 07:19:16,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-19 07:19:16,045 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-19 07:19:16,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-19 07:19:16,046 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2022-11-19 07:19:16,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:19:16,046 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-19 07:19:16,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 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-19 07:19:16,046 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-19 07:19:16,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-19 07:19:16,049 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2022-11-19 07:19:16,049 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2022-11-19 07:19:16,050 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2022-11-19 07:19:16,050 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2022-11-19 07:19:16,050 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2022-11-19 07:19:16,050 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2022-11-19 07:19:16,050 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2022-11-19 07:19:16,051 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2022-11-19 07:19:16,051 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2022-11-19 07:19:16,051 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2022-11-19 07:19:16,070 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-19 07:19:16,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-19 07:19:16,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-19 07:20:06,049 WARN L233 SmtUtils]: Spent 49.79s on a formula simplification. DAG size of input: 216 DAG size of output: 216 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-19 07:20:21,933 WARN L233 SmtUtils]: Spent 15.81s on a formula simplification. DAG size of input: 149 DAG size of output: 150 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-19 07:20:26,203 INFO L895 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 525 531) the Hoare annotation is: (or (not (<= 0 |#NULL.offset|)) (not (<= |~#ldv_global_msg_list~0.base| 1)) (not (<= 0 |~#ldv_global_msg_list~0.offset|)) (not (<= 1 |~#ldv_global_msg_list~0.base|)) (not (<= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (<= 0 |#StackHeapBarrier|)) (and (not (= |ldv_malloc_#in~size| 4)) (let ((.cse0 (div (- |ldv_malloc_#in~size|) (- 4))) (.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)) (not (= (mod (* |ldv_malloc_#in~size| 3) 4) 0)) (not (< 0 |#StackHeapBarrier|)) (not (< 0 .cse0)) (not (= (select |old(#length)| 1) 8)) (not (= (select .cse1 |~#ldv_global_msg_list~0.offset|) |~#ldv_global_msg_list~0.offset|)) (not (< .cse0 16777216)) (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)))))) (not (<= |~#ldv_global_msg_list~0.offset| 0)) (not (<= |#NULL.base| 0))) [2022-11-19 07:20:26,204 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 525 531) no Hoare annotation was computed. [2022-11-19 07:20:26,204 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 765) no Hoare annotation was computed. [2022-11-19 07:20:26,204 INFO L895 garLoopResultBuilder]: At program point L787-2(line 787) 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) (<= 0 (+ |ULTIMATE.start_ldv_positive_~r~1#1| 2147483648)) (= |~#ldv_global_msg_list~0.base| (select .cse0 .cse1)) (= |~#ldv_global_msg_list~0.offset| 0) (= |~#ldv_global_msg_list~0.offset| (select .cse2 .cse1)) (= (select |#valid| 1) 1) (< |ULTIMATE.start_entry_point_~len~0#1| 16777216) (let ((.cse3 (< 0 |ULTIMATE.start_ldv_positive_~r~1#1|))) (or (and (= |ULTIMATE.start_ldv_positive_~r~1#1| |ULTIMATE.start_ldv_positive_#res#1|) .cse3) (and (not .cse3) (= |ULTIMATE.start_ldv_positive_#res#1| 1)))) (= |~#ldv_global_msg_list~0.base| 1) (= (select |#valid| 0) 0) (= |ULTIMATE.start_ldv_positive_#res#1| |ULTIMATE.start_entry_point_~len~0#1|) (= |#NULL.offset| 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= (select .cse2 |~#ldv_global_msg_list~0.offset|) |~#ldv_global_msg_list~0.offset|))) [2022-11-19 07:20:26,205 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 772) no Hoare annotation was computed. [2022-11-19 07:20:26,205 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 790) no Hoare annotation was computed. [2022-11-19 07:20:26,205 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-11-19 07:20:26,205 INFO L899 garLoopResultBuilder]: For program point L788(line 788) no Hoare annotation was computed. [2022-11-19 07:20:26,205 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 780) no Hoare annotation was computed. [2022-11-19 07:20:26,205 INFO L899 garLoopResultBuilder]: For program point L780-3(line 780) no Hoare annotation was computed. [2022-11-19 07:20:26,205 INFO L899 garLoopResultBuilder]: For program point L780-4(line 780) no Hoare annotation was computed. [2022-11-19 07:20:26,206 INFO L895 garLoopResultBuilder]: At program point L780-5(lines 780 782) the Hoare annotation is: (let ((.cse20 (<= 1 |ULTIMATE.start_free_17_~i~1#1|)) (.cse6 (<= |ULTIMATE.start_free_17_~len#1| 1)) (.cse11 (<= |ULTIMATE.start_entry_point_~len~0#1| 1)) (.cse18 (<= |ULTIMATE.start_entry_point_~i~2#1| 1)) (.cse0 (<= 0 |ULTIMATE.start_entry_point_~len~0#1|)) (.cse1 (<= |ULTIMATE.start_ldv_positive_#res#1| 16777216)) (.cse2 (<= 0 (+ |ULTIMATE.start_ldv_positive_~r~1#1| 2147483648))) (.cse3 (<= 0 |ULTIMATE.start_entry_point_~i~2#1|)) (.cse4 (<= 0 |ULTIMATE.start_ldv_positive_#res#1|)) (.cse5 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0)) (.cse7 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse21 (<= 0 |ULTIMATE.start_alloc_17_~i~0#1|)) (.cse8 (<= |ULTIMATE.start_alloc_17_~i~0#1| 2147483647)) (.cse9 (<= |ULTIMATE.start_entry_point_~len~0#1| 16777216)) (.cse10 (<= |#NULL.offset| 0)) (.cse12 (<= |ULTIMATE.start_ldv_positive_~r~1#1| 16777216)) (.cse13 (<= |~#ldv_global_msg_list~0.base| 1)) (.cse22 (< |ULTIMATE.start_entry_point_~len~0#1| 16777216)) (.cse23 (<= |ULTIMATE.start_free_17_~len#1| 16777215)) (.cse14 (<= 1 |~#ldv_global_msg_list~0.base|)) (.cse15 (<= 0 |#NULL.offset|)) (.cse16 (<= 0 |#StackHeapBarrier|)) (.cse17 (= |ULTIMATE.start_free_17_~i~1#1| 0)) (.cse19 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 (<= |ULTIMATE.start_entry_point_~len~0#1| 0) (<= |ULTIMATE.start_entry_point_~i~2#1| 0) .cse9 (<= |ULTIMATE.start_free_17_~len#1| 0) .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19) (and .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse21 .cse8 .cse9 .cse10 .cse12 .cse13 .cse22 .cse23 .cse14 .cse15 .cse16 .cse19) (and .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= |ULTIMATE.start_free_17_~i~1#1| 1) .cse16 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse21 .cse8 .cse9 .cse10 .cse12 .cse13 .cse22 .cse23 .cse14 .cse15 .cse16 .cse17 .cse19))) [2022-11-19 07:20:26,206 INFO L899 garLoopResultBuilder]: For program point L772(line 772) no Hoare annotation was computed. [2022-11-19 07:20:26,206 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 790) no Hoare annotation was computed. [2022-11-19 07:20:26,206 INFO L899 garLoopResultBuilder]: For program point L772-4(line 772) no Hoare annotation was computed. [2022-11-19 07:20:26,206 INFO L899 garLoopResultBuilder]: For program point L772-5(line 772) no Hoare annotation was computed. [2022-11-19 07:20:26,206 INFO L895 garLoopResultBuilder]: At program point L772-6(lines 772 775) the Hoare annotation is: (let ((.cse26 (+ |ULTIMATE.start_alloc_17_~j~0#1| 1))) (let ((.cse8 (= |ULTIMATE.start_alloc_17_~i~0#1| 0)) (.cse17 (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_alloc_17_~array#1.offset|)) (.cse18 (= |ULTIMATE.start_entry_point_~array~0#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|)) (.cse12 (<= .cse26 0)) (.cse19 (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_entry_point_~array~0#1.offset|)) (.cse20 (<= |ULTIMATE.start_entry_point_~len~0#1| |ULTIMATE.start_entry_point_~i~2#1|)) (.cse21 (= |ULTIMATE.start_alloc_17_~array#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|)) (.cse22 (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_entry_point_~len~0#1|)) (.cse23 (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_alloc_17_~len#1|)) (.cse0 (<= 0 |ULTIMATE.start_entry_point_~len~0#1|)) (.cse1 (<= |ULTIMATE.start_ldv_positive_#res#1| 16777216)) (.cse2 (<= 0 (+ |ULTIMATE.start_ldv_positive_~r~1#1| 2147483648))) (.cse3 (<= 0 |ULTIMATE.start_entry_point_~i~2#1|)) (.cse4 (<= 0 |ULTIMATE.start_ldv_positive_#res#1|)) (.cse5 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0)) (.cse24 (= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0)) (.cse6 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse7 (<= |ULTIMATE.start_entry_point_~len~0#1| 16777216)) (.cse25 (= |ULTIMATE.start_alloc_17_~p~0#1.base| 0)) (.cse9 (<= |#NULL.offset| 0)) (.cse27 (< |ULTIMATE.start_alloc_17_~i~0#1| |ULTIMATE.start_alloc_17_~len#1|)) (.cse10 (<= |ULTIMATE.start_ldv_positive_~r~1#1| 16777216)) (.cse11 (<= |~#ldv_global_msg_list~0.base| 1)) (.cse28 (< |ULTIMATE.start_entry_point_~len~0#1| 16777216)) (.cse13 (<= 1 |~#ldv_global_msg_list~0.base|)) (.cse14 (<= 0 |#NULL.offset|)) (.cse15 (<= 0 |#StackHeapBarrier|)) (.cse16 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_entry_point_~len~0#1| 0) (<= |ULTIMATE.start_entry_point_~i~2#1| 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 .cse18 .cse12 .cse19 .cse20 .cse13 .cse21 .cse22 .cse14 .cse15 .cse23 (<= |ULTIMATE.start_entry_point_~i~2#1| 1) .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse24 .cse6 .cse7 .cse25 .cse8 (= .cse26 |ULTIMATE.start_alloc_17_~i~0#1|) .cse9 .cse27 .cse17 .cse10 .cse11 .cse18 .cse12 .cse28 .cse19 .cse20 .cse13 .cse21 .cse22 .cse14 .cse15 .cse23 .cse16) (and .cse0 .cse1 (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0) .cse2 .cse3 .cse4 .cse5 (<= 0 .cse26) .cse24 (<= |ULTIMATE.start_alloc_17_#in~array#1.offset| 0) (<= 0 |ULTIMATE.start_alloc_17_~array#1.offset|) .cse6 (<= |ULTIMATE.start_alloc_17_#in~len#1| 16777216) (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|) .cse7 .cse25 (<= 0 |ULTIMATE.start_alloc_17_#in~len#1|) (<= |ULTIMATE.start_alloc_17_~j~0#1| 2147483647) .cse9 .cse27 .cse10 (<= |ULTIMATE.start_alloc_17_~len#1| 16777216) .cse11 (<= 1 |ULTIMATE.start_alloc_17_~i~0#1|) .cse28 .cse13 .cse14 .cse15 .cse16)))) [2022-11-19 07:20:26,206 INFO L899 garLoopResultBuilder]: For program point L789(lines 789 796) no Hoare annotation was computed. [2022-11-19 07:20:26,207 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 780) no Hoare annotation was computed. [2022-11-19 07:20:26,207 INFO L899 garLoopResultBuilder]: For program point L765-3(line 765) no Hoare annotation was computed. [2022-11-19 07:20:26,207 INFO L899 garLoopResultBuilder]: For program point L765-4(line 765) no Hoare annotation was computed. [2022-11-19 07:20:26,207 INFO L895 garLoopResultBuilder]: At program point L765-5(lines 765 769) the Hoare annotation is: (let ((.cse6 (<= |ULTIMATE.start_alloc_17_#in~array#1.offset| 0)) (.cse8 (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|)) (.cse10 (<= 0 |ULTIMATE.start_alloc_17_~len#1|)) (.cse12 (< |ULTIMATE.start_entry_point_~len~0#1| 16777216)) (.cse0 (<= 0 |ULTIMATE.start_entry_point_~len~0#1|)) (.cse1 (<= |ULTIMATE.start_ldv_positive_#res#1| 16777216)) (.cse2 (<= 0 (+ |ULTIMATE.start_ldv_positive_~r~1#1| 2147483648))) (.cse3 (<= 0 |ULTIMATE.start_entry_point_~i~2#1|)) (.cse4 (<= 0 |ULTIMATE.start_ldv_positive_#res#1|)) (.cse5 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0)) (.cse7 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse9 (<= |ULTIMATE.start_ldv_positive_~r~1#1| 16777216)) (.cse11 (<= 1 |ULTIMATE.start_alloc_17_~i~0#1|)) (.cse13 (= |~#ldv_global_msg_list~0.base| 1)) (.cse14 (= |#NULL.offset| 0)) (.cse15 (<= 0 |#StackHeapBarrier|)) (.cse16 (= |#NULL.base| 0))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0) .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0) .cse6 (<= 0 |ULTIMATE.start_alloc_17_~array#1.offset|) .cse7 (<= |ULTIMATE.start_alloc_17_#in~len#1| 16777216) .cse8 (<= |ULTIMATE.start_alloc_17_~i~0#1| 2147483647) (<= 0 |ULTIMATE.start_alloc_17_#in~len#1|) .cse9 (<= |ULTIMATE.start_alloc_17_~len#1| 16777216) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 (= |ULTIMATE.start_alloc_17_~i~0#1| 0) (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_alloc_17_~array#1.offset|) .cse9 .cse10 (= |ULTIMATE.start_entry_point_~array~0#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|) .cse12 (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_entry_point_~array~0#1.offset|) (<= |ULTIMATE.start_entry_point_~len~0#1| |ULTIMATE.start_entry_point_~i~2#1|) .cse13 .cse14 (= |ULTIMATE.start_alloc_17_~array#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|) (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_entry_point_~len~0#1|) .cse15 (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_alloc_17_~len#1|) .cse16) (and .cse0 .cse1 (<= |ULTIMATE.start_alloc_17_~i~0#1| 1) .cse2 .cse3 .cse4 .cse5 .cse7 (<= |ULTIMATE.start_entry_point_~len~0#1| 1) .cse9 .cse11 .cse13 .cse14 .cse15 (<= |ULTIMATE.start_entry_point_~i~2#1| 1) .cse16 (<= |ULTIMATE.start_alloc_17_~len#1| 1)))) [2022-11-19 07:20:26,207 INFO L899 garLoopResultBuilder]: For program point L790-3(line 790) no Hoare annotation was computed. [2022-11-19 07:20:26,208 INFO L899 garLoopResultBuilder]: For program point L790-4(line 790) no Hoare annotation was computed. [2022-11-19 07:20:26,208 INFO L895 garLoopResultBuilder]: At program point L790-5(lines 790 792) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_entry_point_~len~0#1|) (<= |ULTIMATE.start_ldv_positive_#res#1| 16777216) (<= 0 (+ |ULTIMATE.start_ldv_positive_~r~1#1| 2147483648)) (<= 0 |ULTIMATE.start_entry_point_~i~2#1|) (<= 0 |ULTIMATE.start_ldv_positive_#res#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0) (= |~#ldv_global_msg_list~0.offset| 0) (<= |ULTIMATE.start_ldv_positive_~r~1#1| 16777216) (< |ULTIMATE.start_entry_point_~len~0#1| 16777216) (= |~#ldv_global_msg_list~0.base| 1) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0)) [2022-11-19 07:20:26,208 INFO L895 garLoopResultBuilder]: At program point L766(line 766) the Hoare annotation is: (let ((.cse6 (= |ULTIMATE.start_alloc_17_~i~0#1| 0)) (.cse7 (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_alloc_17_~array#1.offset|)) (.cse9 (= |ULTIMATE.start_entry_point_~array~0#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|)) (.cse10 (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_entry_point_~array~0#1.offset|)) (.cse11 (<= |ULTIMATE.start_entry_point_~len~0#1| |ULTIMATE.start_entry_point_~i~2#1|)) (.cse14 (= |ULTIMATE.start_alloc_17_~array#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|)) (.cse15 (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_entry_point_~len~0#1|)) (.cse17 (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_alloc_17_~len#1|)) (.cse0 (<= 0 |ULTIMATE.start_entry_point_~len~0#1|)) (.cse1 (<= |ULTIMATE.start_ldv_positive_#res#1| 16777216)) (.cse2 (<= 0 (+ |ULTIMATE.start_ldv_positive_~r~1#1| 2147483648))) (.cse3 (<= 0 |ULTIMATE.start_ldv_positive_#res#1|)) (.cse4 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0)) (.cse19 (<= |ULTIMATE.start_alloc_17_#in~array#1.offset| 0)) (.cse5 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse20 (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|)) (.cse21 (< |ULTIMATE.start_alloc_17_~i~0#1| |ULTIMATE.start_alloc_17_~len#1|)) (.cse8 (<= |ULTIMATE.start_ldv_positive_~r~1#1| 16777216)) (.cse22 (< |ULTIMATE.start_entry_point_~len~0#1| 16777216)) (.cse12 (= |~#ldv_global_msg_list~0.base| 1)) (.cse13 (= |#NULL.offset| 0)) (.cse16 (<= 0 |#StackHeapBarrier|)) (.cse18 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= |ULTIMATE.start_entry_point_~i~2#1| 1) .cse18) (and .cse1 .cse2 .cse3 .cse19 .cse5 .cse20 .cse6 .cse21 .cse7 .cse8 .cse9 .cse22 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0) .cse2 (<= 0 |ULTIMATE.start_entry_point_~i~2#1|) .cse3 .cse4 (= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0) .cse19 (<= 0 |ULTIMATE.start_alloc_17_~array#1.offset|) .cse5 (<= |ULTIMATE.start_alloc_17_#in~len#1| 16777216) .cse20 (<= 0 |ULTIMATE.start_alloc_17_#in~len#1|) .cse21 .cse8 (<= |ULTIMATE.start_alloc_17_~len#1| 16777216) (<= 1 |ULTIMATE.start_alloc_17_~i~0#1|) .cse22 .cse12 .cse13 .cse16 .cse18))) [2022-11-19 07:20:26,208 INFO L899 garLoopResultBuilder]: For program point L766-1(line 766) no Hoare annotation was computed. [2022-11-19 07:20:26,208 INFO L899 garLoopResultBuilder]: For program point L767(line 767) no Hoare annotation was computed. [2022-11-19 07:20:26,209 INFO L895 garLoopResultBuilder]: At program point L767-1(lines 761 777) the Hoare annotation is: (let ((.cse13 (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_alloc_17_~array#1.offset|)) (.cse16 (= |ULTIMATE.start_entry_point_~array~0#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|)) (.cse18 (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_entry_point_~array~0#1.offset|)) (.cse19 (<= |ULTIMATE.start_entry_point_~len~0#1| |ULTIMATE.start_entry_point_~i~2#1|)) (.cse21 (= |ULTIMATE.start_alloc_17_~array#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|)) (.cse22 (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_entry_point_~len~0#1|)) (.cse25 (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_alloc_17_~len#1|)) (.cse10 (= |ULTIMATE.start_alloc_17_~i~0#1| 0)) (.cse0 (<= 0 |ULTIMATE.start_entry_point_~len~0#1|)) (.cse1 (<= |ULTIMATE.start_ldv_positive_#res#1| 16777216)) (.cse2 (<= 0 (+ |ULTIMATE.start_ldv_positive_~r~1#1| 2147483648))) (.cse3 (<= 0 |ULTIMATE.start_entry_point_~i~2#1|)) (.cse4 (<= 0 |ULTIMATE.start_ldv_positive_#res#1|)) (.cse5 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0)) (.cse6 (= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0)) (.cse7 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse8 (<= |ULTIMATE.start_entry_point_~len~0#1| 16777216)) (.cse9 (= |ULTIMATE.start_alloc_17_~p~0#1.base| 0)) (.cse11 (<= |#NULL.offset| 0)) (.cse12 (< |ULTIMATE.start_alloc_17_~i~0#1| |ULTIMATE.start_alloc_17_~len#1|)) (.cse14 (<= |ULTIMATE.start_ldv_positive_~r~1#1| 16777216)) (.cse15 (<= |~#ldv_global_msg_list~0.base| 1)) (.cse17 (< |ULTIMATE.start_entry_point_~len~0#1| 16777216)) (.cse20 (<= 1 |~#ldv_global_msg_list~0.base|)) (.cse23 (<= 0 |#NULL.offset|)) (.cse24 (<= 0 |#StackHeapBarrier|)) (.cse26 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (<= |ULTIMATE.start_entry_point_~i~2#1| 1) .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 (<= |ULTIMATE.start_entry_point_~len~0#1| 0) (<= |ULTIMATE.start_entry_point_~i~2#1| 0) .cse8 .cse10 .cse11 .cse14 .cse15 .cse20 .cse23 .cse24 .cse26) (and .cse0 .cse1 (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0) .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_alloc_17_#in~array#1.offset| 0) (<= 0 |ULTIMATE.start_alloc_17_~array#1.offset|) .cse7 (<= |ULTIMATE.start_alloc_17_#in~len#1| 16777216) (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|) .cse8 .cse9 (<= 0 |ULTIMATE.start_alloc_17_#in~len#1|) .cse11 .cse12 .cse14 (<= |ULTIMATE.start_alloc_17_~len#1| 16777216) .cse15 (<= 1 |ULTIMATE.start_alloc_17_~i~0#1|) .cse17 .cse20 .cse23 .cse24 .cse26))) [2022-11-19 07:20:26,209 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 772) no Hoare annotation was computed. [2022-11-19 07:20:26,209 INFO L899 garLoopResultBuilder]: For program point L784(lines 784 797) no Hoare annotation was computed. [2022-11-19 07:20:26,209 INFO L895 garLoopResultBuilder]: At program point L776(lines 761 777) the Hoare annotation is: (let ((.cse7 (<= |ULTIMATE.start_alloc_17_~i~0#1| 2147483647)) (.cse0 (<= 0 |ULTIMATE.start_entry_point_~len~0#1|)) (.cse1 (<= |ULTIMATE.start_ldv_positive_#res#1| 16777216)) (.cse2 (<= 0 (+ |ULTIMATE.start_ldv_positive_~r~1#1| 2147483648))) (.cse3 (<= 0 |ULTIMATE.start_entry_point_~i~2#1|)) (.cse4 (<= 0 |ULTIMATE.start_ldv_positive_#res#1|)) (.cse5 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0)) (.cse6 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse8 (<= |ULTIMATE.start_entry_point_~len~0#1| 16777216)) (.cse9 (<= |#NULL.offset| 0)) (.cse10 (<= |ULTIMATE.start_ldv_positive_~r~1#1| 16777216)) (.cse11 (<= |~#ldv_global_msg_list~0.base| 1)) (.cse12 (<= 1 |~#ldv_global_msg_list~0.base|)) (.cse13 (<= 0 |#NULL.offset|)) (.cse14 (<= 0 |#StackHeapBarrier|)) (.cse15 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= |ULTIMATE.start_entry_point_~len~0#1| 1) .cse10 .cse11 .cse12 .cse13 .cse14 (<= |ULTIMATE.start_entry_point_~i~2#1| 1) .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 0 |ULTIMATE.start_alloc_17_~i~0#1|) .cse7 .cse8 .cse9 .cse10 .cse11 (< |ULTIMATE.start_entry_point_~len~0#1| 16777216) .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_entry_point_~len~0#1| 0) (<= |ULTIMATE.start_entry_point_~i~2#1| 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-11-19 07:20:26,209 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-19 07:20:26,210 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 772) no Hoare annotation was computed. [2022-11-19 07:20:26,210 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 765) no Hoare annotation was computed. [2022-11-19 07:20:26,210 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 772) no Hoare annotation was computed. [2022-11-19 07:20:26,213 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:20:26,215 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 07:20:26,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:20:26 BoogieIcfgContainer [2022-11-19 07:20:26,254 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 07:20:26,255 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 07:20:26,255 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 07:20:26,255 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 07:20:26,256 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:18:34" (3/4) ... [2022-11-19 07:20:26,259 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-19 07:20:26,265 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-11-19 07:20:26,270 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2022-11-19 07:20:26,270 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-11-19 07:20:26,271 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-19 07:20:26,296 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && r <= 16777216) && len < 16777216) && ldv_global_msg_list == 1) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0 [2022-11-19 07:20:26,296 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && p == 0) && ldv_global_msg_list == 0) && len <= 16777216) && p == 0) && i == 0) && #NULL <= 0) && i < len) && array == array) && r <= 16777216) && ldv_global_msg_list <= 1) && array == array) && len < 16777216) && array == array) && len <= i) && 1 <= ldv_global_msg_list) && array == array) && \old(len) == len) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(len) == len) && #NULL == 0) || (((((((((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 16777216) && i == 0) && #NULL <= 0) && array == array) && r <= 16777216) && ldv_global_msg_list <= 1) && array == array) && array == array) && len <= i) && 1 <= ldv_global_msg_list) && array == array) && \old(len) == len) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(len) == len) && i <= 1) && #NULL == 0)) || (((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 0) && i <= 0) && len <= 16777216) && i == 0) && #NULL <= 0) && r <= 16777216) && ldv_global_msg_list <= 1) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((((((((((((((((((((((0 <= len && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && \old(len) <= 16777216) && 0 <= array) && len <= 16777216) && p == 0) && 0 <= \old(len)) && #NULL <= 0) && i < len) && r <= 16777216) && len <= 16777216) && ldv_global_msg_list <= 1) && 1 <= i) && len < 16777216) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) [2022-11-19 07:20:26,297 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 0) && i <= 0) && len <= 16777216) && i == 0) && #NULL <= 0) && r <= 16777216) && ldv_global_msg_list <= 1) && j + 1 <= 0) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((((((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 16777216) && i == 0) && #NULL <= 0) && array == array) && r <= 16777216) && ldv_global_msg_list <= 1) && array == array) && j + 1 <= 0) && array == array) && len <= i) && 1 <= ldv_global_msg_list) && array == array) && \old(len) == len) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(len) == len) && i <= 1) && #NULL == 0)) || ((((((((((((((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && p == 0) && ldv_global_msg_list == 0) && len <= 16777216) && p == 0) && i == 0) && j + 1 == i) && #NULL <= 0) && i < len) && array == array) && r <= 16777216) && ldv_global_msg_list <= 1) && array == array) && j + 1 <= 0) && len < 16777216) && array == array) && len <= i) && 1 <= ldv_global_msg_list) && array == array) && \old(len) == len) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(len) == len) && #NULL == 0)) || ((((((((((((((((((((((((((((0 <= len && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && 0 <= j + 1) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && \old(len) <= 16777216) && 0 <= array) && len <= 16777216) && p == 0) && 0 <= \old(len)) && j <= 2147483647) && #NULL <= 0) && i < len) && r <= 16777216) && len <= 16777216) && ldv_global_msg_list <= 1) && 1 <= i) && len < 16777216) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) [2022-11-19 07:20:26,297 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((0 <= len && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && \old(len) <= 16777216) && 0 <= array) && i <= 2147483647) && 0 <= \old(len)) && r <= 16777216) && len <= 16777216) && 0 <= len) && 1 <= i) && len < 16777216) && ldv_global_msg_list == 1) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((((((((((((((((\result <= 16777216 && 0 <= r + 2147483648) && 0 <= \result) && array <= 0) && ldv_global_msg_list == 0) && 0 <= array) && i == 0) && array == array) && r <= 16777216) && 0 <= len) && array == array) && len < 16777216) && array == array) && len <= i) && ldv_global_msg_list == 1) && #NULL == 0) && array == array) && \old(len) == len) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(len) == len) && #NULL == 0)) || ((((((((((((((((0 <= len && \result <= 16777216) && i <= 1) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 1) && r <= 16777216) && 1 <= i) && ldv_global_msg_list == 1) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && i <= 1) && #NULL == 0) && len <= 1) [2022-11-19 07:20:26,297 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && i <= 2147483647) && len <= 16777216) && #NULL <= 0) && len <= 1) && r <= 16777216) && ldv_global_msg_list <= 1) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && i <= 1) && #NULL == 0) || (((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && 0 <= i) && i <= 2147483647) && len <= 16777216) && #NULL <= 0) && r <= 16777216) && ldv_global_msg_list <= 1) && len < 16777216) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 0) && i <= 0) && len <= 16777216) && #NULL <= 0) && r <= 16777216) && ldv_global_msg_list <= 1) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) [2022-11-19 07:20:26,298 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && len <= 1) && ldv_global_msg_list == 0) && i <= 2147483647) && len <= 16777216) && #NULL <= 0) && len <= 1) && r <= 16777216) && ldv_global_msg_list <= 1) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && i == 0) && i <= 1) && #NULL == 0) || ((((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 0) && i <= 0) && len <= 16777216) && len <= 0) && #NULL <= 0) && r <= 16777216) && ldv_global_msg_list <= 1) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && i == 0) && #NULL == 0)) || (((((((((((((((((((0 <= len && 1 <= i) && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && 0 <= i) && i <= 2147483647) && len <= 16777216) && #NULL <= 0) && r <= 16777216) && ldv_global_msg_list <= 1) && len < 16777216) && len <= 16777215) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((((((((((((((((0 <= len && 1 <= i) && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && len <= 1) && ldv_global_msg_list == 0) && i <= 2147483647) && len <= 16777216) && #NULL <= 0) && len <= 1) && r <= 16777216) && ldv_global_msg_list <= 1) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && i <= 1) && #NULL == 0)) || (((((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && 0 <= i) && i <= 2147483647) && len <= 16777216) && #NULL <= 0) && r <= 16777216) && ldv_global_msg_list <= 1) && len < 16777216) && len <= 16777215) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && i == 0) && #NULL == 0) [2022-11-19 07:20:26,313 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/witness.graphml [2022-11-19 07:20:26,314 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 07:20:26,314 INFO L158 Benchmark]: Toolchain (without parser) took 112925.79ms. Allocated memory was 134.2MB in the beginning and 293.6MB in the end (delta: 159.4MB). Free memory was 96.0MB in the beginning and 194.3MB in the end (delta: -98.3MB). Peak memory consumption was 61.1MB. Max. memory is 16.1GB. [2022-11-19 07:20:26,316 INFO L158 Benchmark]: CDTParser took 6.76ms. Allocated memory is still 134.2MB. Free memory was 104.5MB in the beginning and 113.6MB in the end (delta: -9.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:20:26,317 INFO L158 Benchmark]: CACSL2BoogieTranslator took 617.64ms. Allocated memory is still 134.2MB. Free memory was 95.8MB in the beginning and 96.2MB in the end (delta: -317.4kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 07:20:26,317 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.53ms. Allocated memory is still 134.2MB. Free memory was 96.2MB in the beginning and 94.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:20:26,317 INFO L158 Benchmark]: Boogie Preprocessor took 36.52ms. Allocated memory is still 134.2MB. Free memory was 94.0MB in the beginning and 92.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:20:26,317 INFO L158 Benchmark]: RCFGBuilder took 603.12ms. Allocated memory is still 134.2MB. Free memory was 92.0MB in the beginning and 73.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-19 07:20:26,318 INFO L158 Benchmark]: TraceAbstraction took 111508.97ms. Allocated memory was 134.2MB in the beginning and 293.6MB in the end (delta: 159.4MB). Free memory was 72.5MB in the beginning and 198.5MB in the end (delta: -126.0MB). Peak memory consumption was 143.5MB. Max. memory is 16.1GB. [2022-11-19 07:20:26,319 INFO L158 Benchmark]: Witness Printer took 59.04ms. Allocated memory is still 293.6MB. Free memory was 198.5MB in the beginning and 194.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-19 07:20:26,320 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 6.76ms. Allocated memory is still 134.2MB. Free memory was 104.5MB in the beginning and 113.6MB in the end (delta: -9.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 617.64ms. Allocated memory is still 134.2MB. Free memory was 95.8MB in the beginning and 96.2MB in the end (delta: -317.4kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.53ms. Allocated memory is still 134.2MB. Free memory was 96.2MB in the beginning and 94.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.52ms. Allocated memory is still 134.2MB. Free memory was 94.0MB in the beginning and 92.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 603.12ms. Allocated memory is still 134.2MB. Free memory was 92.0MB in the beginning and 73.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 111508.97ms. Allocated memory was 134.2MB in the beginning and 293.6MB in the end (delta: 159.4MB). Free memory was 72.5MB in the beginning and 198.5MB in the end (delta: -126.0MB). Peak memory consumption was 143.5MB. Max. memory is 16.1GB. * Witness Printer took 59.04ms. Allocated memory is still 293.6MB. Free memory was 198.5MB in the beginning and 194.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 790]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 790]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 765]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 765]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 772]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 772]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 772]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 772]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 780]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 780]: 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, 36 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 111.4s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 69.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 693 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 687 mSDsluCounter, 1901 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 7 IncrementalHoareTripleChecker+Unchecked, 1468 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1867 IncrementalHoareTripleChecker+Invalid, 1930 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 433 mSDtfsCounter, 1867 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 777 GetRequests, 461 SyntacticMatches, 27 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2009 ImplicationChecksByTransitivity, 24.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=6, InterpolantAutomatonStates: 157, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 246 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 16 PreInvPairs, 52 NumberOfFragments, 1776 HoareAnnotationTreeSize, 16 FomulaSimplifications, 1279 FormulaSimplificationTreeSizeReduction, 65.9s HoareSimplificationTime, 10 FomulaSimplificationsInter, 1778633 FormulaSimplificationTreeSizeReductionInter, 4.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 682 NumberOfCodeBlocks, 663 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 819 ConstructedInterpolants, 0 QuantifiedInterpolants, 1645 SizeOfPredicates, 48 NumberOfNonLiveVariables, 1871 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 37 InterpolantComputations, 11 PerfectInterpolantSequences, 246/321 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: 4.2s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 8, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 67, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 116, TOOLS_POST_TIME: 2.3s, TOOLS_POST_CALL_APPLICATIONS: 26, TOOLS_POST_CALL_TIME: 0.9s, TOOLS_POST_RETURN_APPLICATIONS: 20, TOOLS_POST_RETURN_TIME: 0.4s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 159, TOOLS_QUANTIFIERELIM_TIME: 3.5s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 261, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 23, DOMAIN_JOIN_TIME: 0.3s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 8, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 16, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 67, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 8, LOOP_SUMMARIZER_CACHE_MISSES: 8, LOOP_SUMMARIZER_OVERALL_TIME: 1.9s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 1.9s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 16, CALL_SUMMARIZER_APPLICATIONS: 20, CALL_SUMMARIZER_CACHE_MISSES: 4, CALL_SUMMARIZER_OVERALL_TIME: 0.2s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.2s, 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: 935, DAG_COMPRESSION_RETAINED_NODES: 223, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - InvariantResult [Line: 765]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((0 <= len && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && \old(len) <= 16777216) && 0 <= array) && i <= 2147483647) && 0 <= \old(len)) && r <= 16777216) && len <= 16777216) && 0 <= len) && 1 <= i) && len < 16777216) && ldv_global_msg_list == 1) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((((((((((((((((\result <= 16777216 && 0 <= r + 2147483648) && 0 <= \result) && array <= 0) && ldv_global_msg_list == 0) && 0 <= array) && i == 0) && array == array) && r <= 16777216) && 0 <= len) && array == array) && len < 16777216) && array == array) && len <= i) && ldv_global_msg_list == 1) && #NULL == 0) && array == array) && \old(len) == len) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(len) == len) && #NULL == 0)) || ((((((((((((((((0 <= len && \result <= 16777216) && i <= 1) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 1) && r <= 16777216) && 1 <= i) && ldv_global_msg_list == 1) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && i <= 1) && #NULL == 0) && len <= 1) - InvariantResult [Line: 780]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && len <= 1) && ldv_global_msg_list == 0) && i <= 2147483647) && len <= 16777216) && #NULL <= 0) && len <= 1) && r <= 16777216) && ldv_global_msg_list <= 1) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && i == 0) && i <= 1) && #NULL == 0) || ((((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 0) && i <= 0) && len <= 16777216) && len <= 0) && #NULL <= 0) && r <= 16777216) && ldv_global_msg_list <= 1) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && i == 0) && #NULL == 0)) || (((((((((((((((((((0 <= len && 1 <= i) && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && 0 <= i) && i <= 2147483647) && len <= 16777216) && #NULL <= 0) && r <= 16777216) && ldv_global_msg_list <= 1) && len < 16777216) && len <= 16777215) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((((((((((((((((0 <= len && 1 <= i) && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && len <= 1) && ldv_global_msg_list == 0) && i <= 2147483647) && len <= 16777216) && #NULL <= 0) && len <= 1) && r <= 16777216) && ldv_global_msg_list <= 1) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && i <= 1) && #NULL == 0)) || (((((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && 0 <= i) && i <= 2147483647) && len <= 16777216) && #NULL <= 0) && r <= 16777216) && ldv_global_msg_list <= 1) && len < 16777216) && len <= 16777215) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && i == 0) && #NULL == 0) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 761]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && p == 0) && ldv_global_msg_list == 0) && len <= 16777216) && p == 0) && i == 0) && #NULL <= 0) && i < len) && array == array) && r <= 16777216) && ldv_global_msg_list <= 1) && array == array) && len < 16777216) && array == array) && len <= i) && 1 <= ldv_global_msg_list) && array == array) && \old(len) == len) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(len) == len) && #NULL == 0) || (((((((((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 16777216) && i == 0) && #NULL <= 0) && array == array) && r <= 16777216) && ldv_global_msg_list <= 1) && array == array) && array == array) && len <= i) && 1 <= ldv_global_msg_list) && array == array) && \old(len) == len) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(len) == len) && i <= 1) && #NULL == 0)) || (((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 0) && i <= 0) && len <= 16777216) && i == 0) && #NULL <= 0) && r <= 16777216) && ldv_global_msg_list <= 1) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((((((((((((((((((((((0 <= len && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && \old(len) <= 16777216) && 0 <= array) && len <= 16777216) && p == 0) && 0 <= \old(len)) && #NULL <= 0) && i < len) && r <= 16777216) && len <= 16777216) && ldv_global_msg_list <= 1) && 1 <= i) && len < 16777216) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 761]: Loop Invariant Derived loop invariant: ((((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && i <= 2147483647) && len <= 16777216) && #NULL <= 0) && len <= 1) && r <= 16777216) && ldv_global_msg_list <= 1) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && i <= 1) && #NULL == 0) || (((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && 0 <= i) && i <= 2147483647) && len <= 16777216) && #NULL <= 0) && r <= 16777216) && ldv_global_msg_list <= 1) && len < 16777216) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 0) && i <= 0) && len <= 16777216) && #NULL <= 0) && r <= 16777216) && ldv_global_msg_list <= 1) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 772]: Loop Invariant Derived loop invariant: ((((((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 0) && i <= 0) && len <= 16777216) && i == 0) && #NULL <= 0) && r <= 16777216) && ldv_global_msg_list <= 1) && j + 1 <= 0) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((((((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 16777216) && i == 0) && #NULL <= 0) && array == array) && r <= 16777216) && ldv_global_msg_list <= 1) && array == array) && j + 1 <= 0) && array == array) && len <= i) && 1 <= ldv_global_msg_list) && array == array) && \old(len) == len) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(len) == len) && i <= 1) && #NULL == 0)) || ((((((((((((((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && p == 0) && ldv_global_msg_list == 0) && len <= 16777216) && p == 0) && i == 0) && j + 1 == i) && #NULL <= 0) && i < len) && array == array) && r <= 16777216) && ldv_global_msg_list <= 1) && array == array) && j + 1 <= 0) && len < 16777216) && array == array) && len <= i) && 1 <= ldv_global_msg_list) && array == array) && \old(len) == len) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(len) == len) && #NULL == 0)) || ((((((((((((((((((((((((((((0 <= len && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && 0 <= j + 1) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && \old(len) <= 16777216) && 0 <= array) && len <= 16777216) && p == 0) && 0 <= \old(len)) && j <= 2147483647) && #NULL <= 0) && i < len) && r <= 16777216) && len <= 16777216) && ldv_global_msg_list <= 1) && 1 <= i) && len < 16777216) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 790]: Loop Invariant Derived loop invariant: (((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && r <= 16777216) && len < 16777216) && ldv_global_msg_list == 1) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0 RESULT: Ultimate proved your program to be correct! [2022-11-19 07:20:26,374 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83310f78-f169-431e-9a00-01bd2e6beba3/bin/utaipan-I9t0OCRTmS/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