./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX --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 98678a21a2b37b871d00192aacebe14c4ee9cc87b75400dd7a4adc0ccfa93151 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:46:35,545 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:46:35,633 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Overflow-32bit-Taipan_Default.epf [2023-11-12 00:46:35,640 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:46:35,640 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:46:35,688 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:46:35,689 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:46:35,690 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:46:35,691 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:46:35,696 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:46:35,697 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:46:35,697 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:46:35,697 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:46:35,699 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:46:35,700 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:46:35,700 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:46:35,701 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:46:35,701 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:46:35,701 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:46:35,702 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:46:35,702 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:46:35,703 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:46:35,704 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:46:35,705 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 00:46:35,705 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:46:35,706 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:46:35,706 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:46:35,706 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:46:35,707 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 00:46:35,707 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:46:35,709 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 00:46:35,709 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-12 00:46:35,709 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 00:46:35,709 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:46:35,710 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 00:46:35,710 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:46:35,710 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:46:35,711 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:46:35,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:46:35,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:46:35,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:46:35,712 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 00:46:35,712 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:46:35,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:46:35,713 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 00:46:35,713 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:46:35,713 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:46:35,714 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_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/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_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX 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 -> 98678a21a2b37b871d00192aacebe14c4ee9cc87b75400dd7a4adc0ccfa93151 [2023-11-12 00:46:35,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:46:36,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:46:36,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:46:36,035 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:46:36,036 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:46:36,037 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/ldv-memsafety/memleaks_test18.i [2023-11-12 00:46:39,329 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:46:39,614 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:46:39,614 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/sv-benchmarks/c/ldv-memsafety/memleaks_test18.i [2023-11-12 00:46:39,636 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/data/03f2d2283/c4c0fd2134c74847b7e38f13e882ca5d/FLAG747867c99 [2023-11-12 00:46:39,654 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/data/03f2d2283/c4c0fd2134c74847b7e38f13e882ca5d [2023-11-12 00:46:39,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:46:39,661 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:46:39,665 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:46:39,666 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:46:39,673 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:46:39,674 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:46:39" (1/1) ... [2023-11-12 00:46:39,675 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a18f833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:46:39, skipping insertion in model container [2023-11-12 00:46:39,675 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:46:39" (1/1) ... [2023-11-12 00:46:39,757 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:46:40,219 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:46:40,245 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:46:40,330 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:46:40,367 WARN L672 CHandler]: The function release is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 00:46:40,373 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:46:40,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:46:40 WrapperNode [2023-11-12 00:46:40,374 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:46:40,376 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:46:40,376 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:46:40,376 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:46:40,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:46:40" (1/1) ... [2023-11-12 00:46:40,404 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:46:40" (1/1) ... [2023-11-12 00:46:40,427 INFO L138 Inliner]: procedures = 164, calls = 73, calls flagged for inlining = 21, calls inlined = 3, statements flattened = 51 [2023-11-12 00:46:40,428 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:46:40,428 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:46:40,429 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:46:40,429 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:46:40,439 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:46:40" (1/1) ... [2023-11-12 00:46:40,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:46:40" (1/1) ... [2023-11-12 00:46:40,443 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:46:40" (1/1) ... [2023-11-12 00:46:40,443 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:46:40" (1/1) ... [2023-11-12 00:46:40,450 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:46:40" (1/1) ... [2023-11-12 00:46:40,453 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:46:40" (1/1) ... [2023-11-12 00:46:40,455 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:46:40" (1/1) ... [2023-11-12 00:46:40,456 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:46:40" (1/1) ... [2023-11-12 00:46:40,459 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:46:40,460 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:46:40,460 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:46:40,461 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:46:40,462 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:46:40" (1/1) ... [2023-11-12 00:46:40,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:46:40,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:46:40,498 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 00:46:40,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 00:46:40,538 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-11-12 00:46:40,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-11-12 00:46:40,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 00:46:40,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:46:40,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 00:46:40,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 00:46:40,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:46:40,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-12 00:46:40,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:46:40,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:46:40,687 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:46:40,689 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:46:40,869 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:46:40,922 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:46:40,925 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-12 00:46:40,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:46:40 BoogieIcfgContainer [2023-11-12 00:46:40,929 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:46:40,948 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:46:40,949 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:46:40,953 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:46:40,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:46:39" (1/3) ... [2023-11-12 00:46:40,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@106df8cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:46:40, skipping insertion in model container [2023-11-12 00:46:40,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:46:40" (2/3) ... [2023-11-12 00:46:40,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@106df8cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:46:40, skipping insertion in model container [2023-11-12 00:46:40,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:46:40" (3/3) ... [2023-11-12 00:46:40,959 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test18.i [2023-11-12 00:46:40,980 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:46:40,982 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-11-12 00:46:41,037 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:46:41,046 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;@183c85ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:46:41,046 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-12 00:46:41,050 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-12 00:46:41,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-12 00:46:41,059 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:46:41,059 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:46:41,060 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-12 00:46:41,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:46:41,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1665589493, now seen corresponding path program 1 times [2023-11-12 00:46:41,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:46:41,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156530529] [2023-11-12 00:46:41,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:46:41,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:46:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:46:41,406 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-12 00:46:41,410 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:46:41,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156530529] [2023-11-12 00:46:41,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156530529] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:46:41,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:46:41,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:46:41,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966363367] [2023-11-12 00:46:41,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:46:41,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:46:41,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:46:41,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:46:41,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:46:41,467 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-12 00:46:41,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:46:41,586 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2023-11-12 00:46:41,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:46:41,592 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-12 00:46:41,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:46:41,600 INFO L225 Difference]: With dead ends: 51 [2023-11-12 00:46:41,600 INFO L226 Difference]: Without dead ends: 38 [2023-11-12 00:46:41,604 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-12 00:46:41,612 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 50 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 32 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-12 00:46:41,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 32 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:46:41,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-12 00:46:41,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 29. [2023-11-12 00:46:41,660 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-12 00:46:41,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-11-12 00:46:41,665 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 8 [2023-11-12 00:46:41,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:46:41,668 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-11-12 00:46:41,669 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-12 00:46:41,669 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-11-12 00:46:41,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-12 00:46:41,670 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:46:41,671 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:46:41,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:46:41,671 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-12 00:46:41,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:46:41,672 INFO L85 PathProgramCache]: Analyzing trace with hash 279817044, now seen corresponding path program 1 times [2023-11-12 00:46:41,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:46:41,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374947886] [2023-11-12 00:46:41,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:46:41,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:46:41,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:46:41,890 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-12 00:46:41,891 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:46:41,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374947886] [2023-11-12 00:46:41,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374947886] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:46:41,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:46:41,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:46:41,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959400390] [2023-11-12 00:46:41,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:46:41,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:46:41,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:46:41,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:46:41,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:46:41,896 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-12 00:46:41,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:46:41,977 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2023-11-12 00:46:41,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:46:41,978 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-12 00:46:41,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:46:41,979 INFO L225 Difference]: With dead ends: 38 [2023-11-12 00:46:41,979 INFO L226 Difference]: Without dead ends: 36 [2023-11-12 00:46:41,980 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-12 00:46:41,981 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 11 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 44 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.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:46:41,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 44 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:46:41,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-12 00:46:41,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2023-11-12 00:46:41,990 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-12 00:46:41,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2023-11-12 00:46:41,991 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 13 [2023-11-12 00:46:41,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:46:41,992 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2023-11-12 00:46:41,992 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-12 00:46:41,992 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2023-11-12 00:46:41,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-12 00:46:41,993 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:46:41,994 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:46:41,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 00:46:41,994 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-12 00:46:41,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:46:41,995 INFO L85 PathProgramCache]: Analyzing trace with hash -501898842, now seen corresponding path program 1 times [2023-11-12 00:46:41,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:46:41,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83633636] [2023-11-12 00:46:41,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:46:41,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:46:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:46:42,175 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-12 00:46:42,175 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:46:42,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83633636] [2023-11-12 00:46:42,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83633636] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:46:42,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220039291] [2023-11-12 00:46:42,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:46:42,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:46:42,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:46:42,181 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:46:42,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:46:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:46:42,297 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 00:46:42,303 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:46:42,375 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-12 00:46:42,376 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:46:42,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220039291] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:46:42,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 00:46:42,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2023-11-12 00:46:42,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033279089] [2023-11-12 00:46:42,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:46:42,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:46:42,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:46:42,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:46:42,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:46:42,391 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-12 00:46:42,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:46:42,483 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2023-11-12 00:46:42,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:46:42,484 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-12 00:46:42,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:46:42,487 INFO L225 Difference]: With dead ends: 36 [2023-11-12 00:46:42,487 INFO L226 Difference]: Without dead ends: 34 [2023-11-12 00:46:42,488 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-12 00:46:42,492 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-12 00:46:42,493 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-12 00:46:42,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-12 00:46:42,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2023-11-12 00:46:42,501 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-12 00:46:42,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-11-12 00:46:42,502 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 16 [2023-11-12 00:46:42,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:46:42,503 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-11-12 00:46:42,503 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-12 00:46:42,503 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-11-12 00:46:42,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-12 00:46:42,504 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:46:42,504 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:46:42,513 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-12 00:46:42,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-12 00:46:42,713 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-12 00:46:42,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:46:42,713 INFO L85 PathProgramCache]: Analyzing trace with hash -544165654, now seen corresponding path program 1 times [2023-11-12 00:46:42,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:46:42,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919690896] [2023-11-12 00:46:42,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:46:42,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:46:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:46:42,857 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-12 00:46:42,859 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:46:42,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919690896] [2023-11-12 00:46:42,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919690896] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:46:42,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:46:42,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:46:42,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22071945] [2023-11-12 00:46:42,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:46:42,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:46:42,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:46:42,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:46:42,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:46:42,869 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-12 00:46:42,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:46:42,930 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2023-11-12 00:46:42,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:46:42,930 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-12 00:46:42,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:46:42,931 INFO L225 Difference]: With dead ends: 35 [2023-11-12 00:46:42,931 INFO L226 Difference]: Without dead ends: 27 [2023-11-12 00:46:42,932 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-12 00:46:42,933 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 3 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 43 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-12 00:46:42,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 43 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:46:42,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-12 00:46:42,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-12 00:46:42,939 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-12 00:46:42,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-11-12 00:46:42,940 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2023-11-12 00:46:42,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:46:42,940 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-11-12 00:46:42,940 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-12 00:46:42,940 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2023-11-12 00:46:42,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-12 00:46:42,941 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:46:42,941 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:46:42,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 00:46:42,942 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-12 00:46:42,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:46:42,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1621005153, now seen corresponding path program 1 times [2023-11-12 00:46:42,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:46:42,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218054515] [2023-11-12 00:46:42,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:46:42,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:46:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:46:43,035 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-12 00:46:43,035 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:46:43,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218054515] [2023-11-12 00:46:43,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218054515] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:46:43,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744871765] [2023-11-12 00:46:43,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:46:43,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:46:43,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:46:43,038 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:46:43,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:46:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:46:43,125 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-12 00:46:43,127 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:46:43,143 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-12 00:46:43,144 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:46:43,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744871765] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:46:43,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 00:46:43,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-11-12 00:46:43,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706870571] [2023-11-12 00:46:43,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:46:43,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:46:43,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:46:43,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:46:43,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:46:43,147 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-12 00:46:43,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:46:43,165 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2023-11-12 00:46:43,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:46:43,166 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-12 00:46:43,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:46:43,167 INFO L225 Difference]: With dead ends: 27 [2023-11-12 00:46:43,167 INFO L226 Difference]: Without dead ends: 26 [2023-11-12 00:46:43,168 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-12 00:46:43,168 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 19 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-12 00:46:43,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 19 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:46:43,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-12 00:46:43,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-12 00:46:43,174 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-12 00:46:43,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2023-11-12 00:46:43,175 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 17 [2023-11-12 00:46:43,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:46:43,175 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2023-11-12 00:46:43,176 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-12 00:46:43,176 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2023-11-12 00:46:43,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-12 00:46:43,177 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:46:43,177 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-12 00:46:43,192 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 00:46:43,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:46:43,384 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-12 00:46:43,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:46:43,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1287173139, now seen corresponding path program 1 times [2023-11-12 00:46:43,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:46:43,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460041174] [2023-11-12 00:46:43,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:46:43,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:46:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:46:43,470 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-12 00:46:43,470 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:46:43,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460041174] [2023-11-12 00:46:43,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460041174] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:46:43,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:46:43,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:46:43,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955501758] [2023-11-12 00:46:43,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:46:43,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:46:43,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:46:43,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:46:43,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:46:43,473 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-12 00:46:43,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:46:43,501 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2023-11-12 00:46:43,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:46:43,502 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-12 00:46:43,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:46:43,503 INFO L225 Difference]: With dead ends: 26 [2023-11-12 00:46:43,504 INFO L226 Difference]: Without dead ends: 25 [2023-11-12 00:46:43,504 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-12 00:46:43,506 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-12 00:46:43,507 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-12 00:46:43,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-12 00:46:43,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-12 00:46:43,521 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-12 00:46:43,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2023-11-12 00:46:43,522 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 19 [2023-11-12 00:46:43,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:46:43,523 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2023-11-12 00:46:43,523 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-12 00:46:43,523 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2023-11-12 00:46:43,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-12 00:46:43,525 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:46:43,525 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-12 00:46:43,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 00:46:43,525 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-12 00:46:43,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:46:43,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1247661560, now seen corresponding path program 1 times [2023-11-12 00:46:43,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:46:43,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599574162] [2023-11-12 00:46:43,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:46:43,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:46:43,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:46:43,694 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-12 00:46:43,694 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:46:43,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599574162] [2023-11-12 00:46:43,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599574162] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:46:43,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438672445] [2023-11-12 00:46:43,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:46:43,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:46:43,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:46:43,696 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:46:43,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 00:46:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:46:43,786 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 00:46:43,788 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:46:43,893 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-12 00:46:43,893 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:46:44,001 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-12 00:46:44,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438672445] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:46:44,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1262427207] [2023-11-12 00:46:44,028 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-11-12 00:46:44,028 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:46:44,033 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:46:44,039 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:46:44,040 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:46:46,125 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 45 for LOIs [2023-11-12 00:46:46,161 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:46:47,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1262427207] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:46:47,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:46:47,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6, 6, 6] total 25 [2023-11-12 00:46:47,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016463335] [2023-11-12 00:46:47,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:46:47,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-12 00:46:47,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:46:47,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-12 00:46:47,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2023-11-12 00:46:47,507 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-12 00:46:48,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:46:48,934 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2023-11-12 00:46:48,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-12 00:46:48,935 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-12 00:46:48,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:46:48,936 INFO L225 Difference]: With dead ends: 35 [2023-11-12 00:46:48,936 INFO L226 Difference]: Without dead ends: 33 [2023-11-12 00:46:48,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=151, Invalid=718, Unknown=1, NotChecked=0, Total=870 [2023-11-12 00:46:48,938 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 40 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 00:46:48,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 56 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 196 Invalid, 1 Unknown, 0 Unchecked, 0.5s Time] [2023-11-12 00:46:48,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-12 00:46:48,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2023-11-12 00:46:48,948 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-12 00:46:48,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-11-12 00:46:48,950 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 20 [2023-11-12 00:46:48,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:46:48,951 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-11-12 00:46:48,953 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-12 00:46:48,953 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2023-11-12 00:46:48,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-12 00:46:48,954 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:46:48,954 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-12 00:46:48,969 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-12 00:46:49,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-12 00:46:49,170 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-12 00:46:49,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:46:49,170 INFO L85 PathProgramCache]: Analyzing trace with hash -438452735, now seen corresponding path program 1 times [2023-11-12 00:46:49,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:46:49,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866497322] [2023-11-12 00:46:49,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:46:49,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:46:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:46:49,310 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-12 00:46:49,310 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:46:49,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866497322] [2023-11-12 00:46:49,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866497322] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:46:49,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877628216] [2023-11-12 00:46:49,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:46:49,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:46:49,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:46:49,313 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:46:49,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 00:46:49,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:46:49,415 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 00:46:49,418 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:46:49,484 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-12 00:46:49,484 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:46:49,541 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-12 00:46:49,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877628216] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:46:49,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [849768534] [2023-11-12 00:46:49,547 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-11-12 00:46:49,548 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:46:49,548 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:46:49,548 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:46:49,548 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:46:50,805 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 45 for LOIs [2023-11-12 00:46:50,846 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:46:52,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [849768534] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:46:52,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:46:52,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6, 6, 6] total 25 [2023-11-12 00:46:52,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829423816] [2023-11-12 00:46:52,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:46:52,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-12 00:46:52,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:46:52,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-12 00:46:52,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2023-11-12 00:46:52,283 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-12 00:46:53,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:46:53,525 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2023-11-12 00:46:53,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-12 00:46:53,527 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-12 00:46:53,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:46:53,528 INFO L225 Difference]: With dead ends: 31 [2023-11-12 00:46:53,528 INFO L226 Difference]: Without dead ends: 22 [2023-11-12 00:46:53,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=151, Invalid=718, Unknown=1, NotChecked=0, Total=870 [2023-11-12 00:46:53,530 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 18 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 00:46:53,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 40 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 169 Invalid, 1 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 00:46:53,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-12 00:46:53,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-11-12 00:46:53,538 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-12 00:46:53,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2023-11-12 00:46:53,539 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 23 [2023-11-12 00:46:53,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:46:53,539 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2023-11-12 00:46:53,539 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-12 00:46:53,540 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2023-11-12 00:46:53,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-12 00:46:53,541 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:46:53,541 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-12 00:46:53,556 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-12 00:46:53,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-12 00:46:53,748 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-12 00:46:53,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:46:53,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1217570928, now seen corresponding path program 1 times [2023-11-12 00:46:53,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:46:53,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195801344] [2023-11-12 00:46:53,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:46:53,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:46:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:46:53,852 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-12 00:46:53,852 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:46:53,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195801344] [2023-11-12 00:46:53,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195801344] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:46:53,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629316598] [2023-11-12 00:46:53,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:46:53,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:46:53,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:46:53,857 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:46:53,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-12 00:46:53,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:46:53,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-12 00:46:53,956 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:46:53,994 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-12 00:46:53,994 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:46:54,091 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-12 00:46:54,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629316598] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:46:54,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1757590713] [2023-11-12 00:46:54,095 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-11-12 00:46:54,095 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:46:54,095 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:46:54,095 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:46:54,096 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:46:55,130 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 45 for LOIs [2023-11-12 00:46:55,155 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:46:56,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1757590713] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:46:56,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:46:56,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6, 6, 6] total 25 [2023-11-12 00:46:56,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645331899] [2023-11-12 00:46:56,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:46:56,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-12 00:46:56,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:46:56,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-12 00:46:56,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2023-11-12 00:46:56,526 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-12 00:46:57,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:46:57,862 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2023-11-12 00:46:57,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-12 00:46:57,862 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-12 00:46:57,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:46:57,864 INFO L225 Difference]: With dead ends: 26 [2023-11-12 00:46:57,865 INFO L226 Difference]: Without dead ends: 25 [2023-11-12 00:46:57,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=153, Invalid=968, Unknown=1, NotChecked=0, Total=1122 [2023-11-12 00:46:57,866 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 26 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 00:46:57,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 23 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 151 Invalid, 1 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 00:46:57,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-12 00:46:57,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-12 00:46:57,876 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-12 00:46:57,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2023-11-12 00:46:57,876 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 25 [2023-11-12 00:46:57,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:46:57,877 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2023-11-12 00:46:57,877 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-12 00:46:57,877 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2023-11-12 00:46:57,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-12 00:46:57,878 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:46:57,878 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-12 00:46:57,884 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-12 00:46:58,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-12 00:46:58,084 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-12 00:46:58,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:46:58,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1656802969, now seen corresponding path program 1 times [2023-11-12 00:46:58,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:46:58,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436842826] [2023-11-12 00:46:58,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:46:58,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:46:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:46:58,245 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-12 00:46:58,246 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:46:58,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436842826] [2023-11-12 00:46:58,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436842826] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:46:58,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924657223] [2023-11-12 00:46:58,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:46:58,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:46:58,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:46:58,249 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:46:58,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-12 00:46:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:46:58,361 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-12 00:46:58,364 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:46:58,407 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-12 00:46:58,407 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:46:58,482 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-12 00:46:58,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924657223] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:46:58,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [720912987] [2023-11-12 00:46:58,486 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-11-12 00:46:58,486 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:46:58,487 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:46:58,487 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:46:58,487 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:46:59,440 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 45 for LOIs [2023-11-12 00:46:59,459 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:47:00,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [720912987] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:47:00,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:47:00,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [8, 8, 8] total 22 [2023-11-12 00:47:00,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046407728] [2023-11-12 00:47:00,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:47:00,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-12 00:47:00,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:47:00,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-12 00:47:00,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2023-11-12 00:47:00,755 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-12 00:47:01,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:47:01,964 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2023-11-12 00:47:01,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-12 00:47:01,965 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-12 00:47:01,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:47:01,965 INFO L225 Difference]: With dead ends: 25 [2023-11-12 00:47:01,965 INFO L226 Difference]: Without dead ends: 0 [2023-11-12 00:47:01,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 59 SyntacticMatches, 11 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=108, Invalid=761, Unknown=1, NotChecked=0, Total=870 [2023-11-12 00:47:01,967 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 28 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:47:01,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 14 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 146 Invalid, 1 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 00:47:01,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-12 00:47:01,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-12 00:47:01,968 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-12 00:47:01,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-12 00:47:01,969 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2023-11-12 00:47:01,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:47:01,969 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-12 00:47:01,969 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-12 00:47:01,969 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-12 00:47:01,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-12 00:47:01,972 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2023-11-12 00:47:01,972 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2023-11-12 00:47:01,972 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2023-11-12 00:47:01,973 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2023-11-12 00:47:01,973 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2023-11-12 00:47:01,973 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2023-11-12 00:47:01,984 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-12 00:47:02,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-12 00:47:02,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-12 00:47:04,067 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-12 00:47:04,067 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 525 531) no Hoare annotation was computed. [2023-11-12 00:47:04,067 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 773) no Hoare annotation was computed. [2023-11-12 00:47:04,067 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-12 00:47:04,067 INFO L899 garLoopResultBuilder]: For program point L762-1(line 762) no Hoare annotation was computed. [2023-11-12 00:47:04,067 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 767) no Hoare annotation was computed. [2023-11-12 00:47:04,067 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 773) no Hoare annotation was computed. [2023-11-12 00:47:04,068 INFO L899 garLoopResultBuilder]: For program point L767-3(line 767) no Hoare annotation was computed. [2023-11-12 00:47:04,068 INFO L899 garLoopResultBuilder]: For program point L763(lines 763 777) no Hoare annotation was computed. [2023-11-12 00:47:04,068 INFO L899 garLoopResultBuilder]: For program point L767-4(line 767) no Hoare annotation was computed. [2023-11-12 00:47:04,069 INFO L895 garLoopResultBuilder]: At program point L767-5(lines 767 771) the Hoare annotation is: (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse2 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse3 (= 10 |ULTIMATE.start_entry_point_~len~0#1|)) (.cse12 (= |~#ldv_global_msg_list~0.base| 1))) (or (let ((.cse1 (select |#memory_$Pointer$.offset| 1)) (.cse4 (select |#memory_$Pointer$.base| 1)) (.cse5 (= |ULTIMATE.start_entry_point_~array~0#1.base| 0)) (.cse8 (<= (+ |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#StackHeapBarrier|)) (.cse6 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0))) (and (= (select |#length| 1) 8) .cse0 (= (select .cse1 0) 0) .cse2 (= (select .cse1 4) 0) .cse3 (= (select .cse4 0) 1) (= (select |#valid| 1) 1) (or (exists ((|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_#valid_52| (Array Int Int)) (|v_#length_36| (Array Int Int))) (and (let ((.cse7 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse5 .cse6 (= |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|) .cse7 (= |v_#valid_52| |#valid|) (= |#length| |v_#length_36|)) (and .cse8 (= |#length| (store |v_#length_36| |ULTIMATE.start_entry_point_~array~0#1.base| 40)) (not .cse7) (= (store |v_#valid_52| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (select |v_#valid_52| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) .cse6))) (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648)))) (exists ((|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_#valid_52| (Array Int Int)) (|v_#length_36| (Array Int Int))) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse9 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (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|) .cse5 .cse6 .cse9 (= |v_#valid_52| |#valid|) (= |#length| |v_#length_36|)) (and .cse8 (= |#length| (store |v_#length_36| |ULTIMATE.start_entry_point_~array~0#1.base| 40)) (not .cse9) (= (store |v_#valid_52| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (select |v_#valid_52| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) .cse6))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648))))) (or (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_ldv_malloc_#t~malloc12.base_36| Int) (|v_ldv_malloc_#t~malloc12.offset_36| Int) (|v_#valid_70| (Array Int Int))) (and (let ((.cse10 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse8 (not .cse10) .cse6 (= |#length| (store |v_#length_49| |ULTIMATE.start_entry_point_~array~0#1.base| 40)) (= (store |v_#valid_70| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (select |v_#valid_70| |ULTIMATE.start_entry_point_~array~0#1.base|) 0)) (and (= |#length| |v_#length_49|) .cse5 (= |v_#valid_70| |#valid|) .cse6 (= |v_ldv_malloc_#t~malloc12.offset_36| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_22|) .cse10 (= |v_ldv_malloc_#t~malloc12.base_36| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_22|)))) (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648)))) (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_ldv_malloc_#t~malloc12.base_36| Int) (|v_ldv_malloc_#t~malloc12.offset_36| Int) (|v_#valid_70| (Array Int 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 .cse8 (not .cse11) .cse6 (= |#length| (store |v_#length_49| |ULTIMATE.start_entry_point_~array~0#1.base| 40)) (= (store |v_#valid_70| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (select |v_#valid_70| |ULTIMATE.start_entry_point_~array~0#1.base|) 0)) (and (= |v_ldv_malloc_#t~malloc12.offset_36| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_21|) (= |#length| |v_#length_49|) .cse5 (= |v_#valid_70| |#valid|) .cse6 .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))))) .cse12 (= (select |#valid| 0) 0) (or (exists ((|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_31| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_#valid_86| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.base_47| Int) (|v_ldv_malloc_#t~malloc12.offset_47| 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 ((.cse13 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse8 (not .cse13) .cse6 (= (store |v_#valid_86| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (select |v_#valid_86| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) (= (store |v_#length_62| |ULTIMATE.start_entry_point_~array~0#1.base| 40) |#length|)) (and (= |v_#valid_86| |#valid|) (= |v_ldv_malloc_#t~malloc12.offset_47| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_31|) .cse5 .cse6 (= |#length| |v_#length_62|) .cse13 (= |v_ldv_malloc_#t~malloc12.base_47| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_31|)))) (<= 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_#valid_86| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.base_47| Int) (|v_ldv_malloc_#t~malloc12.offset_47| Int) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_32| Int) (|v_#length_62| (Array Int Int))) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse14 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse8 (not .cse14) .cse6 (= (store |v_#valid_86| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (select |v_#valid_86| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) (= (store |v_#length_62| |ULTIMATE.start_entry_point_~array~0#1.base| 40) |#length|)) (and (= |v_#valid_86| |#valid|) .cse5 .cse6 (= |#length| |v_#length_62|) .cse14 (= |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|)))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648))))) (= |ULTIMATE.start_entry_point_~i~0#1| 0) (= (select .cse4 4) 1) (or (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_ldv_malloc_#t~malloc12.base_17| Int) (|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2| Int) (|v_#length_26| (Array Int Int)) (|v_#valid_39| (Array Int Int))) (and (let ((.cse15 (= |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|) .cse5 .cse6 (= |#length| |v_#length_26|) .cse15 (= |v_#valid_39| |#valid|)) (and .cse8 (not .cse15) (= |#length| (store |v_#length_26| |ULTIMATE.start_entry_point_~array~0#1.base| 40)) .cse6 (= (select |v_#valid_39| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) (= (store |v_#valid_39| |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.offset_BEFORE_RETURN_1| Int) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_ldv_malloc_#t~malloc12.offset_17| Int) (|v_ldv_malloc_#t~malloc12.base_17| Int) (|v_#length_26| (Array Int Int)) (|v_#valid_39| (Array Int Int))) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse16 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse5 .cse6 (= |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1| |v_ldv_malloc_#t~malloc12.base_17|) (= |#length| |v_#length_26|) .cse16 (= |v_ldv_malloc_#t~malloc12.offset_17| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1|) (= |v_#valid_39| |#valid|)) (and .cse8 (not .cse16) (= |#length| (store |v_#length_26| |ULTIMATE.start_entry_point_~array~0#1.base| 40)) .cse6 (= (select |v_#valid_39| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) (= (store |v_#valid_39| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|)))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648))))))) (and .cse0 .cse2 (<= |ULTIMATE.start_entry_point_~i~0#1| 2147483647) .cse3 .cse12 (<= 1 |ULTIMATE.start_entry_point_~i~0#1|)))) [2023-11-12 00:47:04,069 INFO L899 garLoopResultBuilder]: For program point L763-2(lines 760 779) no Hoare annotation was computed. [2023-11-12 00:47:04,069 INFO L899 garLoopResultBuilder]: For program point L772(lines 763 777) no Hoare annotation was computed. [2023-11-12 00:47:04,069 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 767) no Hoare annotation was computed. [2023-11-12 00:47:04,069 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-12 00:47:04,070 INFO L895 garLoopResultBuilder]: At program point L768(line 768) the Hoare annotation is: (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse1 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse2 (= 10 |ULTIMATE.start_entry_point_~len~0#1|)) (.cse3 (= |~#ldv_global_msg_list~0.base| 1))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 1 |ULTIMATE.start_entry_point_~i~0#1|) (<= |ULTIMATE.start_entry_point_~i~0#1| 9)) (let ((.cse4 (select |#memory_$Pointer$.offset| 1)) (.cse5 (select |#memory_$Pointer$.base| 1)) (.cse6 (= |ULTIMATE.start_entry_point_~array~0#1.base| 0)) (.cse9 (<= (+ |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#StackHeapBarrier|)) (.cse7 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0))) (and (= (select |#length| 1) 8) .cse0 (= (select .cse4 0) 0) .cse1 (= (select .cse4 4) 0) .cse2 (= (select .cse5 0) 1) (= (select |#valid| 1) 1) (or (exists ((|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_#valid_52| (Array Int Int)) (|v_#length_36| (Array Int Int))) (and (let ((.cse8 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse6 .cse7 (= |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|) .cse8 (= |v_#valid_52| |#valid|) (= |#length| |v_#length_36|)) (and .cse9 (= |#length| (store |v_#length_36| |ULTIMATE.start_entry_point_~array~0#1.base| 40)) (not .cse8) (= (store |v_#valid_52| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (select |v_#valid_52| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) .cse7))) (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648)))) (exists ((|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_#valid_52| (Array Int Int)) (|v_#length_36| (Array Int Int))) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse10 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (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|) .cse6 .cse7 .cse10 (= |v_#valid_52| |#valid|) (= |#length| |v_#length_36|)) (and .cse9 (= |#length| (store |v_#length_36| |ULTIMATE.start_entry_point_~array~0#1.base| 40)) (not .cse10) (= (store |v_#valid_52| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (select |v_#valid_52| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) .cse7))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648))))) (or (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_ldv_malloc_#t~malloc12.base_36| Int) (|v_ldv_malloc_#t~malloc12.offset_36| Int) (|v_#valid_70| (Array Int Int))) (and (let ((.cse11 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse9 (not .cse11) .cse7 (= |#length| (store |v_#length_49| |ULTIMATE.start_entry_point_~array~0#1.base| 40)) (= (store |v_#valid_70| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (select |v_#valid_70| |ULTIMATE.start_entry_point_~array~0#1.base|) 0)) (and (= |#length| |v_#length_49|) .cse6 (= |v_#valid_70| |#valid|) .cse7 (= |v_ldv_malloc_#t~malloc12.offset_36| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_22|) .cse11 (= |v_ldv_malloc_#t~malloc12.base_36| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_22|)))) (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648)))) (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_ldv_malloc_#t~malloc12.base_36| Int) (|v_ldv_malloc_#t~malloc12.offset_36| Int) (|v_#valid_70| (Array Int 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 .cse9 (not .cse12) .cse7 (= |#length| (store |v_#length_49| |ULTIMATE.start_entry_point_~array~0#1.base| 40)) (= (store |v_#valid_70| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (select |v_#valid_70| |ULTIMATE.start_entry_point_~array~0#1.base|) 0)) (and (= |v_ldv_malloc_#t~malloc12.offset_36| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_21|) (= |#length| |v_#length_49|) .cse6 (= |v_#valid_70| |#valid|) .cse7 .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))))) .cse3 (= (select |#valid| 0) 0) (or (exists ((|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_31| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_#valid_86| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.base_47| Int) (|v_ldv_malloc_#t~malloc12.offset_47| 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 ((.cse13 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse9 (not .cse13) .cse7 (= (store |v_#valid_86| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (select |v_#valid_86| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) (= (store |v_#length_62| |ULTIMATE.start_entry_point_~array~0#1.base| 40) |#length|)) (and (= |v_#valid_86| |#valid|) (= |v_ldv_malloc_#t~malloc12.offset_47| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_31|) .cse6 .cse7 (= |#length| |v_#length_62|) .cse13 (= |v_ldv_malloc_#t~malloc12.base_47| |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_31|)))) (<= 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_#valid_86| (Array Int Int)) (|v_ldv_malloc_#t~malloc12.base_47| Int) (|v_ldv_malloc_#t~malloc12.offset_47| Int) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_32| Int) (|v_#length_62| (Array Int Int))) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse14 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse9 (not .cse14) .cse7 (= (store |v_#valid_86| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|) (= (select |v_#valid_86| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) (= (store |v_#length_62| |ULTIMATE.start_entry_point_~array~0#1.base| 40) |#length|)) (and (= |v_#valid_86| |#valid|) .cse6 .cse7 (= |#length| |v_#length_62|) .cse14 (= |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|)))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648))))) (= |ULTIMATE.start_entry_point_~i~0#1| 0) (= (select .cse5 4) 1) (or (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_ldv_malloc_#t~malloc12.base_17| Int) (|v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2| Int) (|v_#length_26| (Array Int Int)) (|v_#valid_39| (Array Int Int))) (and (let ((.cse15 (= |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|) .cse6 .cse7 (= |#length| |v_#length_26|) .cse15 (= |v_#valid_39| |#valid|)) (and .cse9 (not .cse15) (= |#length| (store |v_#length_26| |ULTIMATE.start_entry_point_~array~0#1.base| 40)) .cse7 (= (select |v_#valid_39| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) (= (store |v_#valid_39| |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.offset_BEFORE_RETURN_1| Int) (|v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1| Int) (|v_ldv_malloc_#t~nondet11_11| Int) (|v_ldv_malloc_#t~malloc12.offset_17| Int) (|v_ldv_malloc_#t~malloc12.base_17| Int) (|v_#length_26| (Array Int Int)) (|v_#valid_39| (Array Int Int))) (and (<= |v_ldv_malloc_#t~nondet11_11| 2147483647) (let ((.cse16 (= |v_ldv_malloc_#t~nondet11_11| 0))) (or (and .cse6 .cse7 (= |v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1| |v_ldv_malloc_#t~malloc12.base_17|) (= |#length| |v_#length_26|) .cse16 (= |v_ldv_malloc_#t~malloc12.offset_17| |v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1|) (= |v_#valid_39| |#valid|)) (and .cse9 (not .cse16) (= |#length| (store |v_#length_26| |ULTIMATE.start_entry_point_~array~0#1.base| 40)) .cse7 (= (select |v_#valid_39| |ULTIMATE.start_entry_point_~array~0#1.base|) 0) (= (store |v_#valid_39| |ULTIMATE.start_entry_point_~array~0#1.base| 1) |#valid|)))) (<= 0 (+ |v_ldv_malloc_#t~nondet11_11| 2147483648))))))))) [2023-11-12 00:47:04,071 INFO L899 garLoopResultBuilder]: For program point L768-1(line 768) no Hoare annotation was computed. [2023-11-12 00:47:04,071 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 773) no Hoare annotation was computed. [2023-11-12 00:47:04,071 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-12 00:47:04,071 INFO L899 garLoopResultBuilder]: For program point L773(line 773) no Hoare annotation was computed. [2023-11-12 00:47:04,071 INFO L899 garLoopResultBuilder]: For program point L769(line 769) no Hoare annotation was computed. [2023-11-12 00:47:04,072 INFO L899 garLoopResultBuilder]: For program point L773-4(line 773) no Hoare annotation was computed. [2023-11-12 00:47:04,072 INFO L899 garLoopResultBuilder]: For program point L773-5(line 773) no Hoare annotation was computed. [2023-11-12 00:47:04,072 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-12 00:47:04,072 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 773) no Hoare annotation was computed. [2023-11-12 00:47:04,076 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:47:04,078 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 00:47:04,112 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated [2023-11-12 00:47:04,115 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[1][0] could not be translated [2023-11-12 00:47:04,115 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[1][4] could not be translated [2023-11-12 00:47:04,116 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[1][0] could not be translated [2023-11-12 00:47:04,117 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated [2023-11-12 00:47:04,117 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists 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_#valid_52 : [int]int, v_#length_36 : [int]int :: ((((((((~array~0!base == 0 && ~array~0!offset == 0) && 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) && v_#valid_52 == #valid) && #length == v_#length_36) || (((((~array~0!base + 1 <= #StackHeapBarrier && #length == v_#length_36[~array~0!base := 40]) && !(v_ldv_malloc_#t~nondet11_11 == 0)) && v_#valid_52[~array~0!base := 1] == #valid) && v_#valid_52[~array~0!base] == 0) && ~array~0!offset == 0)) && v_ldv_malloc_#t~nondet11_11 <= 2147483647) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-12 00:47:04,117 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists 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_#valid_52 : [int]int, v_#length_36 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && (((((((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_ldv_malloc_#t~nondet11_11 == 0) && v_#valid_52 == #valid) && #length == v_#length_36) || (((((~array~0!base + 1 <= #StackHeapBarrier && #length == v_#length_36[~array~0!base := 40]) && !(v_ldv_malloc_#t~nondet11_11 == 0)) && v_#valid_52[~array~0!base := 1] == #valid) && v_#valid_52[~array~0!base] == 0) && ~array~0!offset == 0))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-12 00:47:04,118 WARN L1567 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_ldv_malloc_#t~malloc12.base_36 : int, v_ldv_malloc_#t~malloc12.offset_36 : int, v_#valid_70 : [int]int :: (((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && #length == v_#length_49[~array~0!base := 40]) && v_#valid_70[~array~0!base := 1] == #valid) && v_#valid_70[~array~0!base] == 0) || ((((((#length == v_#length_49 && ~array~0!base == 0) && v_#valid_70 == #valid) && ~array~0!offset == 0) && v_ldv_malloc_#t~malloc12.offset_36 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_22) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.base_36 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_22)) && v_ldv_malloc_#t~nondet11_11 <= 2147483647) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-12 00:47:04,126 WARN L1567 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_ldv_malloc_#t~malloc12.base_36 : int, v_ldv_malloc_#t~malloc12.offset_36 : int, v_#valid_70 : [int]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)) && ~array~0!offset == 0) && #length == v_#length_49[~array~0!base := 40]) && v_#valid_70[~array~0!base := 1] == #valid) && v_#valid_70[~array~0!base] == 0) || ((((((v_ldv_malloc_#t~malloc12.offset_36 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_21 && #length == v_#length_49) && ~array~0!base == 0) && v_#valid_70 == #valid) && ~array~0!offset == 0) && 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-12 00:47:04,127 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[0] could not be translated [2023-11-12 00:47:04,127 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_31 : int, v_ldv_malloc_#t~nondet11_11 : int, v_#valid_86 : [int]int, v_ldv_malloc_#t~malloc12.base_47 : int, v_ldv_malloc_#t~malloc12.offset_47 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_31 : int, v_#length_62 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && ((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_86[~array~0!base := 1] == #valid) && v_#valid_86[~array~0!base] == 0) && v_#length_62[~array~0!base := 40] == #length) || ((((((v_#valid_86 == #valid && 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_ldv_malloc_#t~malloc12.base_47 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_31))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-12 00:47:04,127 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_32 : int, v_ldv_malloc_#t~nondet11_11 : int, v_#valid_86 : [int]int, v_ldv_malloc_#t~malloc12.base_47 : int, v_ldv_malloc_#t~malloc12.offset_47 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_32 : int, v_#length_62 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && ((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_86[~array~0!base := 1] == #valid) && v_#valid_86[~array~0!base] == 0) && v_#length_62[~array~0!base := 40] == #length) || ((((((v_#valid_86 == #valid && ~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))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-12 00:47:04,127 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[1][4] could not be translated [2023-11-12 00:47:04,127 WARN L1567 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_ldv_malloc_#t~malloc12.base_17 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2 : int, v_#length_26 : [int]int, v_#valid_39 : [int]int :: ((((((((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_39 == #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_39[~array~0!base] == 0) && v_#valid_39[~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-12 00:47:04,128 WARN L1567 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_ldv_malloc_#t~malloc12.offset_17 : int, v_ldv_malloc_#t~malloc12.base_17 : int, v_#length_26 : [int]int, v_#valid_39 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && (((((((~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_ldv_malloc_#t~malloc12.offset_17 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1) && v_#valid_39 == #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_39[~array~0!base] == 0) && v_#valid_39[~array~0!base := 1] == #valid))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-12 00:47:04,133 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated [2023-11-12 00:47:04,137 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[1][0] could not be translated [2023-11-12 00:47:04,138 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[1][4] could not be translated [2023-11-12 00:47:04,138 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[1][0] could not be translated [2023-11-12 00:47:04,138 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated [2023-11-12 00:47:04,138 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists 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_#valid_52 : [int]int, v_#length_36 : [int]int :: ((((((((~array~0!base == 0 && ~array~0!offset == 0) && 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) && v_#valid_52 == #valid) && #length == v_#length_36) || (((((~array~0!base + 1 <= #StackHeapBarrier && #length == v_#length_36[~array~0!base := 40]) && !(v_ldv_malloc_#t~nondet11_11 == 0)) && v_#valid_52[~array~0!base := 1] == #valid) && v_#valid_52[~array~0!base] == 0) && ~array~0!offset == 0)) && v_ldv_malloc_#t~nondet11_11 <= 2147483647) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-12 00:47:04,138 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists 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_#valid_52 : [int]int, v_#length_36 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && (((((((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_ldv_malloc_#t~nondet11_11 == 0) && v_#valid_52 == #valid) && #length == v_#length_36) || (((((~array~0!base + 1 <= #StackHeapBarrier && #length == v_#length_36[~array~0!base := 40]) && !(v_ldv_malloc_#t~nondet11_11 == 0)) && v_#valid_52[~array~0!base := 1] == #valid) && v_#valid_52[~array~0!base] == 0) && ~array~0!offset == 0))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-12 00:47:04,139 WARN L1567 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_ldv_malloc_#t~malloc12.base_36 : int, v_ldv_malloc_#t~malloc12.offset_36 : int, v_#valid_70 : [int]int :: (((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && #length == v_#length_49[~array~0!base := 40]) && v_#valid_70[~array~0!base := 1] == #valid) && v_#valid_70[~array~0!base] == 0) || ((((((#length == v_#length_49 && ~array~0!base == 0) && v_#valid_70 == #valid) && ~array~0!offset == 0) && v_ldv_malloc_#t~malloc12.offset_36 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_22) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.base_36 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_22)) && v_ldv_malloc_#t~nondet11_11 <= 2147483647) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-12 00:47:04,139 WARN L1567 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_ldv_malloc_#t~malloc12.base_36 : int, v_ldv_malloc_#t~malloc12.offset_36 : int, v_#valid_70 : [int]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)) && ~array~0!offset == 0) && #length == v_#length_49[~array~0!base := 40]) && v_#valid_70[~array~0!base := 1] == #valid) && v_#valid_70[~array~0!base] == 0) || ((((((v_ldv_malloc_#t~malloc12.offset_36 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_21 && #length == v_#length_49) && ~array~0!base == 0) && v_#valid_70 == #valid) && ~array~0!offset == 0) && 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-12 00:47:04,139 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[0] could not be translated [2023-11-12 00:47:04,139 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_31 : int, v_ldv_malloc_#t~nondet11_11 : int, v_#valid_86 : [int]int, v_ldv_malloc_#t~malloc12.base_47 : int, v_ldv_malloc_#t~malloc12.offset_47 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_31 : int, v_#length_62 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && ((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_86[~array~0!base := 1] == #valid) && v_#valid_86[~array~0!base] == 0) && v_#length_62[~array~0!base := 40] == #length) || ((((((v_#valid_86 == #valid && 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_ldv_malloc_#t~malloc12.base_47 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_31))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-12 00:47:04,140 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_32 : int, v_ldv_malloc_#t~nondet11_11 : int, v_#valid_86 : [int]int, v_ldv_malloc_#t~malloc12.base_47 : int, v_ldv_malloc_#t~malloc12.offset_47 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_32 : int, v_#length_62 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && ((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_86[~array~0!base := 1] == #valid) && v_#valid_86[~array~0!base] == 0) && v_#length_62[~array~0!base := 40] == #length) || ((((((v_#valid_86 == #valid && ~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))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-12 00:47:04,140 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[1][4] could not be translated [2023-11-12 00:47:04,140 WARN L1567 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_ldv_malloc_#t~malloc12.base_17 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2 : int, v_#length_26 : [int]int, v_#valid_39 : [int]int :: ((((((((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_39 == #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_39[~array~0!base] == 0) && v_#valid_39[~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-12 00:47:04,140 WARN L1567 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_ldv_malloc_#t~malloc12.offset_17 : int, v_ldv_malloc_#t~malloc12.base_17 : int, v_#length_26 : [int]int, v_#valid_39 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && (((((((~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_ldv_malloc_#t~malloc12.offset_17 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1) && v_#valid_39 == #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_39[~array~0!base] == 0) && v_#valid_39[~array~0!base := 1] == #valid))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-12 00:47:04,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:47:04 BoogieIcfgContainer [2023-11-12 00:47:04,149 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 00:47:04,150 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 00:47:04,150 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 00:47:04,151 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 00:47:04,151 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:46:40" (3/4) ... [2023-11-12 00:47:04,153 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-12 00:47:04,157 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2023-11-12 00:47:04,163 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-11-12 00:47:04,164 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-12 00:47:04,164 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-11-12 00:47:04,281 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/witness.graphml [2023-11-12 00:47:04,282 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/witness.yml [2023-11-12 00:47:04,282 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 00:47:04,283 INFO L158 Benchmark]: Toolchain (without parser) took 24624.28ms. Allocated memory was 155.2MB in the beginning and 312.5MB in the end (delta: 157.3MB). Free memory was 108.7MB in the beginning and 197.6MB in the end (delta: -88.9MB). Peak memory consumption was 70.8MB. Max. memory is 16.1GB. [2023-11-12 00:47:04,284 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 155.2MB. Free memory is still 103.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 00:47:04,284 INFO L158 Benchmark]: CACSL2BoogieTranslator took 710.34ms. Allocated memory is still 155.2MB. Free memory was 108.3MB in the beginning and 86.2MB in the end (delta: 22.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-12 00:47:04,285 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.15ms. Allocated memory is still 155.2MB. Free memory was 86.2MB in the beginning and 84.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 00:47:04,285 INFO L158 Benchmark]: Boogie Preprocessor took 31.03ms. Allocated memory is still 155.2MB. Free memory was 84.1MB in the beginning and 82.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 00:47:04,287 INFO L158 Benchmark]: RCFGBuilder took 468.72ms. Allocated memory was 155.2MB in the beginning and 216.0MB in the end (delta: 60.8MB). Free memory was 82.8MB in the beginning and 182.5MB in the end (delta: -99.7MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2023-11-12 00:47:04,287 INFO L158 Benchmark]: TraceAbstraction took 23201.21ms. Allocated memory was 216.0MB in the beginning and 312.5MB in the end (delta: 96.5MB). Free memory was 184.9MB in the beginning and 201.8MB in the end (delta: -16.9MB). Peak memory consumption was 186.6MB. Max. memory is 16.1GB. [2023-11-12 00:47:04,288 INFO L158 Benchmark]: Witness Printer took 132.13ms. Allocated memory is still 312.5MB. Free memory was 201.8MB in the beginning and 197.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-12 00:47:04,290 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.33ms. Allocated memory is still 155.2MB. Free memory is still 103.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 710.34ms. Allocated memory is still 155.2MB. Free memory was 108.3MB in the beginning and 86.2MB in the end (delta: 22.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.15ms. Allocated memory is still 155.2MB. Free memory was 86.2MB in the beginning and 84.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.03ms. Allocated memory is still 155.2MB. Free memory was 84.1MB in the beginning and 82.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 468.72ms. Allocated memory was 155.2MB in the beginning and 216.0MB in the end (delta: 60.8MB). Free memory was 82.8MB in the beginning and 182.5MB in the end (delta: -99.7MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. * TraceAbstraction took 23201.21ms. Allocated memory was 216.0MB in the beginning and 312.5MB in the end (delta: 96.5MB). Free memory was 184.9MB in the beginning and 201.8MB in the end (delta: -16.9MB). Peak memory consumption was 186.6MB. Max. memory is 16.1GB. * Witness Printer took 132.13ms. Allocated memory is still 312.5MB. Free memory was 201.8MB in the beginning and 197.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[1][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[1][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[1][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~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_#valid_52 : [int]int, v_#length_36 : [int]int :: ((((((((~array~0!base == 0 && ~array~0!offset == 0) && 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) && v_#valid_52 == #valid) && #length == v_#length_36) || (((((~array~0!base + 1 <= #StackHeapBarrier && #length == v_#length_36[~array~0!base := 40]) && !(v_ldv_malloc_#t~nondet11_11 == 0)) && v_#valid_52[~array~0!base := 1] == #valid) && v_#valid_52[~array~0!base] == 0) && ~array~0!offset == 0)) && 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.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_#valid_52 : [int]int, v_#length_36 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && (((((((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_ldv_malloc_#t~nondet11_11 == 0) && v_#valid_52 == #valid) && #length == v_#length_36) || (((((~array~0!base + 1 <= #StackHeapBarrier && #length == v_#length_36[~array~0!base := 40]) && !(v_ldv_malloc_#t~nondet11_11 == 0)) && v_#valid_52[~array~0!base := 1] == #valid) && v_#valid_52[~array~0!base] == 0) && ~array~0!offset == 0))) && 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_ldv_malloc_#t~malloc12.base_36 : int, v_ldv_malloc_#t~malloc12.offset_36 : int, v_#valid_70 : [int]int :: (((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && #length == v_#length_49[~array~0!base := 40]) && v_#valid_70[~array~0!base := 1] == #valid) && v_#valid_70[~array~0!base] == 0) || ((((((#length == v_#length_49 && ~array~0!base == 0) && v_#valid_70 == #valid) && ~array~0!offset == 0) && v_ldv_malloc_#t~malloc12.offset_36 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_22) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.base_36 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_22)) && 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.offset_BEFORE_RETURN_21 : int, v_#length_49 : [int]int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_36 : int, v_ldv_malloc_#t~malloc12.offset_36 : int, v_#valid_70 : [int]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)) && ~array~0!offset == 0) && #length == v_#length_49[~array~0!base := 40]) && v_#valid_70[~array~0!base := 1] == #valid) && v_#valid_70[~array~0!base] == 0) || ((((((v_ldv_malloc_#t~malloc12.offset_36 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_21 && #length == v_#length_49) && ~array~0!base == 0) && v_#valid_70 == #valid) && ~array~0!offset == 0) && 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: ArrayAccessExpression #valid[0] 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_#valid_86 : [int]int, v_ldv_malloc_#t~malloc12.base_47 : int, v_ldv_malloc_#t~malloc12.offset_47 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_31 : int, v_#length_62 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && ((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_86[~array~0!base := 1] == #valid) && v_#valid_86[~array~0!base] == 0) && v_#length_62[~array~0!base := 40] == #length) || ((((((v_#valid_86 == #valid && 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_ldv_malloc_#t~malloc12.base_47 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_31))) && 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_#valid_86 : [int]int, v_ldv_malloc_#t~malloc12.base_47 : int, v_ldv_malloc_#t~malloc12.offset_47 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_32 : int, v_#length_62 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && ((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_86[~array~0!base := 1] == #valid) && v_#valid_86[~array~0!base] == 0) && v_#length_62[~array~0!base := 40] == #length) || ((((((v_#valid_86 == #valid && ~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))) && 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 - 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_ldv_malloc_#t~malloc12.base_17 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2 : int, v_#length_26 : [int]int, v_#valid_39 : [int]int :: ((((((((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_39 == #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_39[~array~0!base] == 0) && v_#valid_39[~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.offset_BEFORE_RETURN_1 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.offset_17 : int, v_ldv_malloc_#t~malloc12.base_17 : int, v_#length_26 : [int]int, v_#valid_39 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && (((((((~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_ldv_malloc_#t~malloc12.offset_17 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1) && v_#valid_39 == #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_39[~array~0!base] == 0) && v_#valid_39[~array~0!base := 1] == #valid))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[1][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[1][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[1][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~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_#valid_52 : [int]int, v_#length_36 : [int]int :: ((((((((~array~0!base == 0 && ~array~0!offset == 0) && 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) && v_#valid_52 == #valid) && #length == v_#length_36) || (((((~array~0!base + 1 <= #StackHeapBarrier && #length == v_#length_36[~array~0!base := 40]) && !(v_ldv_malloc_#t~nondet11_11 == 0)) && v_#valid_52[~array~0!base := 1] == #valid) && v_#valid_52[~array~0!base] == 0) && ~array~0!offset == 0)) && 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.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_#valid_52 : [int]int, v_#length_36 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && (((((((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_ldv_malloc_#t~nondet11_11 == 0) && v_#valid_52 == #valid) && #length == v_#length_36) || (((((~array~0!base + 1 <= #StackHeapBarrier && #length == v_#length_36[~array~0!base := 40]) && !(v_ldv_malloc_#t~nondet11_11 == 0)) && v_#valid_52[~array~0!base := 1] == #valid) && v_#valid_52[~array~0!base] == 0) && ~array~0!offset == 0))) && 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_ldv_malloc_#t~malloc12.base_36 : int, v_ldv_malloc_#t~malloc12.offset_36 : int, v_#valid_70 : [int]int :: (((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && #length == v_#length_49[~array~0!base := 40]) && v_#valid_70[~array~0!base := 1] == #valid) && v_#valid_70[~array~0!base] == 0) || ((((((#length == v_#length_49 && ~array~0!base == 0) && v_#valid_70 == #valid) && ~array~0!offset == 0) && v_ldv_malloc_#t~malloc12.offset_36 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_22) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.base_36 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_22)) && 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.offset_BEFORE_RETURN_21 : int, v_#length_49 : [int]int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.base_36 : int, v_ldv_malloc_#t~malloc12.offset_36 : int, v_#valid_70 : [int]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)) && ~array~0!offset == 0) && #length == v_#length_49[~array~0!base := 40]) && v_#valid_70[~array~0!base := 1] == #valid) && v_#valid_70[~array~0!base] == 0) || ((((((v_ldv_malloc_#t~malloc12.offset_36 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_21 && #length == v_#length_49) && ~array~0!base == 0) && v_#valid_70 == #valid) && ~array~0!offset == 0) && 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: ArrayAccessExpression #valid[0] 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_#valid_86 : [int]int, v_ldv_malloc_#t~malloc12.base_47 : int, v_ldv_malloc_#t~malloc12.offset_47 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_31 : int, v_#length_62 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && ((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_86[~array~0!base := 1] == #valid) && v_#valid_86[~array~0!base] == 0) && v_#length_62[~array~0!base := 40] == #length) || ((((((v_#valid_86 == #valid && 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_ldv_malloc_#t~malloc12.base_47 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_31))) && 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_#valid_86 : [int]int, v_ldv_malloc_#t~malloc12.base_47 : int, v_ldv_malloc_#t~malloc12.offset_47 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_32 : int, v_#length_62 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && ((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_86[~array~0!base := 1] == #valid) && v_#valid_86[~array~0!base] == 0) && v_#length_62[~array~0!base := 40] == #length) || ((((((v_#valid_86 == #valid && ~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))) && 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 - 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_ldv_malloc_#t~malloc12.base_17 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2 : int, v_#length_26 : [int]int, v_#valid_39 : [int]int :: ((((((((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_39 == #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_39[~array~0!base] == 0) && v_#valid_39[~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.offset_BEFORE_RETURN_1 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_1 : int, v_ldv_malloc_#t~nondet11_11 : int, v_ldv_malloc_#t~malloc12.offset_17 : int, v_ldv_malloc_#t~malloc12.base_17 : int, v_#length_26 : [int]int, v_#valid_39 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && (((((((~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_ldv_malloc_#t~malloc12.offset_17 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1) && v_#valid_39 == #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_39[~array~0!base] == 0) && v_#valid_39[~array~0!base := 1] == #valid))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) 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: 23.1s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 225 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 217 mSDsluCounter, 350 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 226 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 814 IncrementalHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 124 mSDtfsCounter, 814 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 388 GetRequests, 230 SyntacticMatches, 22 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 9.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=2, InterpolantAutomatonStates: 84, 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, 653 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 5 FomulaSimplificationsInter, 474 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 314 NumberOfCodeBlocks, 314 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 390 ConstructedInterpolants, 0 QuantifiedInterpolants, 930 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: 5.5s, 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.6s, TOOLS_POST_CALL_APPLICATIONS: 48, TOOLS_POST_CALL_TIME: 1.1s, TOOLS_POST_RETURN_APPLICATIONS: 40, TOOLS_POST_RETURN_TIME: 1.8s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 231, TOOLS_QUANTIFIERELIM_TIME: 4.4s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 319, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 42, DOMAIN_JOIN_TIME: 0.6s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 11, DOMAIN_WIDEN_TIME: 0.0s, 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.5s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 1.5s, 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 [2023-11-12 00:47:04,324 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated [2023-11-12 00:47:04,333 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[1][0] could not be translated [2023-11-12 00:47:04,334 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[1][4] could not be translated [2023-11-12 00:47:04,334 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[1][0] could not be translated [2023-11-12 00:47:04,334 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated [2023-11-12 00:47:04,334 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists 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_#valid_52 : [int]int, v_#length_36 : [int]int :: ((((((((~array~0!base == 0 && ~array~0!offset == 0) && 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) && v_#valid_52 == #valid) && #length == v_#length_36) || (((((~array~0!base + 1 <= #StackHeapBarrier && #length == v_#length_36[~array~0!base := 40]) && !(v_ldv_malloc_#t~nondet11_11 == 0)) && v_#valid_52[~array~0!base := 1] == #valid) && v_#valid_52[~array~0!base] == 0) && ~array~0!offset == 0)) && v_ldv_malloc_#t~nondet11_11 <= 2147483647) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-12 00:47:04,335 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists 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_#valid_52 : [int]int, v_#length_36 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && (((((((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_ldv_malloc_#t~nondet11_11 == 0) && v_#valid_52 == #valid) && #length == v_#length_36) || (((((~array~0!base + 1 <= #StackHeapBarrier && #length == v_#length_36[~array~0!base := 40]) && !(v_ldv_malloc_#t~nondet11_11 == 0)) && v_#valid_52[~array~0!base := 1] == #valid) && v_#valid_52[~array~0!base] == 0) && ~array~0!offset == 0))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-12 00:47:04,335 WARN L1567 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_ldv_malloc_#t~malloc12.base_36 : int, v_ldv_malloc_#t~malloc12.offset_36 : int, v_#valid_70 : [int]int :: (((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && #length == v_#length_49[~array~0!base := 40]) && v_#valid_70[~array~0!base := 1] == #valid) && v_#valid_70[~array~0!base] == 0) || ((((((#length == v_#length_49 && ~array~0!base == 0) && v_#valid_70 == #valid) && ~array~0!offset == 0) && v_ldv_malloc_#t~malloc12.offset_36 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_22) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.base_36 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_22)) && v_ldv_malloc_#t~nondet11_11 <= 2147483647) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-12 00:47:04,335 WARN L1567 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_ldv_malloc_#t~malloc12.base_36 : int, v_ldv_malloc_#t~malloc12.offset_36 : int, v_#valid_70 : [int]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)) && ~array~0!offset == 0) && #length == v_#length_49[~array~0!base := 40]) && v_#valid_70[~array~0!base := 1] == #valid) && v_#valid_70[~array~0!base] == 0) || ((((((v_ldv_malloc_#t~malloc12.offset_36 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_21 && #length == v_#length_49) && ~array~0!base == 0) && v_#valid_70 == #valid) && ~array~0!offset == 0) && 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-12 00:47:04,335 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[0] could not be translated [2023-11-12 00:47:04,336 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_31 : int, v_ldv_malloc_#t~nondet11_11 : int, v_#valid_86 : [int]int, v_ldv_malloc_#t~malloc12.base_47 : int, v_ldv_malloc_#t~malloc12.offset_47 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_31 : int, v_#length_62 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && ((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_86[~array~0!base := 1] == #valid) && v_#valid_86[~array~0!base] == 0) && v_#length_62[~array~0!base := 40] == #length) || ((((((v_#valid_86 == #valid && 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_ldv_malloc_#t~malloc12.base_47 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_31))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-12 00:47:04,336 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_32 : int, v_ldv_malloc_#t~nondet11_11 : int, v_#valid_86 : [int]int, v_ldv_malloc_#t~malloc12.base_47 : int, v_ldv_malloc_#t~malloc12.offset_47 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_32 : int, v_#length_62 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && ((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_86[~array~0!base := 1] == #valid) && v_#valid_86[~array~0!base] == 0) && v_#length_62[~array~0!base := 40] == #length) || ((((((v_#valid_86 == #valid && ~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))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-12 00:47:04,336 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[1][4] could not be translated [2023-11-12 00:47:04,336 WARN L1567 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_ldv_malloc_#t~malloc12.base_17 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2 : int, v_#length_26 : [int]int, v_#valid_39 : [int]int :: ((((((((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_39 == #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_39[~array~0!base] == 0) && v_#valid_39[~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-12 00:47:04,336 WARN L1567 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_ldv_malloc_#t~malloc12.offset_17 : int, v_ldv_malloc_#t~malloc12.base_17 : int, v_#length_26 : [int]int, v_#valid_39 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && (((((((~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_ldv_malloc_#t~malloc12.offset_17 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1) && v_#valid_39 == #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_39[~array~0!base] == 0) && v_#valid_39[~array~0!base := 1] == #valid))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-12 00:47:04,339 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated [2023-11-12 00:47:04,342 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[1][0] could not be translated [2023-11-12 00:47:04,343 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[1][4] could not be translated [2023-11-12 00:47:04,343 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[1][0] could not be translated [2023-11-12 00:47:04,343 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated [2023-11-12 00:47:04,343 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists 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_#valid_52 : [int]int, v_#length_36 : [int]int :: ((((((((~array~0!base == 0 && ~array~0!offset == 0) && 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) && v_#valid_52 == #valid) && #length == v_#length_36) || (((((~array~0!base + 1 <= #StackHeapBarrier && #length == v_#length_36[~array~0!base := 40]) && !(v_ldv_malloc_#t~nondet11_11 == 0)) && v_#valid_52[~array~0!base := 1] == #valid) && v_#valid_52[~array~0!base] == 0) && ~array~0!offset == 0)) && v_ldv_malloc_#t~nondet11_11 <= 2147483647) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-12 00:47:04,344 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists 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_#valid_52 : [int]int, v_#length_36 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && (((((((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_ldv_malloc_#t~nondet11_11 == 0) && v_#valid_52 == #valid) && #length == v_#length_36) || (((((~array~0!base + 1 <= #StackHeapBarrier && #length == v_#length_36[~array~0!base := 40]) && !(v_ldv_malloc_#t~nondet11_11 == 0)) && v_#valid_52[~array~0!base := 1] == #valid) && v_#valid_52[~array~0!base] == 0) && ~array~0!offset == 0))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-12 00:47:04,344 WARN L1567 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_ldv_malloc_#t~malloc12.base_36 : int, v_ldv_malloc_#t~malloc12.offset_36 : int, v_#valid_70 : [int]int :: (((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && #length == v_#length_49[~array~0!base := 40]) && v_#valid_70[~array~0!base := 1] == #valid) && v_#valid_70[~array~0!base] == 0) || ((((((#length == v_#length_49 && ~array~0!base == 0) && v_#valid_70 == #valid) && ~array~0!offset == 0) && v_ldv_malloc_#t~malloc12.offset_36 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_22) && v_ldv_malloc_#t~nondet11_11 == 0) && v_ldv_malloc_#t~malloc12.base_36 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_22)) && v_ldv_malloc_#t~nondet11_11 <= 2147483647) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-12 00:47:04,344 WARN L1567 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_ldv_malloc_#t~malloc12.base_36 : int, v_ldv_malloc_#t~malloc12.offset_36 : int, v_#valid_70 : [int]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)) && ~array~0!offset == 0) && #length == v_#length_49[~array~0!base := 40]) && v_#valid_70[~array~0!base := 1] == #valid) && v_#valid_70[~array~0!base] == 0) || ((((((v_ldv_malloc_#t~malloc12.offset_36 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_21 && #length == v_#length_49) && ~array~0!base == 0) && v_#valid_70 == #valid) && ~array~0!offset == 0) && 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-12 00:47:04,344 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[0] could not be translated [2023-11-12 00:47:04,344 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_31 : int, v_ldv_malloc_#t~nondet11_11 : int, v_#valid_86 : [int]int, v_ldv_malloc_#t~malloc12.base_47 : int, v_ldv_malloc_#t~malloc12.offset_47 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_31 : int, v_#length_62 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && ((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_86[~array~0!base := 1] == #valid) && v_#valid_86[~array~0!base] == 0) && v_#length_62[~array~0!base := 40] == #length) || ((((((v_#valid_86 == #valid && 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_ldv_malloc_#t~malloc12.base_47 == v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_31))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-12 00:47:04,345 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_32 : int, v_ldv_malloc_#t~nondet11_11 : int, v_#valid_86 : [int]int, v_ldv_malloc_#t~malloc12.base_47 : int, v_ldv_malloc_#t~malloc12.offset_47 : int, v_ldv_malloc_#t~malloc12.base_BEFORE_RETURN_32 : int, v_#length_62 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && ((((((~array~0!base + 1 <= #StackHeapBarrier && !(v_ldv_malloc_#t~nondet11_11 == 0)) && ~array~0!offset == 0) && v_#valid_86[~array~0!base := 1] == #valid) && v_#valid_86[~array~0!base] == 0) && v_#length_62[~array~0!base := 40] == #length) || ((((((v_#valid_86 == #valid && ~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))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated [2023-11-12 00:47:04,347 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[1][4] could not be translated [2023-11-12 00:47:04,347 WARN L1567 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_ldv_malloc_#t~malloc12.base_17 : int, v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_2 : int, v_#length_26 : [int]int, v_#valid_39 : [int]int :: ((((((((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_39 == #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_39[~array~0!base] == 0) && v_#valid_39[~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-12 00:47:04,348 WARN L1567 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_ldv_malloc_#t~malloc12.offset_17 : int, v_ldv_malloc_#t~malloc12.base_17 : int, v_#length_26 : [int]int, v_#valid_39 : [int]int :: (v_ldv_malloc_#t~nondet11_11 <= 2147483647 && (((((((~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_ldv_malloc_#t~malloc12.offset_17 == v_ldv_malloc_#t~malloc12.offset_BEFORE_RETURN_1) && v_#valid_39 == #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_39[~array~0!base] == 0) && v_#valid_39[~array~0!base := 1] == #valid))) && 0 <= v_ldv_malloc_#t~nondet11_11 + 2147483648) could not be translated 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-12 00:47:04,380 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d899d8-6225-412e-9f69-78de4ad41f7b/bin/utaipan-verify-NcY6lQBIFX/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