./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 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfda5cdb-dbf3-44bc-ab43-4dbf528c5d45/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfda5cdb-dbf3-44bc-ab43-4dbf528c5d45/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfda5cdb-dbf3-44bc-ab43-4dbf528c5d45/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfda5cdb-dbf3-44bc-ab43-4dbf528c5d45/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfda5cdb-dbf3-44bc-ab43-4dbf528c5d45/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfda5cdb-dbf3-44bc-ab43-4dbf528c5d45/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --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 --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 16:42:38,777 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 16:42:38,846 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfda5cdb-dbf3-44bc-ab43-4dbf528c5d45/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Overflow-32bit-Taipan_Default.epf [2023-12-02 16:42:38,851 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 16:42:38,852 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 16:42:38,883 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 16:42:38,884 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 16:42:38,885 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 16:42:38,885 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 16:42:38,886 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 16:42:38,886 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 16:42:38,887 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 16:42:38,887 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 16:42:38,888 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 16:42:38,888 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 16:42:38,889 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 16:42:38,889 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 16:42:38,890 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 16:42:38,890 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 16:42:38,891 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 16:42:38,891 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 16:42:38,892 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 16:42:38,893 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 16:42:38,894 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 16:42:38,894 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 16:42:38,894 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 16:42:38,895 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 16:42:38,895 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 16:42:38,895 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 16:42:38,896 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 16:42:38,896 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 16:42:38,897 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-12-02 16:42:38,906 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 16:42:38,907 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 16:42:38,907 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 16:42:38,907 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 16:42:38,907 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 16:42:38,908 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 16:42:38,908 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 16:42:38,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 16:42:38,908 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 16:42:38,909 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 16:42:38,909 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 16:42:38,909 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 16:42:38,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 16:42:38,910 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 16:42:38,910 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 16:42:38,910 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 16:42:38,910 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 16:42:38,910 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_bfda5cdb-dbf3-44bc-ab43-4dbf528c5d45/bin/utaipan-verify-nQ1chXbOIh/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_bfda5cdb-dbf3-44bc-ab43-4dbf528c5d45/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 [2023-12-02 16:42:39,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 16:42:39,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 16:42:39,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 16:42:39,173 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 16:42:39,174 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 16:42:39,175 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfda5cdb-dbf3-44bc-ab43-4dbf528c5d45/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i [2023-12-02 16:42:41,921 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 16:42:42,172 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 16:42:42,173 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfda5cdb-dbf3-44bc-ab43-4dbf528c5d45/sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i [2023-12-02 16:42:42,189 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfda5cdb-dbf3-44bc-ab43-4dbf528c5d45/bin/utaipan-verify-nQ1chXbOIh/data/be206cb99/2129479c9df94806885298f00c4e8c32/FLAG28bac1916 [2023-12-02 16:42:42,203 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfda5cdb-dbf3-44bc-ab43-4dbf528c5d45/bin/utaipan-verify-nQ1chXbOIh/data/be206cb99/2129479c9df94806885298f00c4e8c32 [2023-12-02 16:42:42,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 16:42:42,206 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 16:42:42,208 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 16:42:42,208 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 16:42:42,213 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 16:42:42,213 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:42:42" (1/1) ... [2023-12-02 16:42:42,214 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12a37272 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:42:42, skipping insertion in model container [2023-12-02 16:42:42,214 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:42:42" (1/1) ... [2023-12-02 16:42:42,267 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 16:42:42,597 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 16:42:42,614 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 16:42:42,668 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 16:42:42,703 WARN L675 CHandler]: The function release is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 16:42:42,711 INFO L206 MainTranslator]: Completed translation [2023-12-02 16:42:42,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:42:42 WrapperNode [2023-12-02 16:42:42,712 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 16:42:42,713 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 16:42:42,713 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 16:42:42,713 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 16:42:42,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:42:42" (1/1) ... [2023-12-02 16:42:42,738 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:42:42" (1/1) ... [2023-12-02 16:42:42,758 INFO L138 Inliner]: procedures = 164, calls = 73, calls flagged for inlining = 21, calls inlined = 3, statements flattened = 52 [2023-12-02 16:42:42,758 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 16:42:42,759 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 16:42:42,759 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 16:42:42,759 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 16:42:42,768 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:42:42" (1/1) ... [2023-12-02 16:42:42,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:42:42" (1/1) ... [2023-12-02 16:42:42,771 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:42:42" (1/1) ... [2023-12-02 16:42:42,772 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:42:42" (1/1) ... [2023-12-02 16:42:42,777 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:42:42" (1/1) ... [2023-12-02 16:42:42,780 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:42:42" (1/1) ... [2023-12-02 16:42:42,782 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:42:42" (1/1) ... [2023-12-02 16:42:42,783 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:42:42" (1/1) ... [2023-12-02 16:42:42,785 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 16:42:42,786 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 16:42:42,786 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 16:42:42,787 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 16:42:42,787 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:42:42" (1/1) ... [2023-12-02 16:42:42,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 16:42:42,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfda5cdb-dbf3-44bc-ab43-4dbf528c5d45/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:42:42,824 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfda5cdb-dbf3-44bc-ab43-4dbf528c5d45/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 16:42:42,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfda5cdb-dbf3-44bc-ab43-4dbf528c5d45/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 16:42:42,871 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-12-02 16:42:42,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-12-02 16:42:42,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 16:42:42,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 16:42:42,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 16:42:42,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 16:42:42,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 16:42:42,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-12-02 16:42:42,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 16:42:42,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 16:42:42,980 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 16:42:42,982 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 16:42:43,087 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 16:42:43,120 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 16:42:43,120 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-02 16:42:43,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:42:43 BoogieIcfgContainer [2023-12-02 16:42:43,121 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 16:42:43,124 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 16:42:43,124 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 16:42:43,127 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 16:42:43,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 04:42:42" (1/3) ... [2023-12-02 16:42:43,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3152b06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:42:43, skipping insertion in model container [2023-12-02 16:42:43,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:42:42" (2/3) ... [2023-12-02 16:42:43,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3152b06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:42:43, skipping insertion in model container [2023-12-02 16:42:43,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:42:43" (3/3) ... [2023-12-02 16:42:43,130 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test18_2.i [2023-12-02 16:42:43,149 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 16:42:43,149 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-12-02 16:42:43,186 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 16:42:43,192 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=LoopHeads, 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;@355548d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 16:42:43,192 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-12-02 16:42:43,195 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) [2023-12-02 16:42:43,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 16:42:43,202 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:42:43,203 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:42:43,204 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)] === [2023-12-02 16:42:43,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:42:43,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1466366920, now seen corresponding path program 1 times [2023-12-02 16:42:43,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:42:43,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465020328] [2023-12-02 16:42:43,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:42:43,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:42:43,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:42:43,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 16:42:43,521 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:42:43,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465020328] [2023-12-02 16:42:43,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465020328] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:42:43,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:42:43,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 16:42:43,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736266915] [2023-12-02 16:42:43,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:42:43,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 16:42:43,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:42:43,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 16:42:43,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 16:42:43,557 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) [2023-12-02 16:42:43,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:42:43,645 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2023-12-02 16:42:43,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 16:42:43,648 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 [2023-12-02 16:42:43,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:42:43,654 INFO L225 Difference]: With dead ends: 43 [2023-12-02 16:42:43,654 INFO L226 Difference]: Without dead ends: 36 [2023-12-02 16:42:43,656 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 [2023-12-02 16:42:43,659 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 14 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 45 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 [2023-12-02 16:42:43,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 45 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 16:42:43,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-12-02 16:42:43,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2023-12-02 16:42:43,688 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) [2023-12-02 16:42:43,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2023-12-02 16:42:43,691 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 13 [2023-12-02 16:42:43,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:42:43,692 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2023-12-02 16:42:43,693 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) [2023-12-02 16:42:43,693 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2023-12-02 16:42:43,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 16:42:43,694 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:42:43,694 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:42:43,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 16:42:43,694 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)] === [2023-12-02 16:42:43,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:42:43,695 INFO L85 PathProgramCache]: Analyzing trace with hash -465791735, now seen corresponding path program 1 times [2023-12-02 16:42:43,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:42:43,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433417948] [2023-12-02 16:42:43,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:42:43,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:42:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:42:43,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 16:42:43,801 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:42:43,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433417948] [2023-12-02 16:42:43,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433417948] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:42:43,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:42:43,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 16:42:43,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850182860] [2023-12-02 16:42:43,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:42:43,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 16:42:43,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:42:43,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 16:42:43,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 16:42:43,805 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) [2023-12-02 16:42:43,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:42:43,849 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2023-12-02 16:42:43,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 16:42:43,850 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 [2023-12-02 16:42:43,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:42:43,851 INFO L225 Difference]: With dead ends: 37 [2023-12-02 16:42:43,851 INFO L226 Difference]: Without dead ends: 29 [2023-12-02 16:42:43,852 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 [2023-12-02 16:42:43,853 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 16:42:43,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 47 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 16:42:43,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-02 16:42:43,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-12-02 16:42:43,859 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) [2023-12-02 16:42:43,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2023-12-02 16:42:43,860 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 16 [2023-12-02 16:42:43,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:42:43,861 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2023-12-02 16:42:43,861 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) [2023-12-02 16:42:43,861 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2023-12-02 16:42:43,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 16:42:43,862 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:42:43,862 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:42:43,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 16:42:43,863 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)] === [2023-12-02 16:42:43,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:42:43,864 INFO L85 PathProgramCache]: Analyzing trace with hash -318583454, now seen corresponding path program 1 times [2023-12-02 16:42:43,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:42:43,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025839546] [2023-12-02 16:42:43,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:42:43,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:42:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:42:44,054 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 16:42:44,054 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:42:44,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025839546] [2023-12-02 16:42:44,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025839546] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:42:44,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578751842] [2023-12-02 16:42:44,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:42:44,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:42:44,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfda5cdb-dbf3-44bc-ab43-4dbf528c5d45/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:42:44,060 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfda5cdb-dbf3-44bc-ab43-4dbf528c5d45/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:42:44,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfda5cdb-dbf3-44bc-ab43-4dbf528c5d45/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 16:42:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:42:44,164 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 16:42:44,170 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:42:44,241 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 16:42:44,241 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:42:44,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578751842] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:42:44,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 16:42:44,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-12-02 16:42:44,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883654457] [2023-12-02 16:42:44,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:42:44,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 16:42:44,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:42:44,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 16:42:44,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-02 16:42:44,245 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:42:44,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:42:44,302 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2023-12-02 16:42:44,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 16:42:44,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 21 [2023-12-02 16:42:44,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:42:44,304 INFO L225 Difference]: With dead ends: 29 [2023-12-02 16:42:44,304 INFO L226 Difference]: Without dead ends: 27 [2023-12-02 16:42:44,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-12-02 16:42:44,306 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 17 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 16:42:44,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 40 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 16:42:44,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-02 16:42:44,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-02 16:42:44,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.263157894736842) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:42:44,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-12-02 16:42:44,313 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 21 [2023-12-02 16:42:44,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:42:44,313 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-12-02 16:42:44,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:42:44,314 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-12-02 16:42:44,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 16:42:44,315 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:42:44,315 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:42:44,322 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfda5cdb-dbf3-44bc-ab43-4dbf528c5d45/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 16:42:44,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfda5cdb-dbf3-44bc-ab43-4dbf528c5d45/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:42:44,516 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-12-02 16:42:44,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:42:44,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1286152416, now seen corresponding path program 1 times [2023-12-02 16:42:44,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:42:44,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791651583] [2023-12-02 16:42:44,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:42:44,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:42:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:42:44,634 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 16:42:44,634 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:42:44,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791651583] [2023-12-02 16:42:44,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791651583] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:42:44,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95794192] [2023-12-02 16:42:44,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:42:44,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:42:44,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfda5cdb-dbf3-44bc-ab43-4dbf528c5d45/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:42:44,636 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfda5cdb-dbf3-44bc-ab43-4dbf528c5d45/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:42:44,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfda5cdb-dbf3-44bc-ab43-4dbf528c5d45/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 16:42:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:42:44,732 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 16:42:44,735 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:42:44,779 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 16:42:44,779 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:42:44,847 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 16:42:44,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95794192] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:42:44,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [95688038] [2023-12-02 16:42:44,867 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2023-12-02 16:42:44,867 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:42:44,870 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:42:44,876 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:42:44,876 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:42:46,442 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 45 for LOIs [2023-12-02 16:42:46,470 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:42:47,960 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '491#(and (<= 1 |#StackHeapBarrier|) (= |~#ldv_global_msg_list~0.offset| 0) (<= 0 |ULTIMATE.start_entry_point_~i~0#1|) (= 10 |ULTIMATE.start_entry_point_~len~0#1|) (<= 2147483647 |ULTIMATE.start_entry_point_#t~post43#1|) (= |~#ldv_global_msg_list~0.base| 1))' at error location [2023-12-02 16:42:47,961 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:42:47,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:42:47,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-12-02 16:42:47,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593344877] [2023-12-02 16:42:47,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:42:47,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 16:42:47,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:42:47,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 16:42:47,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2023-12-02 16:42:47,964 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 16:42:48,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:42:48,107 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2023-12-02 16:42:48,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 16:42:48,107 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 22 [2023-12-02 16:42:48,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:42:48,109 INFO L225 Difference]: With dead ends: 68 [2023-12-02 16:42:48,109 INFO L226 Difference]: Without dead ends: 66 [2023-12-02 16:42:48,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2023-12-02 16:42:48,111 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 48 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:42:48,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 74 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 16:42:48,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-12-02 16:42:48,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 47. [2023-12-02 16:42:48,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 39 states have internal predecessors, (44), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 16:42:48,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2023-12-02 16:42:48,120 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 22 [2023-12-02 16:42:48,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:42:48,120 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2023-12-02 16:42:48,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 16:42:48,120 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2023-12-02 16:42:48,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 16:42:48,121 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:42:48,121 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:42:48,127 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfda5cdb-dbf3-44bc-ab43-4dbf528c5d45/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 16:42:48,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfda5cdb-dbf3-44bc-ab43-4dbf528c5d45/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:42:48,322 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)] === [2023-12-02 16:42:48,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:42:48,323 INFO L85 PathProgramCache]: Analyzing trace with hash 916800415, now seen corresponding path program 1 times [2023-12-02 16:42:48,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:42:48,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608837000] [2023-12-02 16:42:48,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:42:48,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:42:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:42:48,365 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 16:42:48,365 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:42:48,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608837000] [2023-12-02 16:42:48,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608837000] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:42:48,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:42:48,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 16:42:48,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007980391] [2023-12-02 16:42:48,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:42:48,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 16:42:48,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:42:48,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 16:42:48,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:42:48,367 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 16:42:48,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:42:48,382 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2023-12-02 16:42:48,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 16:42:48,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-12-02 16:42:48,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:42:48,383 INFO L225 Difference]: With dead ends: 47 [2023-12-02 16:42:48,384 INFO L226 Difference]: Without dead ends: 46 [2023-12-02 16:42:48,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:42:48,385 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 2 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 16:42:48,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 30 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 16:42:48,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-02 16:42:48,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-12-02 16:42:48,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 38 states have internal predecessors, (43), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 16:42:48,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2023-12-02 16:42:48,393 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 24 [2023-12-02 16:42:48,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:42:48,393 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2023-12-02 16:42:48,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 16:42:48,394 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2023-12-02 16:42:48,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 16:42:48,394 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:42:48,395 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:42:48,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 16:42:48,395 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-12-02 16:42:48,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:42:48,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1643958119, now seen corresponding path program 1 times [2023-12-02 16:42:48,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:42:48,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281293837] [2023-12-02 16:42:48,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:42:48,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:42:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:42:48,484 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 16:42:48,484 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:42:48,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281293837] [2023-12-02 16:42:48,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281293837] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:42:48,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286234236] [2023-12-02 16:42:48,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:42:48,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:42:48,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfda5cdb-dbf3-44bc-ab43-4dbf528c5d45/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:42:48,487 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfda5cdb-dbf3-44bc-ab43-4dbf528c5d45/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:42:48,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfda5cdb-dbf3-44bc-ab43-4dbf528c5d45/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 16:42:48,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:42:48,569 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 16:42:48,571 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:42:48,608 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 16:42:48,608 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:42:48,681 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 16:42:48,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286234236] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:42:48,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1500218794] [2023-12-02 16:42:48,685 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-12-02 16:42:48,685 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:42:48,685 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:42:48,685 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:42:48,685 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:42:49,393 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 45 for LOIs [2023-12-02 16:42:49,410 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:42:50,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1500218794] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:42:50,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:42:50,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6, 6, 6] total 25 [2023-12-02 16:42:50,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852142888] [2023-12-02 16:42:50,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:42:50,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 16:42:50,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:42:50,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 16:42:50,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2023-12-02 16:42:50,513 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 14 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 16:42:51,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:42:51,334 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2023-12-02 16:42:51,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 16:42:51,334 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2023-12-02 16:42:51,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:42:51,335 INFO L225 Difference]: With dead ends: 50 [2023-12-02 16:42:51,335 INFO L226 Difference]: Without dead ends: 47 [2023-12-02 16:42:51,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=160, Invalid=896, Unknown=0, NotChecked=0, Total=1056 [2023-12-02 16:42:51,337 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 27 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:42:51,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 23 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 138 Invalid, 1 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 16:42:51,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-02 16:42:51,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 25. [2023-12-02 16:42:51,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 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) [2023-12-02 16:42:51,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2023-12-02 16:42:51,345 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 25 [2023-12-02 16:42:51,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:42:51,345 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2023-12-02 16:42:51,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 16:42:51,346 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2023-12-02 16:42:51,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 16:42:51,346 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:42:51,347 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:42:51,351 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfda5cdb-dbf3-44bc-ab43-4dbf528c5d45/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 16:42:51,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfda5cdb-dbf3-44bc-ab43-4dbf528c5d45/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:42:51,547 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-12-02 16:42:51,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:42:51,548 INFO L85 PathProgramCache]: Analyzing trace with hash 355857779, now seen corresponding path program 1 times [2023-12-02 16:42:51,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:42:51,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434360935] [2023-12-02 16:42:51,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:42:51,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:42:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:42:51,644 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 16:42:51,644 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:42:51,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434360935] [2023-12-02 16:42:51,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434360935] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:42:51,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663275561] [2023-12-02 16:42:51,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:42:51,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:42:51,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfda5cdb-dbf3-44bc-ab43-4dbf528c5d45/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:42:51,646 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfda5cdb-dbf3-44bc-ab43-4dbf528c5d45/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:42:51,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfda5cdb-dbf3-44bc-ab43-4dbf528c5d45/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 16:42:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:42:51,724 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 16:42:51,726 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:42:51,770 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 16:42:51,771 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:42:51,834 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 16:42:51,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663275561] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:42:51,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1750359703] [2023-12-02 16:42:51,837 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-12-02 16:42:51,837 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:42:51,838 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:42:51,838 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:42:51,838 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:42:52,530 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 45 for LOIs [2023-12-02 16:42:52,549 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:42:53,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1750359703] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:42:53,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:42:53,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [8, 8, 8] total 22 [2023-12-02 16:42:53,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556530622] [2023-12-02 16:42:53,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:42:53,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 16:42:53,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:42:53,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 16:42:53,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2023-12-02 16:42:53,436 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 14 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 16:42:54,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:42:54,216 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2023-12-02 16:42:54,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 16:42:54,217 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2023-12-02 16:42:54,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:42:54,218 INFO L225 Difference]: With dead ends: 25 [2023-12-02 16:42:54,218 INFO L226 Difference]: Without dead ends: 0 [2023-12-02 16:42:54,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 62 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2023-12-02 16:42:54,219 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 18 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:42:54,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 14 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 136 Invalid, 1 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 16:42:54,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-02 16:42:54,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-02 16:42:54,220 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) [2023-12-02 16:42:54,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-02 16:42:54,221 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2023-12-02 16:42:54,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:42:54,221 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-02 16:42:54,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 16:42:54,221 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-02 16:42:54,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-02 16:42:54,223 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2023-12-02 16:42:54,224 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2023-12-02 16:42:54,224 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2023-12-02 16:42:54,224 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2023-12-02 16:42:54,224 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2023-12-02 16:42:54,224 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2023-12-02 16:42:54,229 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfda5cdb-dbf3-44bc-ab43-4dbf528c5d45/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-02 16:42:54,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfda5cdb-dbf3-44bc-ab43-4dbf528c5d45/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:42:54,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-02 16:42:55,288 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 525 531) the Hoare annotation is: (let ((.cse3 (not (= |ldv_malloc_#in~size| 4)))) (or (let ((.cse0 (not (= |~#ldv_global_msg_list~0.offset| 0))) (.cse1 (< |#StackHeapBarrier| 1)) (.cse2 (not (= |~#ldv_global_msg_list~0.base| 1)))) (and (or (not (= 40 |ldv_malloc_#in~size|)) .cse0 .cse1 .cse2) (or .cse0 .cse3 .cse1 .cse2))) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (and (let ((.cse4 (select |#memory_$Pointer$.offset| 1)) (.cse5 (select |#memory_$Pointer$.base| 1))) (or (not (= (select |old(#valid)| 1) 1)) (not (= (select .cse4 0) 0)) (not (= (select .cse4 4) 0)) (not (= (select |old(#length)| 1) 8)) (not (= (select .cse5 4) 1)) (not (= (select .cse5 0) 1)) (not (= (select |old(#valid)| 0) 0)))) .cse3))) [2023-12-02 16:42:55,288 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 525 531) no Hoare annotation was computed. [2023-12-02 16:42:55,288 INFO L899 garLoopResultBuilder]: For program point L774-5(line 774) no Hoare annotation was computed. [2023-12-02 16:42:55,288 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 (<= 1 |#StackHeapBarrier|) (= |~#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) (<= |ULTIMATE.start_entry_point_~j~0#1| 2147483647) (<= 1 |ULTIMATE.start_entry_point_~i~0#1|) (= |ULTIMATE.start_entry_point_~p~0#1.base| 0) (<= 0 .cse0) (<= |ULTIMATE.start_entry_point_~i~0#1| 9)))) [2023-12-02 16:42:55,288 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 774) no Hoare annotation was computed. [2023-12-02 16:42:55,288 INFO L899 garLoopResultBuilder]: For program point L766(line 766) no Hoare annotation was computed. [2023-12-02 16:42:55,288 INFO L895 garLoopResultBuilder]: At program point L762(line 762) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.offset| 1)) (.cse1 (select |#memory_$Pointer$.base| 1))) (and (= (select |#length| 1) 8) (<= 1 |#StackHeapBarrier|) (= (select .cse0 0) 0) (= |~#ldv_global_msg_list~0.offset| 0) (= (select .cse0 4) 0) (= 10 |ULTIMATE.start_entry_point_~len~0#1|) (= (select .cse1 0) 1) (= (select |#valid| 1) 1) (= |~#ldv_global_msg_list~0.base| 1) (= (select |#valid| 0) 0) (= (select .cse1 4) 1))) [2023-12-02 16:42:55,288 INFO L899 garLoopResultBuilder]: For program point L762-1(line 762) no Hoare annotation was computed. [2023-12-02 16:42:55,289 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 767) no Hoare annotation was computed. [2023-12-02 16:42:55,289 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 774) no Hoare annotation was computed. [2023-12-02 16:42:55,289 INFO L899 garLoopResultBuilder]: For program point L767-3(line 767) no Hoare annotation was computed. [2023-12-02 16:42:55,289 INFO L899 garLoopResultBuilder]: For program point L767-4(line 767) no Hoare annotation was computed. [2023-12-02 16:42:55,291 INFO L895 garLoopResultBuilder]: At program point L767-5(lines 767 771) the Hoare annotation is: (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse2 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse8 (= 10 |ULTIMATE.start_entry_point_~len~0#1|)) (.cse12 (= |~#ldv_global_msg_list~0.base| 1))) (or (let ((.cse1 (select |#memory_$Pointer$.offset| 1)) (.cse6 (<= (+ |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#StackHeapBarrier|)) (.cse3 (= |ULTIMATE.start_entry_point_~array~0#1.base| 0)) (.cse4 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0)) (.cse9 (select |#memory_$Pointer$.base| 1))) (and (= (select |#length| 1) 8) .cse0 (= (select .cse1 0) 0) .cse2 (or (exists ((|v_ldv_malloc_#t~nondet11_11| Int) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_22| Int) (|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_22| Int) (|v_#valid_71| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.offset_42| Int) (|v_#length_55| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.base_42| Int)) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse5 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse3 .cse4 (= |v_ldv_malloc_#t~malloc12.offset_42| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_22|) (= |#length| |v_#length_55|) .cse5 (= |v_ldv_malloc_#t~malloc12.base_42| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_22|) (= |v_#valid_71| |#valid|)) (and .cse6 (not .cse5) .cse4 (= (store |v_#valid_71| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (select |v_#valid_71| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) (= |#length| (store |v_#length_55| |ULTIMATE.start_entry_point_~array~0#1.base| 40))))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648)))) (exists ((|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_21| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_#valid_71| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.offset_42| Int) (|v_#length_55| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_21| Int) (|v_ldv_malloc_#t~malloc12.base_42| Int)) (and (let ((.cse7 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse3 .cse4 (= |v_ldv_malloc_#t~malloc12.base_42| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_21|) (= |#length| |v_#length_55|) .cse7 (= |v_ldv_malloc_#t~malloc12.offset_42| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_21|) (= |v_#valid_71| |#valid|)) (and .cse6 (not .cse7) .cse4 (= (store |v_#valid_71| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (select |v_#valid_71| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) (= |#length| (store |v_#length_55| |ULTIMATE.start_entry_point_~array~0#1.base| 40))))) (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648))))) (= (select .cse1 4) 0) .cse8 (= (select .cse9 0) 1) (= (select |#valid| 1) 1) (or (exists ((|v_ldv_malloc_#t~nondet11_11| Int) (|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_12| Int) (|v_#valid_55| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_12| Int) (|v_#length_42| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.offset_31| Int) (|v_ldv_malloc_#t~malloc12.base_31| Int)) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse10 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse6 (not .cse10) .cse4 (= (store |v_#valid_55| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (store |v_#length_42| |ULTIMATE.start_entry_point_~array~0#1.base| 40) |#length|) (= (select |v_#valid_55| |ULTIMATE.start_entry_point_~array~0#1.base|) 0)) (and .cse3 .cse4 .cse10 (= |v_ldv_malloc_#t~malloc12.base_31| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_12|) (= |v_ldv_malloc_#t~malloc12.offset_31| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_12|) (= |#length| |v_#length_42|) (= |v_#valid_55| |#valid|)))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648)))) (exists ((|v_ldv_malloc_#t~nondet11_11| Int) (|v_#valid_55| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_11| Int) (|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_11| Int) (|v_#length_42| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.offset_31| Int) (|v_ldv_malloc_#t~malloc12.base_31| Int)) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse11 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse6 (not .cse11) .cse4 (= (store |v_#valid_55| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (store |v_#length_42| |ULTIMATE.start_entry_point_~array~0#1.base| 40) |#length|) (= (select |v_#valid_55| |ULTIMATE.start_entry_point_~array~0#1.base|) 0)) (and .cse3 (= |v_ldv_malloc_#t~malloc12.offset_31| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_11|) .cse4 .cse11 (= |#length| |v_#length_42|) (= |v_#valid_55| |#valid|) (= |v_ldv_malloc_#t~malloc12.base_31| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_11|)))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648))))) .cse12 (= (select |#valid| 0) 0) (= |ULTIMATE.start_entry_point_~i~0#1| 0) (= (select .cse9 4) 1))) (and .cse0 .cse2 (<= |ULTIMATE.start_entry_point_~i~0#1| 2147483647) .cse8 .cse12 (<= 1 |ULTIMATE.start_entry_point_~i~0#1|)))) [2023-12-02 16:42:55,291 INFO L899 garLoopResultBuilder]: For program point L767-6(lines 760 779) no Hoare annotation was computed. [2023-12-02 16:42:55,291 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 767) no Hoare annotation was computed. [2023-12-02 16:42:55,291 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-02 16:42:55,292 INFO L895 garLoopResultBuilder]: At program point L768(line 768) the Hoare annotation is: (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse1 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse2 (= 10 |ULTIMATE.start_entry_point_~len~0#1|)) (.cse3 (= |~#ldv_global_msg_list~0.base| 1))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 1 |ULTIMATE.start_entry_point_~i~0#1|) (<= |ULTIMATE.start_entry_point_~i~0#1| 9)) (let ((.cse4 (select |#memory_$Pointer$.offset| 1)) (.cse8 (<= (+ |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#StackHeapBarrier|)) (.cse5 (= |ULTIMATE.start_entry_point_~array~0#1.base| 0)) (.cse6 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0)) (.cse10 (select |#memory_$Pointer$.base| 1))) (and (= (select |#length| 1) 8) .cse0 (= (select .cse4 0) 0) .cse1 (or (exists ((|v_ldv_malloc_#t~nondet11_11| Int) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_22| Int) (|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_22| Int) (|v_#valid_71| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.offset_42| Int) (|v_#length_55| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.base_42| Int)) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse7 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse5 .cse6 (= |v_ldv_malloc_#t~malloc12.offset_42| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_22|) (= |#length| |v_#length_55|) .cse7 (= |v_ldv_malloc_#t~malloc12.base_42| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_22|) (= |v_#valid_71| |#valid|)) (and .cse8 (not .cse7) .cse6 (= (store |v_#valid_71| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (select |v_#valid_71| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) (= |#length| (store |v_#length_55| |ULTIMATE.start_entry_point_~array~0#1.base| 40))))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648)))) (exists ((|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_21| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_#valid_71| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.offset_42| Int) (|v_#length_55| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_21| Int) (|v_ldv_malloc_#t~malloc12.base_42| Int)) (and (let ((.cse9 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse5 .cse6 (= |v_ldv_malloc_#t~malloc12.base_42| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_21|) (= |#length| |v_#length_55|) .cse9 (= |v_ldv_malloc_#t~malloc12.offset_42| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_21|) (= |v_#valid_71| |#valid|)) (and .cse8 (not .cse9) .cse6 (= (store |v_#valid_71| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (select |v_#valid_71| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) (= |#length| (store |v_#length_55| |ULTIMATE.start_entry_point_~array~0#1.base| 40))))) (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648))))) (= (select .cse4 4) 0) .cse2 (= (select .cse10 0) 1) (= (select |#valid| 1) 1) (or (exists ((|v_ldv_malloc_#t~nondet11_11| Int) (|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_12| Int) (|v_#valid_55| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_12| Int) (|v_#length_42| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.offset_31| Int) (|v_ldv_malloc_#t~malloc12.base_31| Int)) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse11 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse8 (not .cse11) .cse6 (= (store |v_#valid_55| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (store |v_#length_42| |ULTIMATE.start_entry_point_~array~0#1.base| 40) |#length|) (= (select |v_#valid_55| |ULTIMATE.start_entry_point_~array~0#1.base|) 0)) (and .cse5 .cse6 .cse11 (= |v_ldv_malloc_#t~malloc12.base_31| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_12|) (= |v_ldv_malloc_#t~malloc12.offset_31| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_12|) (= |#length| |v_#length_42|) (= |v_#valid_55| |#valid|)))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648)))) (exists ((|v_ldv_malloc_#t~nondet11_11| Int) (|v_#valid_55| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_11| Int) (|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_11| Int) (|v_#length_42| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.offset_31| Int) (|v_ldv_malloc_#t~malloc12.base_31| Int)) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse12 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse8 (not .cse12) .cse6 (= (store |v_#valid_55| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (store |v_#length_42| |ULTIMATE.start_entry_point_~array~0#1.base| 40) |#length|) (= (select |v_#valid_55| |ULTIMATE.start_entry_point_~array~0#1.base|) 0)) (and .cse5 (= |v_ldv_malloc_#t~malloc12.offset_31| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_11|) .cse6 .cse12 (= |#length| |v_#length_42|) (= |v_#valid_55| |#valid|) (= |v_ldv_malloc_#t~malloc12.base_31| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_11|)))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648))))) .cse3 (= (select |#valid| 0) 0) (= |ULTIMATE.start_entry_point_~i~0#1| 0) (= (select .cse10 4) 1))))) [2023-12-02 16:42:55,292 INFO L899 garLoopResultBuilder]: For program point L768-1(line 768) no Hoare annotation was computed. [2023-12-02 16:42:55,292 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 774) no Hoare annotation was computed. [2023-12-02 16:42:55,292 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-02 16:42:55,292 INFO L899 garLoopResultBuilder]: For program point entry_point_err#1(lines 760 779) no Hoare annotation was computed. [2023-12-02 16:42:55,292 INFO L899 garLoopResultBuilder]: For program point L769(line 769) no Hoare annotation was computed. [2023-12-02 16:42:55,293 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 774) no Hoare annotation was computed. [2023-12-02 16:42:55,293 INFO L899 garLoopResultBuilder]: For program point L774(line 774) no Hoare annotation was computed. [2023-12-02 16:42:55,293 INFO L899 garLoopResultBuilder]: For program point L774-4(line 774) no Hoare annotation was computed. [2023-12-02 16:42:55,295 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:42:55,297 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 16:42:55,312 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated [2023-12-02 16:42:55,313 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[1][0] could not be translated [2023-12-02 16:42:55,313 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_22 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_22 : int, v_#valid_71 : [int]int, v_ldv_malloc_#t~malloc12.offset_42 : int, v_#length_55 : [int]int, v_ldv_malloc_#t~malloc12.base_42 : int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && (((((((~array~0!base == 0 && ~array~0!offset == 0) && v_ldv_malloc_#t~malloc12.offset_42 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_22) && #length == v_#length_55) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.base_42 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_22) && v_#valid_71 == #valid) || (((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_71[~array~0!base := 1] == #valid) && v_#valid_71[~array~0!base] == 0) && #length == v_#length_55[~array~0!base := 40]))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-12-02 16:42:55,313 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_21 : int, v_ldv_malloc_#t~nondet11_11 : int, v_#valid_71 : [int]int, v_ldv_malloc_#t~malloc12.offset_42 : int, v_#length_55 : [int]int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_21 : int, v_ldv_malloc_#t~malloc12.base_42 : int :: ((((((((~array~0!base == 0 && ~array~0!offset == 0) && v_ldv_malloc_#t~malloc12.base_42 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_21) && #length == v_#length_55) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.offset_42 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_21) && v_#valid_71 == #valid) || (((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_71[~array~0!base := 1] == #valid) && v_#valid_71[~array~0!base] == 0) && #length == v_#length_55[~array~0!base := 40])) && v_ldv_malloc_#t~nondet11_11 <= 2147483647) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-12-02 16:42:55,313 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[1][4] could not be translated [2023-12-02 16:42:55,314 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[1][0] could not be translated [2023-12-02 16:42:55,314 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated [2023-12-02 16:42:55,314 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_12 : int, v_#valid_55 : [int]int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_12 : int, v_#length_42 : [int]int, v_ldv_malloc_#t~malloc12.offset_31 : int, v_ldv_malloc_#t~malloc12.base_31 : int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && ((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_55[~array~0!base := 1] == #valid) && v_#length_42[~array~0!base := 40] == #length) && v_#valid_55[~array~0!base] == 0) || ((((((~array~0!base == 0 && ~array~0!offset == 0) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.base_31 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_12) && v_ldv_malloc_#t~malloc12.offset_31 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_12) && #length == v_#length_42) && v_#valid_55 == #valid))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-12-02 16:42:55,314 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~nondet11_11 : int, v_#valid_55 : [int]int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_11 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_11 : int, v_#length_42 : [int]int, v_ldv_malloc_#t~malloc12.offset_31 : int, v_ldv_malloc_#t~malloc12.base_31 : int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && ((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_55[~array~0!base := 1] == #valid) && v_#length_42[~array~0!base := 40] == #length) && v_#valid_55[~array~0!base] == 0) || ((((((~array~0!base == 0 && v_ldv_malloc_#t~malloc12.offset_31 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_11) && ~array~0!offset == 0) && v_ldv_malloc_#t~nondet11_11 == 0) && #length == v_#length_42) && v_#valid_55 == #valid) && v_ldv_malloc_#t~malloc12.base_31 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_11))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-12-02 16:42:55,315 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[0] could not be translated [2023-12-02 16:42:55,315 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[1][4] could not be translated [2023-12-02 16:42:55,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 04:42:55 BoogieIcfgContainer [2023-12-02 16:42:55,315 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 16:42:55,316 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 16:42:55,316 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 16:42:55,316 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 16:42:55,317 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:42:43" (3/4) ... [2023-12-02 16:42:55,319 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-12-02 16:42:55,322 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2023-12-02 16:42:55,326 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-12-02 16:42:55,327 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-12-02 16:42:55,327 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-12-02 16:42:55,412 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfda5cdb-dbf3-44bc-ab43-4dbf528c5d45/bin/utaipan-verify-nQ1chXbOIh/witness.graphml [2023-12-02 16:42:55,413 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfda5cdb-dbf3-44bc-ab43-4dbf528c5d45/bin/utaipan-verify-nQ1chXbOIh/witness.yml [2023-12-02 16:42:55,413 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 16:42:55,414 INFO L158 Benchmark]: Toolchain (without parser) took 13207.32ms. Allocated memory was 165.7MB in the beginning and 287.3MB in the end (delta: 121.6MB). Free memory was 132.6MB in the beginning and 171.2MB in the end (delta: -38.7MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. [2023-12-02 16:42:55,414 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 121.6MB. Free memory is still 93.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 16:42:55,414 INFO L158 Benchmark]: CACSL2BoogieTranslator took 504.18ms. Allocated memory is still 165.7MB. Free memory was 132.6MB in the beginning and 110.4MB in the end (delta: 22.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-12-02 16:42:55,415 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.90ms. Allocated memory is still 165.7MB. Free memory was 110.4MB in the beginning and 108.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 16:42:55,415 INFO L158 Benchmark]: Boogie Preprocessor took 26.34ms. Allocated memory is still 165.7MB. Free memory was 108.3MB in the beginning and 106.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 16:42:55,415 INFO L158 Benchmark]: RCFGBuilder took 335.43ms. Allocated memory is still 165.7MB. Free memory was 106.8MB in the beginning and 121.2MB in the end (delta: -14.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-12-02 16:42:55,416 INFO L158 Benchmark]: TraceAbstraction took 12191.34ms. Allocated memory was 165.7MB in the beginning and 287.3MB in the end (delta: 121.6MB). Free memory was 121.1MB in the beginning and 175.4MB in the end (delta: -54.3MB). Peak memory consumption was 162.7MB. Max. memory is 16.1GB. [2023-12-02 16:42:55,416 INFO L158 Benchmark]: Witness Printer took 97.14ms. Allocated memory is still 287.3MB. Free memory was 175.4MB in the beginning and 171.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-02 16:42:55,418 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 121.6MB. Free memory is still 93.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 504.18ms. Allocated memory is still 165.7MB. Free memory was 132.6MB in the beginning and 110.4MB in the end (delta: 22.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.90ms. Allocated memory is still 165.7MB. Free memory was 110.4MB in the beginning and 108.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.34ms. Allocated memory is still 165.7MB. Free memory was 108.3MB in the beginning and 106.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 335.43ms. Allocated memory is still 165.7MB. Free memory was 106.8MB in the beginning and 121.2MB in the end (delta: -14.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 12191.34ms. Allocated memory was 165.7MB in the beginning and 287.3MB in the end (delta: 121.6MB). Free memory was 121.1MB in the beginning and 175.4MB in the end (delta: -54.3MB). Peak memory consumption was 162.7MB. Max. memory is 16.1GB. * Witness Printer took 97.14ms. Allocated memory is still 287.3MB. Free memory was 175.4MB in the beginning and 171.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[1][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_22 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_22 : int, v_#valid_71 : [int]int, v_ldv_malloc_#t~malloc12.offset_42 : int, v_#length_55 : [int]int, v_ldv_malloc_#t~malloc12.base_42 : int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && (((((((~array~0!base == 0 && ~array~0!offset == 0) && v_ldv_malloc_#t~malloc12.offset_42 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_22) && #length == v_#length_55) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.base_42 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_22) && v_#valid_71 == #valid) || (((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_71[~array~0!base := 1] == #valid) && v_#valid_71[~array~0!base] == 0) && #length == v_#length_55[~array~0!base := 40]))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_21 : int, v_ldv_malloc_#t~nondet11_11 : int, v_#valid_71 : [int]int, v_ldv_malloc_#t~malloc12.offset_42 : int, v_#length_55 : [int]int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_21 : int, v_ldv_malloc_#t~malloc12.base_42 : int :: ((((((((~array~0!base == 0 && ~array~0!offset == 0) && v_ldv_malloc_#t~malloc12.base_42 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_21) && #length == v_#length_55) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.offset_42 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_21) && v_#valid_71 == #valid) || (((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_71[~array~0!base := 1] == #valid) && v_#valid_71[~array~0!base] == 0) && #length == v_#length_55[~array~0!base := 40])) && v_ldv_malloc_#t~nondet11_11 <= 2147483647) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[1][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[1][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_12 : int, v_#valid_55 : [int]int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_12 : int, v_#length_42 : [int]int, v_ldv_malloc_#t~malloc12.offset_31 : int, v_ldv_malloc_#t~malloc12.base_31 : int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && ((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_55[~array~0!base := 1] == #valid) && v_#length_42[~array~0!base := 40] == #length) && v_#valid_55[~array~0!base] == 0) || ((((((~array~0!base == 0 && ~array~0!offset == 0) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.base_31 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_12) && v_ldv_malloc_#t~malloc12.offset_31 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_12) && #length == v_#length_42) && v_#valid_55 == #valid))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~nondet11_11 : int, v_#valid_55 : [int]int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_11 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_11 : int, v_#length_42 : [int]int, v_ldv_malloc_#t~malloc12.offset_31 : int, v_ldv_malloc_#t~malloc12.base_31 : int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && ((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_55[~array~0!base := 1] == #valid) && v_#length_42[~array~0!base := 40] == #length) && v_#valid_55[~array~0!base] == 0) || ((((((~array~0!base == 0 && v_ldv_malloc_#t~malloc12.offset_31 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_11) && ~array~0!offset == 0) && v_ldv_malloc_#t~nondet11_11 == 0) && #length == v_#length_42) && v_#valid_55 == #valid) && v_ldv_malloc_#t~malloc12.base_31 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_11))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[1][4] could not be translated * 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: 12.1s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 131 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 129 mSDsluCounter, 273 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 185 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 455 IncrementalHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 88 mSDtfsCounter, 455 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 294 GetRequests, 183 SyntacticMatches, 12 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=4, InterpolantAutomatonStates: 55, 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, 7 MinimizatonAttempts, 46 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 7 PreInvPairs, 12 NumberOfFragments, 862 HoareAnnotationTreeSize, 7 FomulaSimplifications, 252 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 5 FomulaSimplificationsInter, 272 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 245 NumberOfCodeBlocks, 245 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 306 ConstructedInterpolants, 0 QuantifiedInterpolants, 668 SizeOfPredicates, 10 NumberOfNonLiveVariables, 539 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 94/141 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: 1.4s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 4, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 44, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 71, TOOLS_POST_TIME: 0.4s, TOOLS_POST_CALL_APPLICATIONS: 24, TOOLS_POST_CALL_TIME: 0.3s, TOOLS_POST_RETURN_APPLICATIONS: 20, TOOLS_POST_RETURN_TIME: 0.5s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 115, TOOLS_QUANTIFIERELIM_TIME: 1.1s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 158, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 21, DOMAIN_JOIN_TIME: 0.1s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 5, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 8, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 44, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 3, LOOP_SUMMARIZER_CACHE_MISSES: 3, LOOP_SUMMARIZER_OVERALL_TIME: 0.4s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.4s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 8, CALL_SUMMARIZER_APPLICATIONS: 20, CALL_SUMMARIZER_CACHE_MISSES: 2, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, 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: 561, DAG_COMPRESSION_RETAINED_NODES: 120, 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)) || (((((10 == len) && (j <= 2147483647)) && (1 <= i)) && (0 <= (j + 1))) && (i <= 9))) - InvariantResult [Line: 767]: Loop Invariant Derived loop invariant: (((10 == len) && (i == 0)) || (((i <= 2147483647) && (10 == len)) && (1 <= i))) RESULT: Ultimate proved your program to be correct! [2023-12-02 16:42:55,439 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfda5cdb-dbf3-44bc-ab43-4dbf528c5d45/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE