./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f38e3212-f18d-4c31-b1eb-6837c349e1e4/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f38e3212-f18d-4c31-b1eb-6837c349e1e4/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_f38e3212-f18d-4c31-b1eb-6837c349e1e4/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f38e3212-f18d-4c31-b1eb-6837c349e1e4/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f38e3212-f18d-4c31-b1eb-6837c349e1e4/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_f38e3212-f18d-4c31-b1eb-6837c349e1e4/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 27e059eb1633b1ab9c045484375455e2667fa3360a55d0bc53eccfa53fe7600f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-19 07:37:04,206 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:37:04,209 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:37:04,250 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:37:04,252 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:37:04,253 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:37:04,257 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:37:04,263 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:37:04,269 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:37:04,274 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:37:04,276 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:37:04,277 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:37:04,280 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:37:04,282 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:37:04,287 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:37:04,288 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:37:04,291 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:37:04,299 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:37:04,301 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:37:04,304 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:37:04,306 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:37:04,310 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:37:04,312 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:37:04,313 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:37:04,319 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:37:04,326 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:37:04,327 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:37:04,328 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:37:04,330 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:37:04,332 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:37:04,333 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:37:04,334 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:37:04,336 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:37:04,339 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:37:04,341 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:37:04,341 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:37:04,342 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:37:04,343 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:37:04,343 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:37:04,344 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:37:04,345 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:37:04,346 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f38e3212-f18d-4c31-b1eb-6837c349e1e4/bin/utaipan-I9t0OCRTmS/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-19 07:37:04,406 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:37:04,406 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:37:04,407 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:37:04,408 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:37:04,409 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:37:04,409 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:37:04,409 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:37:04,410 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:37:04,410 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:37:04,410 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 07:37:04,412 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:37:04,412 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:37:04,412 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 07:37:04,412 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 07:37:04,413 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:37:04,413 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 07:37:04,413 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 07:37:04,414 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 07:37:04,414 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:37:04,415 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:37:04,415 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 07:37:04,415 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:37:04,416 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:37:04,416 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:37:04,416 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 07:37:04,416 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:37:04,417 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 07:37:04,417 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-19 07:37:04,417 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:37:04,417 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 07:37:04,418 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:37:04,418 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 07:37:04,418 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:37:04,418 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:37:04,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:37:04,419 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:37:04,419 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 07:37:04,420 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:37:04,420 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 07:37:04,420 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 07:37:04,420 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 07:37:04,421 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 07:37:04,421 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:37:04,421 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_f38e3212-f18d-4c31-b1eb-6837c349e1e4/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_f38e3212-f18d-4c31-b1eb-6837c349e1e4/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 -> 27e059eb1633b1ab9c045484375455e2667fa3360a55d0bc53eccfa53fe7600f [2022-11-19 07:37:04,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:37:04,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:37:04,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:37:04,843 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:37:04,844 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:37:04,845 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f38e3212-f18d-4c31-b1eb-6837c349e1e4/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i [2022-11-19 07:37:04,942 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f38e3212-f18d-4c31-b1eb-6837c349e1e4/bin/utaipan-I9t0OCRTmS/data/774b8de3b/565263918e064e76bdb05e1f9afc9095/FLAGb7f9516e0 [2022-11-19 07:37:05,571 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:37:05,572 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f38e3212-f18d-4c31-b1eb-6837c349e1e4/sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i [2022-11-19 07:37:05,592 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f38e3212-f18d-4c31-b1eb-6837c349e1e4/bin/utaipan-I9t0OCRTmS/data/774b8de3b/565263918e064e76bdb05e1f9afc9095/FLAGb7f9516e0 [2022-11-19 07:37:05,853 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f38e3212-f18d-4c31-b1eb-6837c349e1e4/bin/utaipan-I9t0OCRTmS/data/774b8de3b/565263918e064e76bdb05e1f9afc9095 [2022-11-19 07:37:05,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:37:05,858 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:37:05,860 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:37:05,861 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:37:05,865 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:37:05,866 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:37:05" (1/1) ... [2022-11-19 07:37:05,867 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79165cca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:05, skipping insertion in model container [2022-11-19 07:37:05,868 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:37:05" (1/1) ... [2022-11-19 07:37:05,877 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:37:05,921 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:37:06,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:37:06,492 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:37:06,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:37:06,595 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:37:06,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:06 WrapperNode [2022-11-19 07:37:06,595 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:37:06,597 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:37:06,597 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:37:06,597 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:37:06,606 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:37:06" (1/1) ... [2022-11-19 07:37:06,639 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:37:06" (1/1) ... [2022-11-19 07:37:06,663 INFO L138 Inliner]: procedures = 164, calls = 73, calls flagged for inlining = 21, calls inlined = 3, statements flattened = 53 [2022-11-19 07:37:06,663 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:37:06,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:37:06,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:37:06,665 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:37:06,675 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:06" (1/1) ... [2022-11-19 07:37:06,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:06" (1/1) ... [2022-11-19 07:37:06,679 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:06" (1/1) ... [2022-11-19 07:37:06,679 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:06" (1/1) ... [2022-11-19 07:37:06,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:06" (1/1) ... [2022-11-19 07:37:06,692 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:06" (1/1) ... [2022-11-19 07:37:06,693 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:06" (1/1) ... [2022-11-19 07:37:06,694 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:06" (1/1) ... [2022-11-19 07:37:06,697 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:37:06,698 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:37:06,698 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:37:06,698 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:37:06,699 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:06" (1/1) ... [2022-11-19 07:37:06,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:37:06,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f38e3212-f18d-4c31-b1eb-6837c349e1e4/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:37:06,743 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f38e3212-f18d-4c31-b1eb-6837c349e1e4/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:37:06,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f38e3212-f18d-4c31-b1eb-6837c349e1e4/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:37:06,793 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-19 07:37:06,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-19 07:37:06,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-19 07:37:06,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:37:06,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-19 07:37:06,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-19 07:37:06,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 07:37:06,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-19 07:37:06,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:37:06,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:37:06,928 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:37:06,931 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:37:07,116 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:37:07,181 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:37:07,181 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-19 07:37:07,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:37:07 BoogieIcfgContainer [2022-11-19 07:37:07,184 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:37:07,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:37:07,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:37:07,196 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:37:07,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:37:05" (1/3) ... [2022-11-19 07:37:07,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@205d5113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:37:07, skipping insertion in model container [2022-11-19 07:37:07,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:06" (2/3) ... [2022-11-19 07:37:07,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@205d5113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:37:07, skipping insertion in model container [2022-11-19 07:37:07,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:37:07" (3/3) ... [2022-11-19 07:37:07,213 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test18_2.i [2022-11-19 07:37:07,249 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:37:07,249 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-11-19 07:37:07,344 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:37:07,355 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;@7ee693, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:37:07,356 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-19 07:37:07,360 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 07:37:07,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 07:37:07,369 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:37:07,372 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:37:07,373 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-19 07:37:07,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:37:07,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1948391324, now seen corresponding path program 1 times [2022-11-19 07:37:07,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:37:07,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655489995] [2022-11-19 07:37:07,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:37:07,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:37:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:37:07,790 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:37:07,791 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:37:07,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655489995] [2022-11-19 07:37:07,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655489995] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:37:07,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:37:07,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:37:07,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299713095] [2022-11-19 07:37:07,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:37:07,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:37:07,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:37:07,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:37:07,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:37:07,851 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 07:37:08,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:37:08,016 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-11-19 07:37:08,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:37:08,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2022-11-19 07:37:08,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:37:08,030 INFO L225 Difference]: With dead ends: 44 [2022-11-19 07:37:08,030 INFO L226 Difference]: Without dead ends: 36 [2022-11-19 07:37:08,033 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:37:08,041 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:37:08,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 47 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:37:08,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-19 07:37:08,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2022-11-19 07:37:08,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.380952380952381) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-19 07:37:08,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2022-11-19 07:37:08,089 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 13 [2022-11-19 07:37:08,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:37:08,091 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2022-11-19 07:37:08,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 07:37:08,092 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-11-19 07:37:08,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 07:37:08,093 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:37:08,093 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:37:08,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 07:37:08,094 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-19 07:37:08,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:37:08,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1997394328, now seen corresponding path program 1 times [2022-11-19 07:37:08,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:37:08,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125146026] [2022-11-19 07:37:08,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:37:08,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:37:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:37:08,312 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:37:08,313 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:37:08,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125146026] [2022-11-19 07:37:08,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125146026] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:37:08,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:37:08,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:37:08,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322823804] [2022-11-19 07:37:08,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:37:08,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:37:08,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:37:08,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:37:08,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:37:08,319 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 07:37:08,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:37:08,393 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-11-19 07:37:08,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:37:08,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-11-19 07:37:08,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:37:08,395 INFO L225 Difference]: With dead ends: 37 [2022-11-19 07:37:08,395 INFO L226 Difference]: Without dead ends: 29 [2022-11-19 07:37:08,395 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:37:08,397 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:37:08,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 49 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:37:08,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-19 07:37:08,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-11-19 07:37:08,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.368421052631579) internal successors, (26), 24 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-19 07:37:08,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-11-19 07:37:08,403 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 16 [2022-11-19 07:37:08,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:37:08,403 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-11-19 07:37:08,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 07:37:08,404 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-11-19 07:37:08,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-19 07:37:08,404 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:37:08,405 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:37:08,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 07:37:08,405 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-19 07:37:08,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:37:08,406 INFO L85 PathProgramCache]: Analyzing trace with hash 511982759, now seen corresponding path program 1 times [2022-11-19 07:37:08,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:37:08,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449388937] [2022-11-19 07:37:08,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:37:08,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:37:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:37:08,599 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 07:37:08,600 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:37:08,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449388937] [2022-11-19 07:37:08,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449388937] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:37:08,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418965310] [2022-11-19 07:37:08,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:37:08,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:37:08,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f38e3212-f18d-4c31-b1eb-6837c349e1e4/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:37:08,605 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f38e3212-f18d-4c31-b1eb-6837c349e1e4/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:37:08,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f38e3212-f18d-4c31-b1eb-6837c349e1e4/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 07:37:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:37:08,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 07:37:08,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:37:08,887 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 07:37:08,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:37:08,976 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 07:37:08,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418965310] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:37:08,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [982486145] [2022-11-19 07:37:09,007 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-19 07:37:09,007 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:37:09,010 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:37:09,016 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:37:09,016 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:37:09,141 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:37:09,150 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:37:09,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-19 07:37:09,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:37:09,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:37:09,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-19 07:37:09,786 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:37:09,801 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-19 07:37:09,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 173 [2022-11-19 07:37:09,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:37:09,832 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-19 07:37:09,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 161 [2022-11-19 07:37:09,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-19 07:37:10,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:37:10,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:37:10,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:37:10,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:37:10,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:37:10,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:37:10,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:37:10,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:37:11,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-19 07:37:11,023 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:37:11,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-19 07:37:11,200 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:37:11,210 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:37:11,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-19 07:37:11,333 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:37:11,343 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:37:11,357 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:37:11,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:37:11,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-19 07:37:11,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:37:11,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-19 07:37:11,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-19 07:37:11,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-19 07:37:11,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-19 07:37:11,931 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 31 for LOIs [2022-11-19 07:37:11,956 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:37:11,964 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:37:11,986 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:37:13,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [982486145] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:37:13,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:37:13,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5, 5, 5] total 22 [2022-11-19 07:37:13,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872617357] [2022-11-19 07:37:13,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:37:13,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-19 07:37:13,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:37:13,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-19 07:37:13,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2022-11-19 07:37:13,420 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 07:37:13,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:37:13,845 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-11-19 07:37:13,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-19 07:37:13,846 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-11-19 07:37:13,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:37:13,847 INFO L225 Difference]: With dead ends: 29 [2022-11-19 07:37:13,847 INFO L226 Difference]: Without dead ends: 25 [2022-11-19 07:37:13,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2022-11-19 07:37:13,849 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 16 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:37:13,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 42 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:37:13,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-19 07:37:13,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2022-11-19 07:37:13,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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:37:13,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-11-19 07:37:13,859 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 21 [2022-11-19 07:37:13,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:37:13,859 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-11-19 07:37:13,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 07:37:13,860 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-11-19 07:37:13,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-19 07:37:13,861 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:37:13,861 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:37:13,876 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f38e3212-f18d-4c31-b1eb-6837c349e1e4/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-19 07:37:14,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f38e3212-f18d-4c31-b1eb-6837c349e1e4/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:37:14,068 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-19 07:37:14,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:37:14,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1009183101, now seen corresponding path program 1 times [2022-11-19 07:37:14,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:37:14,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032668056] [2022-11-19 07:37:14,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:37:14,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:37:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:37:14,278 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:37:14,278 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:37:14,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032668056] [2022-11-19 07:37:14,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032668056] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:37:14,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319052740] [2022-11-19 07:37:14,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:37:14,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:37:14,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f38e3212-f18d-4c31-b1eb-6837c349e1e4/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:37:14,288 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f38e3212-f18d-4c31-b1eb-6837c349e1e4/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:37:14,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f38e3212-f18d-4c31-b1eb-6837c349e1e4/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-19 07:37:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:37:14,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 07:37:14,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:37:14,438 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:37:14,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:37:14,542 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:37:14,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319052740] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:37:14,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [539684642] [2022-11-19 07:37:14,546 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-19 07:37:14,547 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:37:14,547 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:37:14,548 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:37:14,548 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:37:14,594 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:37:14,601 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:37:14,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:37:14,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-19 07:37:14,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-19 07:37:14,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:37:14,983 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:37:14,998 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-19 07:37:14,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 173 [2022-11-19 07:37:15,019 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:37:15,032 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-19 07:37:15,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 161 [2022-11-19 07:37:15,108 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:37:15,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:37:15,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:37:15,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:37:15,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:37:15,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:37:15,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:37:15,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:37:15,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:37:15,874 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:37:15,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-19 07:37:15,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-19 07:37:15,936 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:37:15,941 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:37:15,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-19 07:37:16,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-11-19 07:37:16,078 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 30 for LOIs [2022-11-19 07:37:16,097 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:37:16,107 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:37:16,119 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:37:17,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [539684642] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:37:17,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:37:17,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [6, 6, 6] total 28 [2022-11-19 07:37:17,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042164553] [2022-11-19 07:37:17,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:37:17,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-19 07:37:17,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:37:17,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-19 07:37:17,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=706, Unknown=0, NotChecked=0, Total=812 [2022-11-19 07:37:17,819 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 17 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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:37:18,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:37:18,886 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-11-19 07:37:18,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-19 07:37:18,887 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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 24 [2022-11-19 07:37:18,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:37:18,888 INFO L225 Difference]: With dead ends: 28 [2022-11-19 07:37:18,888 INFO L226 Difference]: Without dead ends: 26 [2022-11-19 07:37:18,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=134, Invalid=922, Unknown=0, NotChecked=0, Total=1056 [2022-11-19 07:37:18,890 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 28 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 07:37:18,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 24 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 07:37:18,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-19 07:37:18,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-19 07:37:18,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 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:37:18,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-11-19 07:37:18,904 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 24 [2022-11-19 07:37:18,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:37:18,904 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-11-19 07:37:18,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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:37:18,905 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-11-19 07:37:18,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-19 07:37:18,906 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:37:18,906 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:37:18,920 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f38e3212-f18d-4c31-b1eb-6837c349e1e4/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-19 07:37:19,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f38e3212-f18d-4c31-b1eb-6837c349e1e4/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:37:19,113 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-19 07:37:19,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:37:19,114 INFO L85 PathProgramCache]: Analyzing trace with hash -197222231, now seen corresponding path program 1 times [2022-11-19 07:37:19,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:37:19,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344010701] [2022-11-19 07:37:19,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:37:19,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:37:19,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:37:19,361 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 07:37:19,362 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:37:19,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344010701] [2022-11-19 07:37:19,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344010701] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:37:19,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833505788] [2022-11-19 07:37:19,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:37:19,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:37:19,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f38e3212-f18d-4c31-b1eb-6837c349e1e4/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:37:19,365 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f38e3212-f18d-4c31-b1eb-6837c349e1e4/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:37:19,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f38e3212-f18d-4c31-b1eb-6837c349e1e4/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-19 07:37:19,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:37:19,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 07:37:19,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:37:19,524 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 07:37:19,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:37:19,609 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 07:37:19,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833505788] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:37:19,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1841595296] [2022-11-19 07:37:19,615 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-19 07:37:19,616 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:37:19,616 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:37:19,616 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:37:19,617 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:37:19,645 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:37:19,650 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:37:19,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-19 07:37:19,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:37:19,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-19 07:37:19,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:37:20,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-19 07:37:20,051 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:37:20,066 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-19 07:37:20,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 169 [2022-11-19 07:37:20,081 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:37:20,096 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-19 07:37:20,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 173 [2022-11-19 07:37:20,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:37:20,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:37:20,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:37:20,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:37:20,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:37:20,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:37:20,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:37:20,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:37:20,932 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:37:20,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-19 07:37:20,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-19 07:37:21,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-19 07:37:21,014 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:37:21,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-19 07:37:21,176 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:37:21,207 INFO L321 Elim1Store]: treesize reduction 58, result has 19.4 percent of original size [2022-11-19 07:37:21,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2022-11-19 07:37:21,308 INFO L321 Elim1Store]: treesize reduction 140, result has 17.2 percent of original size [2022-11-19 07:37:21,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 112 [2022-11-19 07:37:21,351 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:37:21,376 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 30 for LOIs [2022-11-19 07:37:21,396 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:37:21,404 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:37:21,420 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:37:23,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1841595296] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:37:23,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:37:23,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [8, 8, 8] total 25 [2022-11-19 07:37:23,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110922720] [2022-11-19 07:37:23,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:37:23,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-19 07:37:23,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:37:23,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-19 07:37:23,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2022-11-19 07:37:23,366 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 07:37:24,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:37:24,411 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-11-19 07:37:24,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-19 07:37:24,412 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-11-19 07:37:24,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:37:24,412 INFO L225 Difference]: With dead ends: 26 [2022-11-19 07:37:24,413 INFO L226 Difference]: Without dead ends: 0 [2022-11-19 07:37:24,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=98, Invalid=772, Unknown=0, NotChecked=0, Total=870 [2022-11-19 07:37:24,414 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:37:24,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 3 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:37:24,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-19 07:37:24,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-19 07:37:24,416 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:37:24,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-19 07:37:24,416 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2022-11-19 07:37:24,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:37:24,417 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-19 07:37:24,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 07:37:24,417 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-19 07:37:24,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-19 07:37:24,420 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2022-11-19 07:37:24,421 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2022-11-19 07:37:24,421 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2022-11-19 07:37:24,421 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2022-11-19 07:37:24,421 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2022-11-19 07:37:24,421 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2022-11-19 07:37:24,427 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f38e3212-f18d-4c31-b1eb-6837c349e1e4/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-19 07:37:24,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f38e3212-f18d-4c31-b1eb-6837c349e1e4/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:37:24,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-19 07:37:25,270 INFO L902 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 525 531) the Hoare annotation is: true [2022-11-19 07:37:25,270 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 525 531) no Hoare annotation was computed. [2022-11-19 07:37:25,271 INFO L899 garLoopResultBuilder]: For program point L774-5(line 774) no Hoare annotation was computed. [2022-11-19 07:37:25,271 INFO L895 garLoopResultBuilder]: At program point L774-6(lines 774 776) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_entry_point_~j~0#1| 1))) (or (and (<= .cse0 0) (= |ULTIMATE.start_entry_point_~i~0#1| 0)) (and (<= |ULTIMATE.start_entry_point_~i~0#1| 10) (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0) (= |~#ldv_global_msg_list~0.offset| 0) (= |ULTIMATE.start_entry_point_~p~0#1.offset| 0) (= 10 |ULTIMATE.start_entry_point_~len~0#1|) (= |~#ldv_global_msg_list~0.base| 1) (= |#NULL.offset| 0) (<= 1 |ULTIMATE.start_entry_point_~i~0#1|) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_entry_point_~p~0#1.base| 0) (<= 0 .cse0) (= |#NULL.base| 0) (<= |ULTIMATE.start_entry_point_~j~0#1| 2147483646)))) [2022-11-19 07:37:25,272 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 774) no Hoare annotation was computed. [2022-11-19 07:37:25,272 INFO L899 garLoopResultBuilder]: For program point L766(line 766) no Hoare annotation was computed. [2022-11-19 07:37:25,272 INFO L895 garLoopResultBuilder]: At program point L762(line 762) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |~#ldv_global_msg_list~0.base|)) (.cse1 (+ |~#ldv_global_msg_list~0.offset| 4)) (.cse2 (select |#memory_$Pointer$.offset| |~#ldv_global_msg_list~0.base|))) (and (= |~#ldv_global_msg_list~0.base| (select .cse0 |~#ldv_global_msg_list~0.offset|)) (= (select |#length| 1) 8) (= |~#ldv_global_msg_list~0.base| (select .cse0 .cse1)) (= |~#ldv_global_msg_list~0.offset| 0) (= 10 |ULTIMATE.start_entry_point_~len~0#1|) (= |~#ldv_global_msg_list~0.offset| (select .cse2 .cse1)) (= (select |#valid| 1) 1) (= |~#ldv_global_msg_list~0.base| 1) (= (select |#valid| 0) 0) (= |#NULL.offset| 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= (select .cse2 |~#ldv_global_msg_list~0.offset|) |~#ldv_global_msg_list~0.offset|))) [2022-11-19 07:37:25,272 INFO L899 garLoopResultBuilder]: For program point L762-1(line 762) no Hoare annotation was computed. [2022-11-19 07:37:25,273 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 767) no Hoare annotation was computed. [2022-11-19 07:37:25,273 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-19 07:37:25,273 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 774) no Hoare annotation was computed. [2022-11-19 07:37:25,273 INFO L899 garLoopResultBuilder]: For program point L767-3(line 767) no Hoare annotation was computed. [2022-11-19 07:37:25,273 INFO L899 garLoopResultBuilder]: For program point L767-4(line 767) no Hoare annotation was computed. [2022-11-19 07:37:25,274 INFO L895 garLoopResultBuilder]: At program point L767-5(lines 767 771) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0)) (.cse1 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse3 (= 10 |ULTIMATE.start_entry_point_~len~0#1|)) (.cse4 (= |~#ldv_global_msg_list~0.base| 1)) (.cse5 (= |#NULL.offset| 0)) (.cse6 (= |#NULL.base| 0))) (or (let ((.cse2 (+ (* |ULTIMATE.start_entry_point_~i~0#1| 4) (- 4) |ULTIMATE.start_entry_point_~array~0#1.offset|))) (and .cse0 .cse1 (<= |ULTIMATE.start_entry_point_~i~0#1| 2147483647) (= |ULTIMATE.start_entry_point_~p~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~array~0#1.base|) .cse2) |ULTIMATE.start_entry_point_~p~0#1.base|) (= |ULTIMATE.start_entry_point_~p~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~array~0#1.base|) .cse2)) .cse3 .cse4 .cse5 (not (= |ULTIMATE.start_entry_point_~p~0#1.base| 0)) (<= 1 |ULTIMATE.start_entry_point_~i~0#1|) (<= 0 |#StackHeapBarrier|) .cse6)) (let ((.cse7 (select |#memory_$Pointer$.base| |~#ldv_global_msg_list~0.base|)) (.cse8 (+ |~#ldv_global_msg_list~0.offset| 4)) (.cse9 (select |#memory_$Pointer$.offset| |~#ldv_global_msg_list~0.base|))) (and (< |ULTIMATE.start_entry_point_~array~0#1.base| |#StackHeapBarrier|) (= |~#ldv_global_msg_list~0.base| (select .cse7 |~#ldv_global_msg_list~0.offset|)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (* (mod |ULTIMATE.start_entry_point_~len~0#1| 1073741824) 4)) (= |~#ldv_global_msg_list~0.base| (select .cse7 .cse8)) .cse0 (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) 1) .cse1 (not (= |ULTIMATE.start_entry_point_~array~0#1.base| 0)) .cse3 (= |~#ldv_global_msg_list~0.offset| (select .cse9 .cse8)) .cse4 .cse5 (= |ULTIMATE.start_entry_point_~i~0#1| 0) (< 0 |#StackHeapBarrier|) .cse6 (= (select .cse9 |~#ldv_global_msg_list~0.offset|) |~#ldv_global_msg_list~0.offset|))))) [2022-11-19 07:37:25,274 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 767) no Hoare annotation was computed. [2022-11-19 07:37:25,275 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-19 07:37:25,275 INFO L895 garLoopResultBuilder]: At program point L768(line 768) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0)) (.cse1 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse3 (= 10 |ULTIMATE.start_entry_point_~len~0#1|)) (.cse4 (= |~#ldv_global_msg_list~0.base| 1)) (.cse5 (= |#NULL.offset| 0)) (.cse6 (= |#NULL.base| 0))) (or (let ((.cse2 (+ (* |ULTIMATE.start_entry_point_~i~0#1| 4) (- 4) |ULTIMATE.start_entry_point_~array~0#1.offset|))) (and .cse0 (< |ULTIMATE.start_entry_point_~i~0#1| |ULTIMATE.start_entry_point_~len~0#1|) .cse1 (= |ULTIMATE.start_entry_point_~p~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~array~0#1.base|) .cse2) |ULTIMATE.start_entry_point_~p~0#1.base|) (= |ULTIMATE.start_entry_point_~p~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~array~0#1.base|) .cse2)) .cse3 .cse4 .cse5 (not (= |ULTIMATE.start_entry_point_~p~0#1.base| 0)) (<= 1 |ULTIMATE.start_entry_point_~i~0#1|) (<= 0 |#StackHeapBarrier|) .cse6)) (let ((.cse7 (select |#memory_$Pointer$.base| |~#ldv_global_msg_list~0.base|)) (.cse8 (+ |~#ldv_global_msg_list~0.offset| 4)) (.cse9 (select |#memory_$Pointer$.offset| |~#ldv_global_msg_list~0.base|))) (and (< |ULTIMATE.start_entry_point_~array~0#1.base| |#StackHeapBarrier|) (= |~#ldv_global_msg_list~0.base| (select .cse7 |~#ldv_global_msg_list~0.offset|)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (* (mod |ULTIMATE.start_entry_point_~len~0#1| 1073741824) 4)) (= |~#ldv_global_msg_list~0.base| (select .cse7 .cse8)) .cse0 (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) 1) .cse1 (not (= |ULTIMATE.start_entry_point_~array~0#1.base| 0)) .cse3 (= |~#ldv_global_msg_list~0.offset| (select .cse9 .cse8)) .cse4 .cse5 (= |ULTIMATE.start_entry_point_~i~0#1| 0) (< 0 |#StackHeapBarrier|) .cse6 (= (select .cse9 |~#ldv_global_msg_list~0.offset|) |~#ldv_global_msg_list~0.offset|))))) [2022-11-19 07:37:25,275 INFO L899 garLoopResultBuilder]: For program point L768-1(line 768) no Hoare annotation was computed. [2022-11-19 07:37:25,276 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 774) no Hoare annotation was computed. [2022-11-19 07:37:25,276 INFO L899 garLoopResultBuilder]: For program point L769(line 769) no Hoare annotation was computed. [2022-11-19 07:37:25,276 INFO L895 garLoopResultBuilder]: At program point L769-1(lines 760 779) the Hoare annotation is: (or (and (<= |ULTIMATE.start_entry_point_~i~0#1| 10) (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0) (= |~#ldv_global_msg_list~0.offset| 0) (<= 0 |ULTIMATE.start_entry_point_~i~0#1|) (= |ULTIMATE.start_entry_point_~p~0#1.offset| 0) (= 10 |ULTIMATE.start_entry_point_~len~0#1|) (= |~#ldv_global_msg_list~0.base| 1) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_entry_point_~p~0#1.base| 0) (= |#NULL.base| 0)) (= |ULTIMATE.start_entry_point_~i~0#1| 0)) [2022-11-19 07:37:25,276 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 774) no Hoare annotation was computed. [2022-11-19 07:37:25,277 INFO L902 garLoopResultBuilder]: At program point L778(lines 760 779) the Hoare annotation is: true [2022-11-19 07:37:25,277 INFO L899 garLoopResultBuilder]: For program point L774(line 774) no Hoare annotation was computed. [2022-11-19 07:37:25,277 INFO L899 garLoopResultBuilder]: For program point L774-4(line 774) no Hoare annotation was computed. [2022-11-19 07:37:25,281 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-11-19 07:37:25,283 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 07:37:25,297 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 07:37:25,298 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 07:37:25,299 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 07:37:25,301 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 07:37:25,301 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 07:37:25,302 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 07:37:25,306 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 07:37:25,306 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 07:37:25,307 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 07:37:25,307 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 07:37:25,307 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 07:37:25,308 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 07:37:25,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:37:25 BoogieIcfgContainer [2022-11-19 07:37:25,310 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 07:37:25,311 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 07:37:25,311 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 07:37:25,312 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 07:37:25,312 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:37:07" (3/4) ... [2022-11-19 07:37:25,315 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-19 07:37:25,324 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-11-19 07:37:25,328 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-11-19 07:37:25,328 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-19 07:37:25,328 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-19 07:37:25,379 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f38e3212-f18d-4c31-b1eb-6837c349e1e4/bin/utaipan-I9t0OCRTmS/witness.graphml [2022-11-19 07:37:25,379 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 07:37:25,380 INFO L158 Benchmark]: Toolchain (without parser) took 19523.02ms. Allocated memory was 102.8MB in the beginning and 335.5MB in the end (delta: 232.8MB). Free memory was 68.2MB in the beginning and 273.9MB in the end (delta: -205.7MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2022-11-19 07:37:25,380 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 102.8MB. Free memory was 74.6MB in the beginning and 74.5MB in the end (delta: 29.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:37:25,381 INFO L158 Benchmark]: CACSL2BoogieTranslator took 735.46ms. Allocated memory is still 102.8MB. Free memory was 67.9MB in the beginning and 66.9MB in the end (delta: 1.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 07:37:25,381 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.14ms. Allocated memory is still 102.8MB. Free memory was 66.9MB in the beginning and 64.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:37:25,382 INFO L158 Benchmark]: Boogie Preprocessor took 32.80ms. Allocated memory is still 102.8MB. Free memory was 64.8MB in the beginning and 63.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:37:25,382 INFO L158 Benchmark]: RCFGBuilder took 486.57ms. Allocated memory is still 102.8MB. Free memory was 63.1MB in the beginning and 49.4MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-19 07:37:25,385 INFO L158 Benchmark]: TraceAbstraction took 18123.04ms. Allocated memory was 102.8MB in the beginning and 335.5MB in the end (delta: 232.8MB). Free memory was 49.0MB in the beginning and 277.1MB in the end (delta: -228.0MB). Peak memory consumption was 139.7MB. Max. memory is 16.1GB. [2022-11-19 07:37:25,386 INFO L158 Benchmark]: Witness Printer took 68.23ms. Allocated memory is still 335.5MB. Free memory was 277.1MB in the beginning and 273.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:37:25,388 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 102.8MB. Free memory was 74.6MB in the beginning and 74.5MB in the end (delta: 29.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 735.46ms. Allocated memory is still 102.8MB. Free memory was 67.9MB in the beginning and 66.9MB in the end (delta: 1.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.14ms. Allocated memory is still 102.8MB. Free memory was 66.9MB in the beginning and 64.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.80ms. Allocated memory is still 102.8MB. Free memory was 64.8MB in the beginning and 63.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 486.57ms. Allocated memory is still 102.8MB. Free memory was 63.1MB in the beginning and 49.4MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 18123.04ms. Allocated memory was 102.8MB in the beginning and 335.5MB in the end (delta: 232.8MB). Free memory was 49.0MB in the beginning and 277.1MB in the end (delta: -228.0MB). Peak memory consumption was 139.7MB. Max. memory is 16.1GB. * Witness Printer took 68.23ms. Allocated memory is still 335.5MB. Free memory was 277.1MB in the beginning and 273.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 767]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 767]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 774]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 774]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 774]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 774]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 18.0s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 84 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 84 mSDsluCounter, 165 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 114 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 720 IncrementalHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 51 mSDtfsCounter, 720 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 248 GetRequests, 154 SyntacticMatches, 7 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=1, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 16 NumberOfFragments, 434 HoareAnnotationTreeSize, 9 FomulaSimplifications, 42 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 659 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 173 NumberOfCodeBlocks, 173 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 234 ConstructedInterpolants, 0 QuantifiedInterpolants, 534 SizeOfPredicates, 8 NumberOfNonLiveVariables, 416 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 64/103 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: 6.4s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 6, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 60, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 92, TOOLS_POST_TIME: 2.1s, TOOLS_POST_CALL_APPLICATIONS: 34, TOOLS_POST_CALL_TIME: 2.1s, TOOLS_POST_RETURN_APPLICATIONS: 28, TOOLS_POST_RETURN_TIME: 1.5s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 154, TOOLS_QUANTIFIERELIM_TIME: 5.6s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.3s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 210, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 29, DOMAIN_JOIN_TIME: 0.3s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 6, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 10, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 60, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 4, LOOP_SUMMARIZER_CACHE_MISSES: 4, LOOP_SUMMARIZER_OVERALL_TIME: 3.6s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 3.6s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 10, CALL_SUMMARIZER_APPLICATIONS: 28, CALL_SUMMARIZER_CACHE_MISSES: 3, 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: 780, DAG_COMPRESSION_RETAINED_NODES: 169, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 774]: Loop Invariant Derived loop invariant: (j + 1 <= 0 && i == 0) || ((((((((((((i <= 10 && array == 0) && ldv_global_msg_list == 0) && p == 0) && 10 == len) && ldv_global_msg_list == 1) && #NULL == 0) && 1 <= i) && 0 <= unknown-#StackHeapBarrier-unknown) && p == 0) && 0 <= j + 1) && #NULL == 0) && j <= 2147483646) - InvariantResult [Line: 760]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 760]: Loop Invariant Derived loop invariant: ((((((((((i <= 10 && array == 0) && ldv_global_msg_list == 0) && 0 <= i) && p == 0) && 10 == len) && ldv_global_msg_list == 1) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && p == 0) && #NULL == 0) || i == 0 - InvariantResult [Line: 767]: Loop Invariant [2022-11-19 07:37:25,421 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 07:37:25,422 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 07:37:25,422 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 07:37:25,423 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 07:37:25,423 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 07:37:25,423 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 07:37:25,424 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 07:37:25,425 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 07:37:25,425 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 07:37:25,425 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 07:37:25,426 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 07:37:25,426 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((array == 0 && ldv_global_msg_list == 0) && i <= 2147483647) && p == 0) && #memory_$Pointer$[array][i * 4 + -4 + array] == p) && p == #memory_$Pointer$[array][i * 4 + -4 + array]) && 10 == len) && ldv_global_msg_list == 1) && #NULL == 0) && !(p == 0)) && 1 <= i) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((((((((((((array < unknown-#StackHeapBarrier-unknown && ldv_global_msg_list == #memory_$Pointer$[ldv_global_msg_list][ldv_global_msg_list]) && unknown-#length-unknown[array] == len % 1073741824 * 4) && ldv_global_msg_list == #memory_$Pointer$[ldv_global_msg_list][ldv_global_msg_list + 4]) && array == 0) && \valid[array] == 1) && ldv_global_msg_list == 0) && !(array == 0)) && 10 == len) && ldv_global_msg_list == #memory_$Pointer$[ldv_global_msg_list][ldv_global_msg_list + 4]) && ldv_global_msg_list == 1) && #NULL == 0) && i == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && #memory_$Pointer$[ldv_global_msg_list][ldv_global_msg_list] == ldv_global_msg_list) RESULT: Ultimate proved your program to be correct! [2022-11-19 07:37:25,437 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f38e3212-f18d-4c31-b1eb-6837c349e1e4/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE