./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91 --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 12544117846b274bd1cb12a6694f8fda1d77f0b1327b2e9a353cfe44563b100a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 23:13:42,911 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 23:13:43,065 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Overflow-32bit-Taipan_Default.epf [2023-11-24 23:13:43,082 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 23:13:43,083 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 23:13:43,139 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 23:13:43,140 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 23:13:43,141 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 23:13:43,142 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 23:13:43,148 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 23:13:43,148 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-24 23:13:43,149 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-24 23:13:43,149 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-24 23:13:43,151 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-24 23:13:43,152 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-24 23:13:43,152 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-24 23:13:43,153 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-24 23:13:43,153 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-24 23:13:43,153 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-24 23:13:43,154 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-24 23:13:43,155 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-24 23:13:43,155 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-24 23:13:43,157 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 23:13:43,157 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-24 23:13:43,158 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 23:13:43,158 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 23:13:43,159 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 23:13:43,159 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 23:13:43,160 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-24 23:13:43,160 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 23:13:43,162 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-24 23:13:43,162 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-24 23:13:43,162 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 23:13:43,163 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 23:13:43,163 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-24 23:13:43,163 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 23:13:43,164 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 23:13:43,165 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 23:13:43,165 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 23:13:43,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 23:13:43,166 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 23:13:43,166 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 23:13:43,167 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-24 23:13:43,167 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-24 23:13:43,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 23:13:43,168 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 23:13:43,168 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-24 23:13:43,168 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-24 23:13:43,169 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 23:13:43,169 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_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/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_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91 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 -> 12544117846b274bd1cb12a6694f8fda1d77f0b1327b2e9a353cfe44563b100a [2023-11-24 23:13:43,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 23:13:43,553 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 23:13:43,556 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 23:13:43,558 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 23:13:43,559 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 23:13:43,561 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_1.i [2023-11-24 23:13:47,436 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 23:13:47,743 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 23:13:47,744 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/sv-benchmarks/c/ldv-memsafety/memleaks_test18_1.i [2023-11-24 23:13:47,774 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/data/66ccd1e0d/924395dbafd04b72835b2b057806e845/FLAG75b3a4caf [2023-11-24 23:13:47,792 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/data/66ccd1e0d/924395dbafd04b72835b2b057806e845 [2023-11-24 23:13:47,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 23:13:47,797 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 23:13:47,799 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 23:13:47,799 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 23:13:47,806 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 23:13:47,807 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 11:13:47" (1/1) ... [2023-11-24 23:13:47,809 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c588782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:13:47, skipping insertion in model container [2023-11-24 23:13:47,809 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 11:13:47" (1/1) ... [2023-11-24 23:13:47,926 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 23:13:48,515 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 23:13:48,536 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 23:13:48,616 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 23:13:48,681 WARN L675 CHandler]: The function release is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 23:13:48,690 INFO L206 MainTranslator]: Completed translation [2023-11-24 23:13:48,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:13:48 WrapperNode [2023-11-24 23:13:48,691 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 23:13:48,693 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 23:13:48,693 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 23:13:48,694 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 23:13:48,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:13:48" (1/1) ... [2023-11-24 23:13:48,745 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:13:48" (1/1) ... [2023-11-24 23:13:48,775 INFO L138 Inliner]: procedures = 164, calls = 72, calls flagged for inlining = 21, calls inlined = 3, statements flattened = 50 [2023-11-24 23:13:48,777 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 23:13:48,778 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 23:13:48,778 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 23:13:48,779 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 23:13:48,791 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:13:48" (1/1) ... [2023-11-24 23:13:48,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:13:48" (1/1) ... [2023-11-24 23:13:48,803 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:13:48" (1/1) ... [2023-11-24 23:13:48,804 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:13:48" (1/1) ... [2023-11-24 23:13:48,820 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:13:48" (1/1) ... [2023-11-24 23:13:48,824 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:13:48" (1/1) ... [2023-11-24 23:13:48,840 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:13:48" (1/1) ... [2023-11-24 23:13:48,841 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:13:48" (1/1) ... [2023-11-24 23:13:48,844 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 23:13:48,846 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 23:13:48,846 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 23:13:48,846 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 23:13:48,847 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:13:48" (1/1) ... [2023-11-24 23:13:48,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 23:13:48,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:13:48,896 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-24 23:13:48,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-24 23:13:48,937 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-11-24 23:13:48,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-11-24 23:13:48,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-24 23:13:48,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 23:13:48,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-24 23:13:48,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-24 23:13:48,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 23:13:48,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-24 23:13:48,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 23:13:48,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 23:13:49,078 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 23:13:49,080 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 23:13:49,274 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 23:13:49,349 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 23:13:49,351 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-24 23:13:49,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:13:49 BoogieIcfgContainer [2023-11-24 23:13:49,353 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 23:13:49,355 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 23:13:49,355 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 23:13:49,361 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 23:13:49,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 11:13:47" (1/3) ... [2023-11-24 23:13:49,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c2627b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 11:13:49, skipping insertion in model container [2023-11-24 23:13:49,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:13:48" (2/3) ... [2023-11-24 23:13:49,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c2627b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 11:13:49, skipping insertion in model container [2023-11-24 23:13:49,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:13:49" (3/3) ... [2023-11-24 23:13:49,367 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test18_1.i [2023-11-24 23:13:49,387 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 23:13:49,387 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-11-24 23:13:49,442 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 23:13:49,451 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;@93c0c31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 23:13:49,451 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-24 23:13:49,457 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-11-24 23:13:49,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-24 23:13:49,468 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:13:49,469 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:13:49,470 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-24 23:13:49,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:13:49,477 INFO L85 PathProgramCache]: Analyzing trace with hash 671149876, now seen corresponding path program 1 times [2023-11-24 23:13:49,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:13:49,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913988259] [2023-11-24 23:13:49,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:13:49,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:13:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:13:50,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:13:50,051 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:13:50,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913988259] [2023-11-24 23:13:50,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913988259] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:13:50,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:13:50,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 23:13:50,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585108292] [2023-11-24 23:13:50,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:13:50,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 23:13:50,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:13:50,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 23:13:50,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-24 23:13:50,125 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, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-24 23:13:50,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:13:50,264 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2023-11-24 23:13:50,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 23:13:50,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2023-11-24 23:13:50,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:13:50,277 INFO L225 Difference]: With dead ends: 52 [2023-11-24 23:13:50,277 INFO L226 Difference]: Without dead ends: 38 [2023-11-24 23:13:50,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-24 23:13:50,286 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 52 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:13:50,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 30 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:13:50,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-24 23:13:50,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 29. [2023-11-24 23:13:50,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 24 states have internal predecessors, (28), 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-11-24 23:13:50,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-11-24 23:13:50,333 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 8 [2023-11-24 23:13:50,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:13:50,335 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-11-24 23:13:50,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-24 23:13:50,336 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-11-24 23:13:50,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-24 23:13:50,338 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:13:50,338 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:13:50,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 23:13:50,339 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-24 23:13:50,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:13:50,343 INFO L85 PathProgramCache]: Analyzing trace with hash 2087126776, now seen corresponding path program 1 times [2023-11-24 23:13:50,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:13:50,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888848661] [2023-11-24 23:13:50,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:13:50,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:13:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:13:50,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 23:13:50,599 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:13:50,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888848661] [2023-11-24 23:13:50,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888848661] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:13:50,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:13:50,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 23:13:50,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274065194] [2023-11-24 23:13:50,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:13:50,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 23:13:50,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:13:50,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 23:13:50,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 23:13:50,606 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. 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-11-24 23:13:50,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:13:50,676 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2023-11-24 23:13:50,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 23:13:50,677 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-11-24 23:13:50,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:13:50,679 INFO L225 Difference]: With dead ends: 38 [2023-11-24 23:13:50,679 INFO L226 Difference]: Without dead ends: 36 [2023-11-24 23:13:50,680 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-11-24 23:13:50,682 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 11 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 23:13:50,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 43 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 23:13:50,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-24 23:13:50,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2023-11-24 23:13:50,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 26 states have internal predecessors, (30), 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-11-24 23:13:50,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2023-11-24 23:13:50,693 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 13 [2023-11-24 23:13:50,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:13:50,694 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2023-11-24 23:13:50,694 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-11-24 23:13:50,694 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2023-11-24 23:13:50,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-24 23:13:50,695 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:13:50,695 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:13:50,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 23:13:50,696 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-24 23:13:50,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:13:50,697 INFO L85 PathProgramCache]: Analyzing trace with hash -647693624, now seen corresponding path program 1 times [2023-11-24 23:13:50,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:13:50,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576864513] [2023-11-24 23:13:50,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:13:50,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:13:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:13:50,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 23:13:50,891 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:13:50,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576864513] [2023-11-24 23:13:50,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576864513] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:13:50,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584577197] [2023-11-24 23:13:50,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:13:50,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:13:50,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:13:50,900 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:13:50,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-24 23:13:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:13:51,068 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 23:13:51,077 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:13:51,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 23:13:51,173 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 23:13:51,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584577197] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:13:51,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-24 23:13:51,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2023-11-24 23:13:51,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60455221] [2023-11-24 23:13:51,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:13:51,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 23:13:51,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:13:51,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 23:13:51,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-24 23:13:51,185 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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-11-24 23:13:51,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:13:51,279 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2023-11-24 23:13:51,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:13:51,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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-11-24 23:13:51,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:13:51,281 INFO L225 Difference]: With dead ends: 36 [2023-11-24 23:13:51,281 INFO L226 Difference]: Without dead ends: 34 [2023-11-24 23:13:51,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-24 23:13:51,284 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:13:51,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 51 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:13:51,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-24 23:13:51,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2023-11-24 23:13:51,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 24 states have internal predecessors, (28), 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-11-24 23:13:51,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-11-24 23:13:51,294 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 16 [2023-11-24 23:13:51,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:13:51,295 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-11-24 23:13:51,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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-11-24 23:13:51,296 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-11-24 23:13:51,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-24 23:13:51,297 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:13:51,297 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:13:51,310 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-24 23:13:51,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:13:51,503 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-24 23:13:51,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:13:51,504 INFO L85 PathProgramCache]: Analyzing trace with hash -687189811, now seen corresponding path program 1 times [2023-11-24 23:13:51,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:13:51,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009259003] [2023-11-24 23:13:51,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:13:51,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:13:51,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:13:51,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 23:13:51,599 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:13:51,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009259003] [2023-11-24 23:13:51,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009259003] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:13:51,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:13:51,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 23:13:51,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155465287] [2023-11-24 23:13:51,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:13:51,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 23:13:51,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:13:51,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 23:13:51,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 23:13:51,603 INFO L87 Difference]: Start difference. First operand 29 states and 34 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-11-24 23:13:51,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:13:51,657 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2023-11-24 23:13:51,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 23:13:51,658 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-11-24 23:13:51,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:13:51,660 INFO L225 Difference]: With dead ends: 35 [2023-11-24 23:13:51,660 INFO L226 Difference]: Without dead ends: 27 [2023-11-24 23:13:51,661 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-11-24 23:13:51,662 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 3 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 23:13:51,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 42 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 23:13:51,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-24 23:13:51,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-24 23:13:51,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 22 states have internal predecessors, (25), 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-11-24 23:13:51,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-11-24 23:13:51,672 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2023-11-24 23:13:51,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:13:51,673 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-11-24 23:13:51,673 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-11-24 23:13:51,673 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2023-11-24 23:13:51,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-24 23:13:51,674 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:13:51,674 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:13:51,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 23:13:51,675 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-24 23:13:51,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:13:51,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1396334209, now seen corresponding path program 1 times [2023-11-24 23:13:51,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:13:51,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138031371] [2023-11-24 23:13:51,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:13:51,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:13:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:13:51,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 23:13:51,835 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:13:51,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138031371] [2023-11-24 23:13:51,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138031371] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:13:51,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832451686] [2023-11-24 23:13:51,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:13:51,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:13:51,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:13:51,838 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:13:51,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-24 23:13:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:13:51,965 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 23:13:51,967 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:13:51,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 23:13:51,987 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 23:13:51,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832451686] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:13:51,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-24 23:13:51,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-11-24 23:13:51,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044359520] [2023-11-24 23:13:51,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:13:51,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 23:13:51,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:13:51,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 23:13:51,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:13:51,991 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-11-24 23:13:52,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:13:52,015 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2023-11-24 23:13:52,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 23:13:52,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 17 [2023-11-24 23:13:52,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:13:52,017 INFO L225 Difference]: With dead ends: 27 [2023-11-24 23:13:52,018 INFO L226 Difference]: Without dead ends: 26 [2023-11-24 23:13:52,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:13:52,021 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 23:13:52,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 23:13:52,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-24 23:13:52,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-24 23:13:52,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.263157894736842) internal successors, (24), 21 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-11-24 23:13:52,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2023-11-24 23:13:52,036 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 17 [2023-11-24 23:13:52,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:13:52,040 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2023-11-24 23:13:52,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-11-24 23:13:52,041 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2023-11-24 23:13:52,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-24 23:13:52,042 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:13:52,042 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:13:52,049 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-24 23:13:52,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:13:52,258 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-24 23:13:52,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:13:52,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1847381775, now seen corresponding path program 1 times [2023-11-24 23:13:52,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:13:52,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549180829] [2023-11-24 23:13:52,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:13:52,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:13:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:13:52,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-24 23:13:52,325 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:13:52,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549180829] [2023-11-24 23:13:52,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549180829] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:13:52,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:13:52,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 23:13:52,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453624788] [2023-11-24 23:13:52,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:13:52,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 23:13:52,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:13:52,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 23:13:52,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:13:52,328 INFO L87 Difference]: Start difference. First operand 26 states and 30 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-11-24 23:13:52,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:13:52,351 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2023-11-24 23:13:52,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 23:13:52,352 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 19 [2023-11-24 23:13:52,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:13:52,353 INFO L225 Difference]: With dead ends: 26 [2023-11-24 23:13:52,353 INFO L226 Difference]: Without dead ends: 25 [2023-11-24 23:13:52,353 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-11-24 23:13:52,355 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 2 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 23:13:52,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 28 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 23:13:52,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-24 23:13:52,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-24 23:13:52,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-24 23:13:52,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2023-11-24 23:13:52,362 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 19 [2023-11-24 23:13:52,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:13:52,363 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2023-11-24 23:13:52,363 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-11-24 23:13:52,363 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2023-11-24 23:13:52,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-24 23:13:52,364 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:13:52,364 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:13:52,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 23:13:52,365 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-11-24 23:13:52,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:13:52,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1434260264, now seen corresponding path program 1 times [2023-11-24 23:13:52,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:13:52,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321824011] [2023-11-24 23:13:52,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:13:52,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:13:52,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:13:52,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 23:13:52,491 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:13:52,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321824011] [2023-11-24 23:13:52,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321824011] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:13:52,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516649208] [2023-11-24 23:13:52,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:13:52,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:13:52,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:13:52,493 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:13:52,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-24 23:13:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:13:52,608 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-24 23:13:52,611 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:13:52,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 23:13:52,710 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:13:52,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 23:13:52,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516649208] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:13:52,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1471210084] [2023-11-24 23:13:52,827 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-11-24 23:13:52,827 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:13:52,834 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-24 23:13:52,841 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-24 23:13:52,842 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-24 23:13:55,164 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 45 for LOIs [2023-11-24 23:13:55,200 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-24 23:13:56,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1471210084] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:13:56,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:13:56,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6, 6, 6] total 25 [2023-11-24 23:13:56,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275185775] [2023-11-24 23:13:56,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:13:56,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-24 23:13:56,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:13:56,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-24 23:13:56,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2023-11-24 23:13:56,777 INFO L87 Difference]: Start difference. First operand 25 states and 29 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-11-24 23:13:58,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:13:58,247 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2023-11-24 23:13:58,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-24 23:13:58,248 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 20 [2023-11-24 23:13:58,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:13:58,249 INFO L225 Difference]: With dead ends: 35 [2023-11-24 23:13:58,249 INFO L226 Difference]: Without dead ends: 33 [2023-11-24 23:13:58,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2023-11-24 23:13:58,251 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 42 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-24 23:13:58,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 56 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 202 Invalid, 1 Unknown, 0 Unchecked, 0.6s Time] [2023-11-24 23:13:58,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-24 23:13:58,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2023-11-24 23:13:58,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 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-11-24 23:13:58,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-11-24 23:13:58,263 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 20 [2023-11-24 23:13:58,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:13:58,264 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-11-24 23:13:58,264 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-11-24 23:13:58,264 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2023-11-24 23:13:58,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-24 23:13:58,265 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:13:58,266 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:13:58,277 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-24 23:13:58,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-24 23:13:58,472 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-24 23:13:58,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:13:58,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1712965921, now seen corresponding path program 1 times [2023-11-24 23:13:58,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:13:58,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749510050] [2023-11-24 23:13:58,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:13:58,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:13:58,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:13:58,611 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-24 23:13:58,611 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:13:58,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749510050] [2023-11-24 23:13:58,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749510050] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:13:58,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488908413] [2023-11-24 23:13:58,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:13:58,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:13:58,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:13:58,615 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:13:58,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-24 23:13:58,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:13:58,764 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-24 23:13:58,766 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:13:58,853 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-24 23:13:58,853 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:13:58,919 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-24 23:13:58,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488908413] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:13:58,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [239306394] [2023-11-24 23:13:58,927 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-11-24 23:13:58,927 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:13:58,928 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-24 23:13:58,928 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-24 23:13:58,928 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-24 23:14:00,496 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 45 for LOIs [2023-11-24 23:14:00,529 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-24 23:14:01,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [239306394] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:14:01,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:14:01,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6, 6, 6] total 25 [2023-11-24 23:14:01,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274259364] [2023-11-24 23:14:01,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:14:01,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-24 23:14:01,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:14:01,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-24 23:14:01,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2023-11-24 23:14:01,995 INFO L87 Difference]: Start difference. First operand 27 states and 31 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-11-24 23:14:03,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:14:03,041 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2023-11-24 23:14:03,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-24 23:14:03,042 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 23 [2023-11-24 23:14:03,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:14:03,043 INFO L225 Difference]: With dead ends: 31 [2023-11-24 23:14:03,043 INFO L226 Difference]: Without dead ends: 22 [2023-11-24 23:14:03,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2023-11-24 23:14:03,044 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 25 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 23:14:03,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 44 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 172 Invalid, 1 Unknown, 0 Unchecked, 0.4s Time] [2023-11-24 23:14:03,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-24 23:14:03,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-11-24 23:14:03,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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-11-24 23:14:03,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2023-11-24 23:14:03,055 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 23 [2023-11-24 23:14:03,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:14:03,057 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2023-11-24 23:14:03,057 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-11-24 23:14:03,057 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2023-11-24 23:14:03,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-24 23:14:03,058 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:14:03,059 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-11-24 23:14:03,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-24 23:14:03,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:14:03,265 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-24 23:14:03,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:14:03,265 INFO L85 PathProgramCache]: Analyzing trace with hash 195920918, now seen corresponding path program 1 times [2023-11-24 23:14:03,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:14:03,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979252534] [2023-11-24 23:14:03,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:14:03,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:14:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:14:03,413 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-24 23:14:03,413 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:14:03,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979252534] [2023-11-24 23:14:03,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979252534] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:14:03,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410403742] [2023-11-24 23:14:03,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:14:03,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:14:03,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:14:03,415 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:14:03,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-24 23:14:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:14:03,510 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-24 23:14:03,513 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:14:03,554 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-24 23:14:03,554 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:14:03,641 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-24 23:14:03,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410403742] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:14:03,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1954757629] [2023-11-24 23:14:03,644 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-11-24 23:14:03,645 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:14:03,645 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-24 23:14:03,645 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-24 23:14:03,645 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-24 23:14:04,765 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 45 for LOIs [2023-11-24 23:14:04,791 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-24 23:14:06,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1954757629] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:14:06,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:14:06,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6, 6, 6] total 25 [2023-11-24 23:14:06,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104847503] [2023-11-24 23:14:06,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:14:06,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-24 23:14:06,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:14:06,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-24 23:14:06,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2023-11-24 23:14:06,291 INFO L87 Difference]: Start difference. First operand 22 states and 25 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-11-24 23:14:07,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:14:07,453 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2023-11-24 23:14:07,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-24 23:14:07,454 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-11-24 23:14:07,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:14:07,455 INFO L225 Difference]: With dead ends: 26 [2023-11-24 23:14:07,455 INFO L226 Difference]: Without dead ends: 25 [2023-11-24 23:14:07,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=160, Invalid=896, Unknown=0, NotChecked=0, Total=1056 [2023-11-24 23:14:07,456 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 31 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-24 23:14:07,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 23 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 130 Invalid, 1 Unknown, 0 Unchecked, 0.3s Time] [2023-11-24 23:14:07,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-24 23:14:07,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-24 23:14:07,465 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-11-24 23:14:07,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2023-11-24 23:14:07,465 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 25 [2023-11-24 23:14:07,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:14:07,466 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2023-11-24 23:14:07,466 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-11-24 23:14:07,466 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2023-11-24 23:14:07,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-24 23:14:07,467 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:14:07,467 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-11-24 23:14:07,476 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-24 23:14:07,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:14:07,673 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-24 23:14:07,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:14:07,673 INFO L85 PathProgramCache]: Analyzing trace with hash -180385421, now seen corresponding path program 1 times [2023-11-24 23:14:07,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:14:07,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489213689] [2023-11-24 23:14:07,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:14:07,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:14:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:14:07,817 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-24 23:14:07,818 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:14:07,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489213689] [2023-11-24 23:14:07,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489213689] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:14:07,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174707022] [2023-11-24 23:14:07,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:14:07,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:14:07,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:14:07,820 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:14:07,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-24 23:14:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:14:07,915 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-24 23:14:07,917 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:14:07,974 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-24 23:14:07,974 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:14:08,053 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-24 23:14:08,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174707022] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:14:08,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2005967693] [2023-11-24 23:14:08,057 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-11-24 23:14:08,057 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:14:08,058 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-24 23:14:08,058 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-24 23:14:08,058 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-24 23:14:08,983 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 45 for LOIs [2023-11-24 23:14:09,008 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-24 23:14:10,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [2005967693] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:14:10,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:14:10,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [8, 8, 8] total 22 [2023-11-24 23:14:10,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360979372] [2023-11-24 23:14:10,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:14:10,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-24 23:14:10,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:14:10,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-24 23:14:10,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2023-11-24 23:14:10,495 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-11-24 23:14:11,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:14:11,502 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2023-11-24 23:14:11,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-24 23:14:11,503 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-11-24 23:14:11,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:14:11,503 INFO L225 Difference]: With dead ends: 25 [2023-11-24 23:14:11,503 INFO L226 Difference]: Without dead ends: 0 [2023-11-24 23:14:11,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 59 SyntacticMatches, 11 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2023-11-24 23:14:11,505 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 28 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-24 23:14:11,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 14 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 133 Invalid, 1 Unknown, 0 Unchecked, 0.3s Time] [2023-11-24 23:14:11,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-24 23:14:11,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-24 23:14:11,506 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-11-24 23:14:11,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-24 23:14:11,506 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2023-11-24 23:14:11,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:14:11,507 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-24 23:14:11,507 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-11-24 23:14:11,507 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-24 23:14:11,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-24 23:14:11,510 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2023-11-24 23:14:11,510 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2023-11-24 23:14:11,511 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2023-11-24 23:14:11,511 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2023-11-24 23:14:11,511 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2023-11-24 23:14:11,511 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2023-11-24 23:14:11,516 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-24 23:14:11,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:14:11,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-24 23:14:13,370 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-11-24 23:14:13,371 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 525 531) no Hoare annotation was computed. [2023-11-24 23:14:13,371 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 773) no Hoare annotation was computed. [2023-11-24 23:14:13,371 INFO L899 garLoopResultBuilder]: For program point L766(line 766) no Hoare annotation was computed. [2023-11-24 23:14:13,371 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-11-24 23:14:13,371 INFO L899 garLoopResultBuilder]: For program point L762-1(line 762) no Hoare annotation was computed. [2023-11-24 23:14:13,371 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 767) no Hoare annotation was computed. [2023-11-24 23:14:13,371 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 773) no Hoare annotation was computed. [2023-11-24 23:14:13,371 INFO L899 garLoopResultBuilder]: For program point L767-3(line 767) no Hoare annotation was computed. [2023-11-24 23:14:13,372 INFO L899 garLoopResultBuilder]: For program point L767-4(line 767) no Hoare annotation was computed. [2023-11-24 23:14:13,373 INFO L895 garLoopResultBuilder]: At program point L767-5(lines 767 771) the Hoare annotation is: (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse9 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse10 (= 10 |ULTIMATE.start_entry_point_~len~0#1|)) (.cse14 (= |~#ldv_global_msg_list~0.base| 1))) (or (let ((.cse6 (select |#memory_$Pointer$.offset| 1)) (.cse4 (<= (+ |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#StackHeapBarrier|)) (.cse1 (= |ULTIMATE.start_entry_point_~array~0#1.base| 0)) (.cse2 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0)) (.cse13 (select |#memory_$Pointer$.base| 1))) (and (= (select |#length| 1) 8) .cse0 (or (exists ((|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_31| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_ldv_malloc_#t~malloc12.base_47| Int) (|v_ldv_malloc_#t~malloc12.offset_47| Int) (|v_#valid_80| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_31| Int) (|v_#length_62| (Array Int Int))) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse3 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and (= |v_ldv_malloc_#t~malloc12.offset_47| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_31|) .cse1 .cse2 (= |#length| |v_#length_62|) .cse3 (= |v_#valid_80| |#valid|) (= |v_ldv_malloc_#t~malloc12.base_47| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_31|)) (and .cse4 (not .cse3) .cse2 (= (store |v_#valid_80| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (store |v_#length_62| |ULTIMATE.start_entry_point_~array~0#1.base| 40) |#length|) (= (select |v_#valid_80| |ULTIMATE.start_entry_point_~array~0#1.base|) 0)))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648)))) (exists ((|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_32| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_ldv_malloc_#t~malloc12.base_47| Int) (|v_ldv_malloc_#t~malloc12.offset_47| Int) (|v_#valid_80| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_32| Int) (|v_#length_62| (Array Int Int))) (and (let ((.cse5 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse4 (not .cse5) .cse2 (= (store |v_#valid_80| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (store |v_#length_62| |ULTIMATE.start_entry_point_~array~0#1.base| 40) |#length|) (= (select |v_#valid_80| |ULTIMATE.start_entry_point_~array~0#1.base|) 0)) (and .cse1 .cse2 (= |#length| |v_#length_62|) .cse5 (= |v_ldv_malloc_#t~malloc12.offset_47| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_32|) (= |v_ldv_malloc_#t~malloc12.base_47| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_32|) (= |v_#valid_80| |#valid|)))) (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648))))) (= (select .cse6 0) 0) (or (exists ((|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1| Int) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_#valid_33| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.offset_17| Int) (|v_ldv_malloc_#t~malloc12.base_17| Int) (|v_#length_26| (Array Int Int))) (and (let ((.cse7 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse1 .cse2 (= |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1| |v_ldv_malloc_#t~malloc12.base_17|) (= |#length| |v_#length_26|) .cse7 (= |v_#valid_33| |#valid|) (= |v_ldv_malloc_#t~malloc12.offset_17| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1|)) (and .cse4 (not .cse7) (= |#length| (store |v_#length_26| |ULTIMATE.start_entry_point_~array~0#1.base| 40)) .cse2 (= (select |v_#valid_33| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) (= (store |v_#valid_33| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|)))) (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648)))) (exists ((|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_2| Int) (|v_ldv_malloc_#t~malloc12.offset_17| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_#valid_33| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.base_17| Int) (|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2| Int) (|v_#length_26| (Array Int Int))) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse8 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and (= |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_2| |v_ldv_malloc_#t~malloc12.base_17|) (= |v_ldv_malloc_#t~malloc12.offset_17| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2|) .cse1 .cse2 (= |#length| |v_#length_26|) .cse8 (= |v_#valid_33| |#valid|)) (and .cse4 (not .cse8) (= |#length| (store |v_#length_26| |ULTIMATE.start_entry_point_~array~0#1.base| 40)) .cse2 (= (select |v_#valid_33| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) (= (store |v_#valid_33| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|)))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648))))) .cse9 (= (select .cse6 4) 0) .cse10 (or (exists ((|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_21| Int) (|v_#length_49| (Array Int Int)) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_#valid_64| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.base_36| Int) (|v_ldv_malloc_#t~malloc12.offset_36| Int) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_21| Int)) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse11 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse4 (not .cse11) (= (store |v_#valid_64| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) .cse2 (= (select |v_#valid_64| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) (= |#length| (store |v_#length_49| |ULTIMATE.start_entry_point_~array~0#1.base| 40))) (and (= |v_ldv_malloc_#t~malloc12.offset_36| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_21|) (= |#length| |v_#length_49|) .cse1 .cse2 (= |v_#valid_64| |#valid|) .cse11 (= |v_ldv_malloc_#t~malloc12.base_36| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_21|)))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648)))) (exists ((|v_#length_49| (Array Int Int)) (|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_64| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.base_36| Int) (|v_ldv_malloc_#t~malloc12.offset_36| Int)) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse12 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse4 (not .cse12) (= (store |v_#valid_64| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) .cse2 (= (select |v_#valid_64| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) (= |#length| (store |v_#length_49| |ULTIMATE.start_entry_point_~array~0#1.base| 40))) (and (= |#length| |v_#length_49|) .cse1 .cse2 (= |v_ldv_malloc_#t~malloc12.offset_36| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_22|) (= |v_#valid_64| |#valid|) .cse12 (= |v_ldv_malloc_#t~malloc12.base_36| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_22|)))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648))))) (= (select .cse13 0) 1) (= (select |#valid| 1) 1) .cse14 (= (select |#valid| 0) 0) (or (exists ((|v_#valid_46| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_11| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_11| Int) (|v_ldv_malloc_#t~malloc12.base_25| Int) (|v_ldv_malloc_#t~malloc12.offset_25| Int) (|v_#length_36| (Array Int Int))) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse15 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and (= (store |v_#valid_46| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) .cse4 (= |#length| (store |v_#length_36| |ULTIMATE.start_entry_point_~array~0#1.base| 40)) (not .cse15) .cse2 (= (select |v_#valid_46| |ULTIMATE.start_entry_point_~array~0#1.base|) 0)) (and .cse1 .cse2 (= |v_#valid_46| |#valid|) (= |v_ldv_malloc_#t~malloc12.base_25| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_11|) (= |v_ldv_malloc_#t~malloc12.offset_25| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_11|) .cse15 (= |#length| |v_#length_36|)))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648)))) (exists ((|v_#valid_46| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_12| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_12| Int) (|v_ldv_malloc_#t~malloc12.base_25| Int) (|v_ldv_malloc_#t~malloc12.offset_25| Int) (|v_#length_36| (Array Int Int))) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse16 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and (= (store |v_#valid_46| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) .cse4 (= |#length| (store |v_#length_36| |ULTIMATE.start_entry_point_~array~0#1.base| 40)) (not .cse16) .cse2 (= (select |v_#valid_46| |ULTIMATE.start_entry_point_~array~0#1.base|) 0)) (and (= |v_ldv_malloc_#t~malloc12.base_25| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_12|) (= |v_ldv_malloc_#t~malloc12.offset_25| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_12|) .cse1 .cse2 (= |v_#valid_46| |#valid|) .cse16 (= |#length| |v_#length_36|)))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648))))) (= |ULTIMATE.start_entry_point_~i~0#1| 0) (= (select .cse13 4) 1))) (and .cse0 .cse9 (<= |ULTIMATE.start_entry_point_~i~0#1| 2147483647) .cse10 .cse14 (<= 1 |ULTIMATE.start_entry_point_~i~0#1|)))) [2023-11-24 23:14:13,373 INFO L899 garLoopResultBuilder]: For program point L772(lines 760 777) no Hoare annotation was computed. [2023-11-24 23:14:13,373 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 767) no Hoare annotation was computed. [2023-11-24 23:14:13,373 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-24 23:14:13,374 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 ((.cse9 (select |#memory_$Pointer$.offset| 1)) (.cse7 (<= (+ |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#StackHeapBarrier|)) (.cse4 (= |ULTIMATE.start_entry_point_~array~0#1.base| 0)) (.cse5 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0)) (.cse14 (select |#memory_$Pointer$.base| 1))) (and (= (select |#length| 1) 8) .cse0 (or (exists ((|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_31| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_ldv_malloc_#t~malloc12.base_47| Int) (|v_ldv_malloc_#t~malloc12.offset_47| Int) (|v_#valid_80| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_31| Int) (|v_#length_62| (Array Int Int))) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse6 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and (= |v_ldv_malloc_#t~malloc12.offset_47| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_31|) .cse4 .cse5 (= |#length| |v_#length_62|) .cse6 (= |v_#valid_80| |#valid|) (= |v_ldv_malloc_#t~malloc12.base_47| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_31|)) (and .cse7 (not .cse6) .cse5 (= (store |v_#valid_80| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (store |v_#length_62| |ULTIMATE.start_entry_point_~array~0#1.base| 40) |#length|) (= (select |v_#valid_80| |ULTIMATE.start_entry_point_~array~0#1.base|) 0)))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648)))) (exists ((|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_32| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_ldv_malloc_#t~malloc12.base_47| Int) (|v_ldv_malloc_#t~malloc12.offset_47| Int) (|v_#valid_80| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_32| Int) (|v_#length_62| (Array Int Int))) (and (let ((.cse8 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse7 (not .cse8) .cse5 (= (store |v_#valid_80| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (store |v_#length_62| |ULTIMATE.start_entry_point_~array~0#1.base| 40) |#length|) (= (select |v_#valid_80| |ULTIMATE.start_entry_point_~array~0#1.base|) 0)) (and .cse4 .cse5 (= |#length| |v_#length_62|) .cse8 (= |v_ldv_malloc_#t~malloc12.offset_47| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_32|) (= |v_ldv_malloc_#t~malloc12.base_47| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_32|) (= |v_#valid_80| |#valid|)))) (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648))))) (= (select .cse9 0) 0) (or (exists ((|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1| Int) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_#valid_33| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.offset_17| Int) (|v_ldv_malloc_#t~malloc12.base_17| Int) (|v_#length_26| (Array Int Int))) (and (let ((.cse10 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse4 .cse5 (= |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1| |v_ldv_malloc_#t~malloc12.base_17|) (= |#length| |v_#length_26|) .cse10 (= |v_#valid_33| |#valid|) (= |v_ldv_malloc_#t~malloc12.offset_17| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1|)) (and .cse7 (not .cse10) (= |#length| (store |v_#length_26| |ULTIMATE.start_entry_point_~array~0#1.base| 40)) .cse5 (= (select |v_#valid_33| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) (= (store |v_#valid_33| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|)))) (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648)))) (exists ((|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_2| Int) (|v_ldv_malloc_#t~malloc12.offset_17| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_#valid_33| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.base_17| Int) (|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2| Int) (|v_#length_26| (Array Int Int))) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse11 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and (= |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_2| |v_ldv_malloc_#t~malloc12.base_17|) (= |v_ldv_malloc_#t~malloc12.offset_17| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2|) .cse4 .cse5 (= |#length| |v_#length_26|) .cse11 (= |v_#valid_33| |#valid|)) (and .cse7 (not .cse11) (= |#length| (store |v_#length_26| |ULTIMATE.start_entry_point_~array~0#1.base| 40)) .cse5 (= (select |v_#valid_33| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) (= (store |v_#valid_33| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|)))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648))))) .cse1 (= (select .cse9 4) 0) .cse2 (or (exists ((|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_21| Int) (|v_#length_49| (Array Int Int)) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_#valid_64| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.base_36| Int) (|v_ldv_malloc_#t~malloc12.offset_36| Int) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_21| Int)) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse12 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse7 (not .cse12) (= (store |v_#valid_64| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) .cse5 (= (select |v_#valid_64| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) (= |#length| (store |v_#length_49| |ULTIMATE.start_entry_point_~array~0#1.base| 40))) (and (= |v_ldv_malloc_#t~malloc12.offset_36| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_21|) (= |#length| |v_#length_49|) .cse4 .cse5 (= |v_#valid_64| |#valid|) .cse12 (= |v_ldv_malloc_#t~malloc12.base_36| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_21|)))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648)))) (exists ((|v_#length_49| (Array Int Int)) (|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_64| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.base_36| Int) (|v_ldv_malloc_#t~malloc12.offset_36| Int)) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse13 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse7 (not .cse13) (= (store |v_#valid_64| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) .cse5 (= (select |v_#valid_64| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) (= |#length| (store |v_#length_49| |ULTIMATE.start_entry_point_~array~0#1.base| 40))) (and (= |#length| |v_#length_49|) .cse4 .cse5 (= |v_ldv_malloc_#t~malloc12.offset_36| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_22|) (= |v_#valid_64| |#valid|) .cse13 (= |v_ldv_malloc_#t~malloc12.base_36| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_22|)))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648))))) (= (select .cse14 0) 1) (= (select |#valid| 1) 1) .cse3 (= (select |#valid| 0) 0) (or (exists ((|v_#valid_46| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_11| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_11| Int) (|v_ldv_malloc_#t~malloc12.base_25| Int) (|v_ldv_malloc_#t~malloc12.offset_25| Int) (|v_#length_36| (Array Int Int))) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse15 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and (= (store |v_#valid_46| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) .cse7 (= |#length| (store |v_#length_36| |ULTIMATE.start_entry_point_~array~0#1.base| 40)) (not .cse15) .cse5 (= (select |v_#valid_46| |ULTIMATE.start_entry_point_~array~0#1.base|) 0)) (and .cse4 .cse5 (= |v_#valid_46| |#valid|) (= |v_ldv_malloc_#t~malloc12.base_25| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_11|) (= |v_ldv_malloc_#t~malloc12.offset_25| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_11|) .cse15 (= |#length| |v_#length_36|)))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648)))) (exists ((|v_#valid_46| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_12| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_12| Int) (|v_ldv_malloc_#t~malloc12.base_25| Int) (|v_ldv_malloc_#t~malloc12.offset_25| Int) (|v_#length_36| (Array Int Int))) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse16 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and (= (store |v_#valid_46| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) .cse7 (= |#length| (store |v_#length_36| |ULTIMATE.start_entry_point_~array~0#1.base| 40)) (not .cse16) .cse5 (= (select |v_#valid_46| |ULTIMATE.start_entry_point_~array~0#1.base|) 0)) (and (= |v_ldv_malloc_#t~malloc12.base_25| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_12|) (= |v_ldv_malloc_#t~malloc12.offset_25| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_12|) .cse4 .cse5 (= |v_#valid_46| |#valid|) .cse16 (= |#length| |v_#length_36|)))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648))))) (= |ULTIMATE.start_entry_point_~i~0#1| 0) (= (select .cse14 4) 1))))) [2023-11-24 23:14:13,375 INFO L899 garLoopResultBuilder]: For program point L768-1(line 768) no Hoare annotation was computed. [2023-11-24 23:14:13,375 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 773) no Hoare annotation was computed. [2023-11-24 23:14:13,375 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-24 23:14:13,375 INFO L899 garLoopResultBuilder]: For program point L773(line 773) no Hoare annotation was computed. [2023-11-24 23:14:13,375 INFO L899 garLoopResultBuilder]: For program point L769(line 769) no Hoare annotation was computed. [2023-11-24 23:14:13,375 INFO L899 garLoopResultBuilder]: For program point L773-4(line 773) no Hoare annotation was computed. [2023-11-24 23:14:13,375 INFO L899 garLoopResultBuilder]: For program point L773-5(line 773) no Hoare annotation was computed. [2023-11-24 23:14:13,375 INFO L895 garLoopResultBuilder]: At program point L773-6(lines 773 775) 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 (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (<= (+ |ULTIMATE.start_entry_point_~j~0#1| 1) 0) (= |ULTIMATE.start_entry_point_~i~0#1| 0)) (and .cse0 .cse1 (<= 0 |ULTIMATE.start_entry_point_~i~0#1|) (= |ULTIMATE.start_entry_point_~p~0#1.offset| 0) .cse2 .cse3 (<= |ULTIMATE.start_entry_point_~j~0#1| 2147483647) (= |ULTIMATE.start_entry_point_~p~0#1.base| 0) (<= |ULTIMATE.start_entry_point_~i~0#1| 9)) (and .cse0 (<= 10 |ULTIMATE.start_entry_point_~i~0#1|) .cse1 (<= |ULTIMATE.start_entry_point_~i~0#1| 2147483647) .cse2 .cse3 (<= |ULTIMATE.start_entry_point_~j~0#1| 2147483646)))) [2023-11-24 23:14:13,377 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 773) no Hoare annotation was computed. [2023-11-24 23:14:13,377 INFO L899 garLoopResultBuilder]: For program point L773-7(lines 760 777) no Hoare annotation was computed. [2023-11-24 23:14:13,381 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:14:13,383 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 23:14:13,421 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated [2023-11-24 23:14:13,424 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_31 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_47 : int, v_ldv_malloc_#t~malloc12.offset_47 : int, v_#valid_80 : [int]int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_31 : int, v_#length_62 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && (((((((v_ldv_malloc_#t~malloc12.offset_47 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_31 && ~array~0!base == 0) && ~array~0!offset == 0) && #length == v_#length_62) && v_ldv_malloc_#t~nondet11_11 == 0) && v_#valid_80 == #valid) && v_ldv_malloc_#t~malloc12.base_47 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_31) || (((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_80[~array~0!base := 1] == #valid) && v_#length_62[~array~0!base := 40] == #length) && v_#valid_80[~array~0!base] == 0))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-24 23:14:13,424 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_32 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_47 : int, v_ldv_malloc_#t~malloc12.offset_47 : int, v_#valid_80 : [int]int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_32 : int, v_#length_62 : [int]int :: (((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_80[~array~0!base := 1] == #valid) && v_#length_62[~array~0!base := 40] == #length) && v_#valid_80[~array~0!base] == 0) || ((((((~array~0!base == 0 && ~array~0!offset == 0) && #length == v_#length_62) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.offset_47 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_32) && v_ldv_malloc_#t~malloc12.base_47 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_32) && v_#valid_80 == #valid)) && v_ldv_malloc_#t~nondet11_11 <= 2147483647) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-24 23:14:13,425 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[1][0] could not be translated [2023-11-24 23:14:13,425 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1 : int, v_ldv_malloc_#t~nondet11_11 : int, v_#valid_33 : [int]int, v_ldv_malloc_#t~malloc12.offset_17 : int, v_ldv_malloc_#t~malloc12.base_17 : int, v_#length_26 : [int]int :: ((((((((~array~0!base == 0 && ~array~0!offset == 0) && v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1 == v_ldv_malloc_#t~malloc12.base_17) && #length == v_#length_26) && v_ldv_malloc_#t~nondet11_11 == 0) && v_#valid_33 == #valid) && v_ldv_malloc_#t~malloc12.offset_17 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1) || (((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && #length == v_#length_26[~array~0!base := 40]) && ~array~0!offset == 0) && v_#valid_33[~array~0!base] == 0) && v_#valid_33[~array~0!base := 1] == #valid)) && v_ldv_malloc_#t~nondet11_11 <= 2147483647) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-24 23:14:13,432 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_2 : int, v_ldv_malloc_#t~malloc12.offset_17 : int, v_ldv_malloc_#t~nondet11_11 : int, v_#valid_33 : [int]int, v_ldv_malloc_#t~malloc12.base_17 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2 : int, v_#length_26 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && (((((((v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_2 == v_ldv_malloc_#t~malloc12.base_17 && v_ldv_malloc_#t~malloc12.offset_17 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2) && ~array~0!base == 0) && ~array~0!offset == 0) && #length == v_#length_26) && v_ldv_malloc_#t~nondet11_11 == 0) && v_#valid_33 == #valid) || (((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && #length == v_#length_26[~array~0!base := 40]) && ~array~0!offset == 0) && v_#valid_33[~array~0!base] == 0) && v_#valid_33[~array~0!base := 1] == #valid))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-24 23:14:13,432 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[1][4] could not be translated [2023-11-24 23:14:13,433 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_21 : int, v_#length_49 : [int]int, v_ldv_malloc_#t~nondet11_11 : int, v_#valid_64 : [int]int, v_ldv_malloc_#t~malloc12.base_36 : int, v_ldv_malloc_#t~malloc12.offset_36 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_21 : int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && ((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && v_#valid_64[~array~0!base := 1] == #valid) && ~array~0!offset == 0) && v_#valid_64[~array~0!base] == 0) && #length == v_#length_49[~array~0!base := 40]) || ((((((v_ldv_malloc_#t~malloc12.offset_36 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_21 && #length == v_#length_49) && ~array~0!base == 0) && ~array~0!offset == 0) && v_#valid_64 == #valid) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.base_36 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_21))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-24 23:14:13,434 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_49 : [int]int, 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_64 : [int]int, v_ldv_malloc_#t~malloc12.base_36 : int, v_ldv_malloc_#t~malloc12.offset_36 : int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && ((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && v_#valid_64[~array~0!base := 1] == #valid) && ~array~0!offset == 0) && v_#valid_64[~array~0!base] == 0) && #length == v_#length_49[~array~0!base := 40]) || ((((((#length == v_#length_49 && ~array~0!base == 0) && ~array~0!offset == 0) && v_ldv_malloc_#t~malloc12.offset_36 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_22) && v_#valid_64 == #valid) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.base_36 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_22))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-24 23:14:13,434 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[1][0] could not be translated [2023-11-24 23:14:13,434 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated [2023-11-24 23:14:13,434 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[0] could not be translated [2023-11-24 23:14:13,435 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_46 : [int]int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_11 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_11 : int, v_ldv_malloc_#t~malloc12.base_25 : int, v_ldv_malloc_#t~malloc12.offset_25 : int, v_#length_36 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && ((((((v_#valid_46[~array~0!base := 1] == #valid && ~array~0!base + 1 <= #StackHeapBarrier) && #length == v_#length_36[~array~0!base := 40]) && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_46[~array~0!base] == 0) || ((((((~array~0!base == 0 && ~array~0!offset == 0) && v_#valid_46 == #valid) && v_ldv_malloc_#t~malloc12.base_25 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_11) && v_ldv_malloc_#t~malloc12.offset_25 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_11) && v_ldv_malloc_#t~nondet11_11 == 0) && #length == v_#length_36))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-24 23:14:13,436 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_46 : [int]int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_12 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_12 : int, v_ldv_malloc_#t~malloc12.base_25 : int, v_ldv_malloc_#t~malloc12.offset_25 : int, v_#length_36 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && ((((((v_#valid_46[~array~0!base := 1] == #valid && ~array~0!base + 1 <= #StackHeapBarrier) && #length == v_#length_36[~array~0!base := 40]) && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_46[~array~0!base] == 0) || ((((((v_ldv_malloc_#t~malloc12.base_25 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_12 && v_ldv_malloc_#t~malloc12.offset_25 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_12) && ~array~0!base == 0) && ~array~0!offset == 0) && v_#valid_46 == #valid) && v_ldv_malloc_#t~nondet11_11 == 0) && #length == v_#length_36))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-24 23:14:13,437 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[1][4] could not be translated [2023-11-24 23:14:13,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 11:14:13 BoogieIcfgContainer [2023-11-24 23:14:13,440 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 23:14:13,441 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 23:14:13,441 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 23:14:13,441 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 23:14:13,442 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:13:49" (3/4) ... [2023-11-24 23:14:13,444 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-24 23:14:13,448 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2023-11-24 23:14:13,457 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-11-24 23:14:13,458 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-11-24 23:14:13,458 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-11-24 23:14:13,563 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/witness.graphml [2023-11-24 23:14:13,563 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/witness.yml [2023-11-24 23:14:13,563 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 23:14:13,564 INFO L158 Benchmark]: Toolchain (without parser) took 25767.26ms. Allocated memory was 176.2MB in the beginning and 411.0MB in the end (delta: 234.9MB). Free memory was 128.3MB in the beginning and 140.0MB in the end (delta: -11.7MB). Peak memory consumption was 225.0MB. Max. memory is 16.1GB. [2023-11-24 23:14:13,564 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 125.8MB. Free memory is still 71.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 23:14:13,565 INFO L158 Benchmark]: CACSL2BoogieTranslator took 893.13ms. Allocated memory is still 176.2MB. Free memory was 127.6MB in the beginning and 106.0MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-24 23:14:13,565 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.07ms. Allocated memory is still 176.2MB. Free memory was 106.0MB in the beginning and 103.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 23:14:13,566 INFO L158 Benchmark]: Boogie Preprocessor took 66.56ms. Allocated memory is still 176.2MB. Free memory was 103.9MB in the beginning and 102.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 23:14:13,566 INFO L158 Benchmark]: RCFGBuilder took 507.48ms. Allocated memory is still 176.2MB. Free memory was 102.5MB in the beginning and 87.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-24 23:14:13,567 INFO L158 Benchmark]: TraceAbstraction took 24084.96ms. Allocated memory was 176.2MB in the beginning and 411.0MB in the end (delta: 234.9MB). Free memory was 87.1MB in the beginning and 144.2MB in the end (delta: -57.1MB). Peak memory consumption was 180.9MB. Max. memory is 16.1GB. [2023-11-24 23:14:13,567 INFO L158 Benchmark]: Witness Printer took 122.62ms. Allocated memory is still 411.0MB. Free memory was 144.2MB in the beginning and 140.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-24 23:14:13,570 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.38ms. Allocated memory is still 125.8MB. Free memory is still 71.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 893.13ms. Allocated memory is still 176.2MB. Free memory was 127.6MB in the beginning and 106.0MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.07ms. Allocated memory is still 176.2MB. Free memory was 106.0MB in the beginning and 103.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.56ms. Allocated memory is still 176.2MB. Free memory was 103.9MB in the beginning and 102.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 507.48ms. Allocated memory is still 176.2MB. Free memory was 102.5MB in the beginning and 87.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 24084.96ms. Allocated memory was 176.2MB in the beginning and 411.0MB in the end (delta: 234.9MB). Free memory was 87.1MB in the beginning and 144.2MB in the end (delta: -57.1MB). Peak memory consumption was 180.9MB. Max. memory is 16.1GB. * Witness Printer took 122.62ms. Allocated memory is still 411.0MB. Free memory was 144.2MB in the beginning and 140.0MB 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: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_31 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_47 : int, v_ldv_malloc_#t~malloc12.offset_47 : int, v_#valid_80 : [int]int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_31 : int, v_#length_62 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && (((((((v_ldv_malloc_#t~malloc12.offset_47 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_31 && ~array~0!base == 0) && ~array~0!offset == 0) && #length == v_#length_62) && v_ldv_malloc_#t~nondet11_11 == 0) && v_#valid_80 == #valid) && v_ldv_malloc_#t~malloc12.base_47 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_31) || (((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_80[~array~0!base := 1] == #valid) && v_#length_62[~array~0!base := 40] == #length) && v_#valid_80[~array~0!base] == 0))) && 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_32 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_47 : int, v_ldv_malloc_#t~malloc12.offset_47 : int, v_#valid_80 : [int]int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_32 : int, v_#length_62 : [int]int :: (((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_80[~array~0!base := 1] == #valid) && v_#length_62[~array~0!base := 40] == #length) && v_#valid_80[~array~0!base] == 0) || ((((((~array~0!base == 0 && ~array~0!offset == 0) && #length == v_#length_62) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.offset_47 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_32) && v_ldv_malloc_#t~malloc12.base_47 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_32) && v_#valid_80 == #valid)) && 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][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1 : int, v_ldv_malloc_#t~nondet11_11 : int, v_#valid_33 : [int]int, v_ldv_malloc_#t~malloc12.offset_17 : int, v_ldv_malloc_#t~malloc12.base_17 : int, v_#length_26 : [int]int :: ((((((((~array~0!base == 0 && ~array~0!offset == 0) && v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1 == v_ldv_malloc_#t~malloc12.base_17) && #length == v_#length_26) && v_ldv_malloc_#t~nondet11_11 == 0) && v_#valid_33 == #valid) && v_ldv_malloc_#t~malloc12.offset_17 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1) || (((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && #length == v_#length_26[~array~0!base := 40]) && ~array~0!offset == 0) && v_#valid_33[~array~0!base] == 0) && v_#valid_33[~array~0!base := 1] == #valid)) && v_ldv_malloc_#t~nondet11_11 <= 2147483647) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_2 : int, v_ldv_malloc_#t~malloc12.offset_17 : int, v_ldv_malloc_#t~nondet11_11 : int, v_#valid_33 : [int]int, v_ldv_malloc_#t~malloc12.base_17 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2 : int, v_#length_26 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && (((((((v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_2 == v_ldv_malloc_#t~malloc12.base_17 && v_ldv_malloc_#t~malloc12.offset_17 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2) && ~array~0!base == 0) && ~array~0!offset == 0) && #length == v_#length_26) && v_ldv_malloc_#t~nondet11_11 == 0) && v_#valid_33 == #valid) || (((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && #length == v_#length_26[~array~0!base := 40]) && ~array~0!offset == 0) && v_#valid_33[~array~0!base] == 0) && v_#valid_33[~array~0!base := 1] == #valid))) && 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: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_21 : int, v_#length_49 : [int]int, v_ldv_malloc_#t~nondet11_11 : int, v_#valid_64 : [int]int, v_ldv_malloc_#t~malloc12.base_36 : int, v_ldv_malloc_#t~malloc12.offset_36 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_21 : int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && ((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && v_#valid_64[~array~0!base := 1] == #valid) && ~array~0!offset == 0) && v_#valid_64[~array~0!base] == 0) && #length == v_#length_49[~array~0!base := 40]) || ((((((v_ldv_malloc_#t~malloc12.offset_36 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_21 && #length == v_#length_49) && ~array~0!base == 0) && ~array~0!offset == 0) && v_#valid_64 == #valid) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.base_36 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_21))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_49 : [int]int, 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_64 : [int]int, v_ldv_malloc_#t~malloc12.base_36 : int, v_ldv_malloc_#t~malloc12.offset_36 : int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && ((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && v_#valid_64[~array~0!base := 1] == #valid) && ~array~0!offset == 0) && v_#valid_64[~array~0!base] == 0) && #length == v_#length_49[~array~0!base := 40]) || ((((((#length == v_#length_49 && ~array~0!base == 0) && ~array~0!offset == 0) && v_ldv_malloc_#t~malloc12.offset_36 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_22) && v_#valid_64 == #valid) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.base_36 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_22))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) 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: ArrayAccessExpression #valid[0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_46 : [int]int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_11 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_11 : int, v_ldv_malloc_#t~malloc12.base_25 : int, v_ldv_malloc_#t~malloc12.offset_25 : int, v_#length_36 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && ((((((v_#valid_46[~array~0!base := 1] == #valid && ~array~0!base + 1 <= #StackHeapBarrier) && #length == v_#length_36[~array~0!base := 40]) && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_46[~array~0!base] == 0) || ((((((~array~0!base == 0 && ~array~0!offset == 0) && v_#valid_46 == #valid) && v_ldv_malloc_#t~malloc12.base_25 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_11) && v_ldv_malloc_#t~malloc12.offset_25 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_11) && v_ldv_malloc_#t~nondet11_11 == 0) && #length == v_#length_36))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_46 : [int]int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_12 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_12 : int, v_ldv_malloc_#t~malloc12.base_25 : int, v_ldv_malloc_#t~malloc12.offset_25 : int, v_#length_36 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && ((((((v_#valid_46[~array~0!base := 1] == #valid && ~array~0!base + 1 <= #StackHeapBarrier) && #length == v_#length_36[~array~0!base := 40]) && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_46[~array~0!base] == 0) || ((((((v_ldv_malloc_#t~malloc12.base_25 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_12 && v_ldv_malloc_#t~malloc12.offset_25 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_12) && ~array~0!base == 0) && ~array~0!offset == 0) && v_#valid_46 == #valid) && v_ldv_malloc_#t~nondet11_11 == 0) && #length == v_#length_36))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) 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: 773]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 773]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 773]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 773]: 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: 24.0s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 242 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 234 mSDsluCounter, 349 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 225 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 789 IncrementalHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 124 mSDtfsCounter, 789 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 384 GetRequests, 230 SyntacticMatches, 22 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1073 ImplicationChecksByTransitivity, 9.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=2, InterpolantAutomatonStates: 80, 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, 10 MinimizatonAttempts, 25 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 7 PreInvPairs, 14 NumberOfFragments, 1390 HoareAnnotationTreeSize, 7 FomulaSimplifications, 647 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 5 FomulaSimplificationsInter, 474 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 314 NumberOfCodeBlocks, 314 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 390 ConstructedInterpolants, 0 QuantifiedInterpolants, 976 SizeOfPredicates, 13 NumberOfNonLiveVariables, 683 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 20 InterpolantComputations, 6 PerfectInterpolantSequences, 83/115 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 6.1s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 8, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 88, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 143, TOOLS_POST_TIME: 1.8s, TOOLS_POST_CALL_APPLICATIONS: 48, TOOLS_POST_CALL_TIME: 1.1s, TOOLS_POST_RETURN_APPLICATIONS: 40, TOOLS_POST_RETURN_TIME: 2.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 231, TOOLS_QUANTIFIERELIM_TIME: 4.8s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.2s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 319, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 42, DOMAIN_JOIN_TIME: 0.7s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 11, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 17, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 88, DOMAIN_ISBOTTOM_TIME: 0.2s, LOOP_SUMMARIZER_APPLICATIONS: 6, LOOP_SUMMARIZER_CACHE_MISSES: 6, LOOP_SUMMARIZER_OVERALL_TIME: 1.6s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 1.6s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 17, CALL_SUMMARIZER_APPLICATIONS: 40, CALL_SUMMARIZER_CACHE_MISSES: 4, CALL_SUMMARIZER_OVERALL_TIME: 0.1s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.1s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 1200, DAG_COMPRESSION_RETAINED_NODES: 238, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 767]: Loop Invariant Derived loop invariant: (((10 == len) && (i == 0)) || (((i <= 2147483647) && (10 == len)) && (1 <= i))) - InvariantResult [Line: 773]: Loop Invariant Derived loop invariant: (((((10 <= len) && ((j + 1) <= 0)) && (i == 0)) || ((((0 <= i) && (10 == len)) && (j <= 2147483647)) && (i <= 9))) || ((((10 <= i) && (i <= 2147483647)) && (10 == len)) && (j <= 2147483646))) RESULT: Ultimate proved your program to be correct! [2023-11-24 23:14:13,600 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e81c62-ce2d-454e-92c1-7d44a3e85a98/bin/utaipan-verify-SwPr7d2a91/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