./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199c676a-8ca3-489c-bc3c-6876da4f00fa/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199c676a-8ca3-489c-bc3c-6876da4f00fa/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199c676a-8ca3-489c-bc3c-6876da4f00fa/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199c676a-8ca3-489c-bc3c-6876da4f00fa/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199c676a-8ca3-489c-bc3c-6876da4f00fa/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199c676a-8ca3-489c-bc3c-6876da4f00fa/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dbea62dc4a872959247118f049e63d406eb1e848bb1ed8397f1082fdec77074c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 04:47:43,303 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 04:47:43,356 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199c676a-8ca3-489c-bc3c-6876da4f00fa/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2024-11-14 04:47:43,361 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 04:47:43,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 04:47:43,383 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 04:47:43,384 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 04:47:43,384 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 04:47:43,384 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 04:47:43,384 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 04:47:43,384 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 04:47:43,385 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 04:47:43,385 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 04:47:43,385 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 04:47:43,385 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 04:47:43,385 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 04:47:43,385 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 04:47:43,385 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 04:47:43,386 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 04:47:43,386 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 04:47:43,386 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 04:47:43,386 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 04:47:43,387 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 04:47:43,387 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 04:47:43,387 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 04:47:43,387 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 04:47:43,387 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 04:47:43,387 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 04:47:43,388 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 04:47:43,388 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 04:47:43,388 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 04:47:43,388 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 04:47:43,388 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 04:47:43,388 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 04:47:43,388 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 04:47:43,389 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 04:47:43,389 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 04:47:43,389 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 04:47:43,389 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 04:47:43,389 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 04:47:43,389 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 04:47:43,389 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 04:47:43,390 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 04:47:43,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 04:47:43,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:47:43,390 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 04:47:43,390 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 04:47:43,390 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 04:47:43,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 04:47:43,391 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 04:47:43,391 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 04:47:43,391 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 04:47:43,391 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_199c676a-8ca3-489c-bc3c-6876da4f00fa/bin/utaipan-verify-sOmjnqqW8E 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 valid-memcleanup) ) 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 -> dbea62dc4a872959247118f049e63d406eb1e848bb1ed8397f1082fdec77074c [2024-11-14 04:47:43,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 04:47:43,663 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 04:47:43,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 04:47:43,668 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 04:47:43,668 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 04:47:43,670 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199c676a-8ca3-489c-bc3c-6876da4f00fa/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i Unable to find full path for "g++" [2024-11-14 04:47:45,520 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 04:47:45,909 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 04:47:45,910 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199c676a-8ca3-489c-bc3c-6876da4f00fa/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i [2024-11-14 04:47:45,935 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199c676a-8ca3-489c-bc3c-6876da4f00fa/bin/utaipan-verify-sOmjnqqW8E/data/e72f0ce35/c0cef372a1b44ae591a18ed682d97ddb/FLAGa7b437cc4 [2024-11-14 04:47:45,960 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199c676a-8ca3-489c-bc3c-6876da4f00fa/bin/utaipan-verify-sOmjnqqW8E/data/e72f0ce35/c0cef372a1b44ae591a18ed682d97ddb [2024-11-14 04:47:45,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 04:47:45,966 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 04:47:45,970 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 04:47:45,971 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 04:47:45,976 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 04:47:45,977 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:47:45" (1/1) ... [2024-11-14 04:47:45,981 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f0d2dbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:47:45, skipping insertion in model container [2024-11-14 04:47:45,982 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:47:45" (1/1) ... [2024-11-14 04:47:46,047 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 04:47:46,698 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 04:47:46,764 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 04:47:46,769 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 04:47:46,773 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 04:47:46,781 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 04:47:46,826 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 04:47:46,827 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 04:47:46,830 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 04:47:46,830 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 04:47:46,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:47:46,855 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 04:47:47,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:47:47,060 INFO L204 MainTranslator]: Completed translation [2024-11-14 04:47:47,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:47:47 WrapperNode [2024-11-14 04:47:47,061 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 04:47:47,062 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 04:47:47,062 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 04:47:47,063 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 04:47:47,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:47:47" (1/1) ... [2024-11-14 04:47:47,101 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:47:47" (1/1) ... [2024-11-14 04:47:47,171 INFO L138 Inliner]: procedures = 208, calls = 229, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1272 [2024-11-14 04:47:47,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 04:47:47,172 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 04:47:47,172 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 04:47:47,173 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 04:47:47,185 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:47:47" (1/1) ... [2024-11-14 04:47:47,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:47:47" (1/1) ... [2024-11-14 04:47:47,195 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:47:47" (1/1) ... [2024-11-14 04:47:47,196 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:47:47" (1/1) ... [2024-11-14 04:47:47,235 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:47:47" (1/1) ... [2024-11-14 04:47:47,253 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:47:47" (1/1) ... [2024-11-14 04:47:47,257 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:47:47" (1/1) ... [2024-11-14 04:47:47,262 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:47:47" (1/1) ... [2024-11-14 04:47:47,270 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 04:47:47,271 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 04:47:47,272 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 04:47:47,272 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 04:47:47,273 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:47:47" (1/1) ... [2024-11-14 04:47:47,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:47:47,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199c676a-8ca3-489c-bc3c-6876da4f00fa/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:47:47,323 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199c676a-8ca3-489c-bc3c-6876da4f00fa/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 04:47:47,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199c676a-8ca3-489c-bc3c-6876da4f00fa/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 04:47:47,358 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-14 04:47:47,358 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-14 04:47:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2024-11-14 04:47:47,359 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2024-11-14 04:47:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 04:47:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 04:47:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 04:47:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 04:47:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-14 04:47:47,359 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-14 04:47:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 04:47:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 04:47:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 04:47:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 04:47:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 04:47:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 04:47:47,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 04:47:47,667 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 04:47:47,669 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 04:47:49,793 INFO L? ?]: Removed 298 outVars from TransFormulas that were not future-live. [2024-11-14 04:47:49,794 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 04:47:51,716 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 04:47:51,718 INFO L316 CfgBuilder]: Removed 54 assume(true) statements. [2024-11-14 04:47:51,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:47:51 BoogieIcfgContainer [2024-11-14 04:47:51,719 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 04:47:51,723 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 04:47:51,723 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 04:47:51,733 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 04:47:51,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:47:45" (1/3) ... [2024-11-14 04:47:51,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8f4d349 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:47:51, skipping insertion in model container [2024-11-14 04:47:51,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:47:47" (2/3) ... [2024-11-14 04:47:51,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8f4d349 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:47:51, skipping insertion in model container [2024-11-14 04:47:51,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:47:51" (3/3) ... [2024-11-14 04:47:51,736 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test2-1.i [2024-11-14 04:47:51,754 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 04:47:51,757 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test2-1.i that has 4 procedures, 121 locations, 1 initial locations, 31 loop locations, and 2 error locations. [2024-11-14 04:47:51,819 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 04:47:51,838 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@6c90c3c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:47:51,839 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-14 04:47:51,844 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 105 states have (on average 1.7428571428571429) internal successors, (183), 114 states have internal predecessors, (183), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-14 04:47:51,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 04:47:51,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:47:51,854 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 04:47:51,855 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-14 04:47:51,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:47:51,861 INFO L85 PathProgramCache]: Analyzing trace with hash 22427501, now seen corresponding path program 1 times [2024-11-14 04:47:51,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:47:51,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299273646] [2024-11-14 04:47:51,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:47:51,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:47:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:47:52,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:47:52,064 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:47:52,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299273646] [2024-11-14 04:47:52,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299273646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:47:52,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:47:52,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:47:52,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765184764] [2024-11-14 04:47:52,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:47:52,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 04:47:52,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:47:52,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 04:47:52,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 04:47:52,108 INFO L87 Difference]: Start difference. First operand has 121 states, 105 states have (on average 1.7428571428571429) internal successors, (183), 114 states have internal predecessors, (183), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) [2024-11-14 04:47:53,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:47:55,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:47:57,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:47:58,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:47:58,141 INFO L93 Difference]: Finished difference Result 119 states and 145 transitions. [2024-11-14 04:47:58,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:47:58,146 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Word has length 6 [2024-11-14 04:47:58,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:47:58,153 INFO L225 Difference]: With dead ends: 119 [2024-11-14 04:47:58,153 INFO L226 Difference]: Without dead ends: 118 [2024-11-14 04:47:58,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 04:47:58,158 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-11-14 04:47:58,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 2 Unknown, 0 Unchecked, 6.0s Time] [2024-11-14 04:47:58,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-14 04:47:58,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-14 04:47:58,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 104 states have (on average 1.2115384615384615) internal successors, (126), 111 states have internal predecessors, (126), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-14 04:47:58,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 144 transitions. [2024-11-14 04:47:58,203 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 144 transitions. Word has length 6 [2024-11-14 04:47:58,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:47:58,204 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 144 transitions. [2024-11-14 04:47:58,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) [2024-11-14 04:47:58,204 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 144 transitions. [2024-11-14 04:47:58,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-14 04:47:58,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:47:58,204 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:47:58,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 04:47:58,205 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-14 04:47:58,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:47:58,205 INFO L85 PathProgramCache]: Analyzing trace with hash 101579821, now seen corresponding path program 1 times [2024-11-14 04:47:58,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:47:58,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177675221] [2024-11-14 04:47:58,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:47:58,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:47:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:47:58,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:47:58,491 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:47:58,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177675221] [2024-11-14 04:47:58,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177675221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:47:58,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:47:58,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 04:47:58,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275543367] [2024-11-14 04:47:58,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:47:58,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:47:58,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:47:58,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:47:58,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:47:58,497 INFO L87 Difference]: Start difference. First operand 118 states and 144 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2024-11-14 04:48:00,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:48:02,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:48:04,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:48:06,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:48:08,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:48:12,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:48:14,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:48:16,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:48:19,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-11-14 04:48:19,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:48:19,879 INFO L93 Difference]: Finished difference Result 183 states and 229 transitions. [2024-11-14 04:48:19,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:48:19,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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) Word has length 8 [2024-11-14 04:48:19,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:48:19,885 INFO L225 Difference]: With dead ends: 183 [2024-11-14 04:48:19,885 INFO L226 Difference]: Without dead ends: 183 [2024-11-14 04:48:19,885 INFO L431 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 [2024-11-14 04:48:19,886 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 70 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:48:19,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 320 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 8 Unknown, 0 Unchecked, 21.3s Time] [2024-11-14 04:48:19,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-14 04:48:19,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 120. [2024-11-14 04:48:19,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 106 states have (on average 1.2075471698113207) internal successors, (128), 113 states have internal predecessors, (128), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-14 04:48:19,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2024-11-14 04:48:19,899 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 8 [2024-11-14 04:48:19,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:48:19,900 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2024-11-14 04:48:19,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2024-11-14 04:48:19,900 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2024-11-14 04:48:19,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 04:48:19,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:48:19,901 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:48:19,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 04:48:19,901 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-14 04:48:19,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:48:19,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1490700911, now seen corresponding path program 1 times [2024-11-14 04:48:19,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:48:19,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288470528] [2024-11-14 04:48:19,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:48:19,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:48:20,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:48:20,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:48:20,399 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:48:20,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288470528] [2024-11-14 04:48:20,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288470528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:48:20,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:48:20,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:48:20,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397303275] [2024-11-14 04:48:20,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:48:20,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:48:20,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:48:20,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:48:20,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:48:20,401 INFO L87 Difference]: Start difference. First operand 120 states and 146 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 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) [2024-11-14 04:48:22,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:48:23,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:48:26,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:48:28,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:48:30,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:48:32,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:48:34,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:48:36,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:48:37,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:48:37,585 INFO L93 Difference]: Finished difference Result 170 states and 209 transitions. [2024-11-14 04:48:37,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:48:37,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 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) Word has length 36 [2024-11-14 04:48:37,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:48:37,594 INFO L225 Difference]: With dead ends: 170 [2024-11-14 04:48:37,594 INFO L226 Difference]: Without dead ends: 170 [2024-11-14 04:48:37,595 INFO L431 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 [2024-11-14 04:48:37,596 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 40 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:48:37,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 256 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 7 Unknown, 0 Unchecked, 17.2s Time] [2024-11-14 04:48:37,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-14 04:48:37,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 166. [2024-11-14 04:48:37,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 147 states have (on average 1.2108843537414966) internal successors, (178), 159 states have internal predecessors, (178), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-14 04:48:37,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 206 transitions. [2024-11-14 04:48:37,612 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 206 transitions. Word has length 36 [2024-11-14 04:48:37,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:48:37,612 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 206 transitions. [2024-11-14 04:48:37,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 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) [2024-11-14 04:48:37,612 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 206 transitions. [2024-11-14 04:48:37,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-14 04:48:37,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:48:37,614 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:48:37,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 04:48:37,614 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-14 04:48:37,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:48:37,615 INFO L85 PathProgramCache]: Analyzing trace with hash 567432743, now seen corresponding path program 1 times [2024-11-14 04:48:37,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:48:37,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633771275] [2024-11-14 04:48:37,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:48:37,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:48:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:48:38,534 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-14 04:48:38,535 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:48:38,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633771275] [2024-11-14 04:48:38,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633771275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:48:38,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:48:38,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 04:48:38,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710234447] [2024-11-14 04:48:38,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:48:38,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:48:38,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:48:38,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:48:38,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:48:38,538 INFO L87 Difference]: Start difference. First operand 166 states and 206 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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) [2024-11-14 04:48:40,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:48:42,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:48:44,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:48:46,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:48:48,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:48:50,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:48:52,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:48:54,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:48:56,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:48:58,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:49:01,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:49:03,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:49:05,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:49:07,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:49:09,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:49:11,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:49:12,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:49:12,322 INFO L93 Difference]: Finished difference Result 231 states and 300 transitions. [2024-11-14 04:49:12,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:49:12,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 49 [2024-11-14 04:49:12,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:49:12,330 INFO L225 Difference]: With dead ends: 231 [2024-11-14 04:49:12,330 INFO L226 Difference]: Without dead ends: 231 [2024-11-14 04:49:12,330 INFO L431 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 [2024-11-14 04:49:12,331 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 69 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.8s IncrementalHoareTripleChecker+Time [2024-11-14 04:49:12,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 322 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 16 Unknown, 0 Unchecked, 33.8s Time] [2024-11-14 04:49:12,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-14 04:49:12,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 168. [2024-11-14 04:49:12,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 149 states have (on average 1.2080536912751678) internal successors, (180), 161 states have internal predecessors, (180), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-14 04:49:12,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 208 transitions. [2024-11-14 04:49:12,357 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 208 transitions. Word has length 49 [2024-11-14 04:49:12,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:49:12,358 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 208 transitions. [2024-11-14 04:49:12,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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) [2024-11-14 04:49:12,358 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 208 transitions. [2024-11-14 04:49:12,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-14 04:49:12,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:49:12,360 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:49:12,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 04:49:12,361 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-14 04:49:12,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:49:12,362 INFO L85 PathProgramCache]: Analyzing trace with hash 68119395, now seen corresponding path program 1 times [2024-11-14 04:49:12,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:49:12,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874961674] [2024-11-14 04:49:12,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:49:12,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:49:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:49:12,999 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 04:49:13,000 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:49:13,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874961674] [2024-11-14 04:49:13,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874961674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:49:13,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:49:13,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 04:49:13,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601238389] [2024-11-14 04:49:13,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:49:13,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:49:13,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:49:13,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:49:13,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:49:13,004 INFO L87 Difference]: Start difference. First operand 168 states and 208 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 04:49:15,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:49:17,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:49:19,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:49:21,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:49:23,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:49:26,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:49:27,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:49:27,709 INFO L93 Difference]: Finished difference Result 136 states and 161 transitions. [2024-11-14 04:49:27,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:49:27,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 65 [2024-11-14 04:49:27,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:49:27,711 INFO L225 Difference]: With dead ends: 136 [2024-11-14 04:49:27,711 INFO L226 Difference]: Without dead ends: 136 [2024-11-14 04:49:27,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:49:27,712 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 176 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 13 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.7s IncrementalHoareTripleChecker+Time [2024-11-14 04:49:27,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 165 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 54 Invalid, 6 Unknown, 0 Unchecked, 14.7s Time] [2024-11-14 04:49:27,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-14 04:49:27,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-14 04:49:27,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 122 states have (on average 1.1721311475409837) internal successors, (143), 129 states have internal predecessors, (143), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-14 04:49:27,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 161 transitions. [2024-11-14 04:49:27,735 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 161 transitions. Word has length 65 [2024-11-14 04:49:27,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:49:27,735 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 161 transitions. [2024-11-14 04:49:27,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 04:49:27,736 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 161 transitions. [2024-11-14 04:49:27,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-14 04:49:27,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:49:27,739 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:49:27,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 04:49:27,739 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-14 04:49:27,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:49:27,740 INFO L85 PathProgramCache]: Analyzing trace with hash -969204832, now seen corresponding path program 1 times [2024-11-14 04:49:27,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:49:27,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722294553] [2024-11-14 04:49:27,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:49:27,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:49:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:49:30,172 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 04:49:30,172 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:49:30,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722294553] [2024-11-14 04:49:30,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722294553] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:49:30,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156663023] [2024-11-14 04:49:30,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:49:30,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:49:30,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199c676a-8ca3-489c-bc3c-6876da4f00fa/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:49:30,179 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199c676a-8ca3-489c-bc3c-6876da4f00fa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:49:30,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199c676a-8ca3-489c-bc3c-6876da4f00fa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 04:50:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:50:11,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 04:50:11,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:50:11,353 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:50:11,353 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:50:11,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156663023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:50:11,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:50:11,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-11-14 04:50:11,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780685616] [2024-11-14 04:50:11,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:50:11,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:50:11,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:50:11,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:50:11,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:50:11,356 INFO L87 Difference]: Start difference. First operand 136 states and 161 transitions. Second operand has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 04:50:12,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:50:14,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:50:16,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:50:17,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:50:19,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:50:21,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:50:23,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:50:25,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:50:25,199 INFO L93 Difference]: Finished difference Result 138 states and 164 transitions. [2024-11-14 04:50:25,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:50:25,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2024-11-14 04:50:25,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:50:25,205 INFO L225 Difference]: With dead ends: 138 [2024-11-14 04:50:25,206 INFO L226 Difference]: Without dead ends: 138 [2024-11-14 04:50:25,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:50:25,207 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2024-11-14 04:50:25,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 359 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 4 Unknown, 0 Unchecked, 13.8s Time] [2024-11-14 04:50:25,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-14 04:50:25,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-11-14 04:50:25,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 123 states have (on average 1.1788617886178863) internal successors, (145), 131 states have internal predecessors, (145), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-14 04:50:25,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 164 transitions. [2024-11-14 04:50:25,218 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 164 transitions. Word has length 73 [2024-11-14 04:50:25,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:50:25,218 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 164 transitions. [2024-11-14 04:50:25,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 04:50:25,218 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 164 transitions. [2024-11-14 04:50:25,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-14 04:50:25,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:50:25,223 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:50:25,277 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199c676a-8ca3-489c-bc3c-6876da4f00fa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 04:50:25,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199c676a-8ca3-489c-bc3c-6876da4f00fa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-14 04:50:25,424 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-14 04:50:25,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:50:25,424 INFO L85 PathProgramCache]: Analyzing trace with hash 278463216, now seen corresponding path program 1 times [2024-11-14 04:50:25,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:50:25,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016947330] [2024-11-14 04:50:25,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:50:25,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:50:27,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:50:27,882 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 04:50:27,884 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:50:27,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016947330] [2024-11-14 04:50:27,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016947330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:50:27,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470510340] [2024-11-14 04:50:27,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:50:27,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:50:27,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199c676a-8ca3-489c-bc3c-6876da4f00fa/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:50:27,888 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199c676a-8ca3-489c-bc3c-6876da4f00fa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:50:27,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199c676a-8ca3-489c-bc3c-6876da4f00fa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 04:50:58,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:50:58,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 04:50:58,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:50:58,525 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 04:50:58,526 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:50:58,686 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 04:50:58,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470510340] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:50:58,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1059255697] [2024-11-14 04:50:58,724 INFO L159 IcfgInterpreter]: Started Sifa with 69 locations of interest [2024-11-14 04:50:58,725 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:50:58,731 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:50:58,742 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:50:58,743 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:51:24,034 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 396 for LOIs [2024-11-14 04:51:29,124 INFO L197 IcfgInterpreter]: Interpreting procedure reach_error with input of size 7 for LOIs [2024-11-14 04:51:29,129 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:52:02,301 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_#Ultimate.C_memset_#ptr.offset| 0)) (.cse5 (= 44 |c_#Ultimate.C_memset_#amount|)) (.cse4 (= |c_#Ultimate.C_memset_#value| 0)) (.cse52 (= |c_#Ultimate.C_memset_#amount| 384))) (and (let ((.cse0 (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|)) (.cse1 (= |c_old(#memory_int)| |c_#memory_int|)) (.cse3 (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12| Int) (|v_#memory_int_426| (Array Int (Array Int Int))) (|v_#valid_55| (Array Int Int)) (|v_#memory_int_428| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_21| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_319| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_319| (Array Int (Array Int Int))) (|v_#memory_int_35| (Array Int (Array Int Int))) (|v_#memory_int_128| (Array Int (Array Int Int))) (|v_#length_33| (Array Int Int)) (|v_ULTIMATE.start_main_~_ha_hashv~0#1_BEFORE_CALL_12| Int) (|v_#memory_$Pointer$.offset_21| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_320| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_320| (Array Int (Array Int Int)))) (let ((.cse11 (select |v_#memory_$Pointer$.offset_21| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12|)) (.cse6 (select (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12|) 8)) (.cse12 (select |v_#memory_$Pointer$.offset_320| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12|)) (.cse7 (select |v_#memory_int_35| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12|)) (.cse10 (select |v_#memory_$Pointer$.base_320| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12|)) (.cse13 (select |v_#memory_$Pointer$.base_21| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12|)) (.cse8 (select |v_#memory_int_128| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12|)) (.cse9 (select |v_#memory_int_428| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12|))) (and (= .cse6 |c_#Ultimate.C_memset_#ptr.base|) (= |c_#valid| (store |v_#valid_55| .cse6 1)) (= (store |v_#memory_int_35| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12| (store (store .cse7 32 4) 16 (select .cse8 16))) |v_#memory_int_128|) (= (store |v_#length_33| .cse6 44) |c_#length|) (= |c_old(#memory_int)| (store |v_#memory_int_428| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12| (store .cse9 8 (select (select |c_old(#memory_int)| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12|) 8)))) (= 0 (select |v_#valid_55| .cse6)) (= |c_old(#memory_$Pointer$.base)| (store |v_#memory_$Pointer$.base_320| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12| (store (store (store .cse10 16 0) 12 0) 8 .cse6))) (= (store |v_#memory_$Pointer$.offset_319| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12| (store (select |v_#memory_$Pointer$.offset_319| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12|) 36 (select .cse11 36))) |v_#memory_$Pointer$.offset_21|) (= |v_#memory_$Pointer$.offset_320| (store |v_#memory_$Pointer$.offset_21| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12| (store (store .cse11 28 0) 32 (select .cse12 32)))) (<= (+ .cse6 1) |c_#StackHeapBarrier|) (not (= .cse6 0)) (= (store |v_#memory_$Pointer$.offset_320| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12| (store (store (store .cse12 16 0) 12 0) 8 0)) |c_old(#memory_$Pointer$.offset)|) (= |v_#memory_int_35| (store |v_#memory_int_426| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12| (store (store (select |v_#memory_int_426| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12|) 36 |v_ULTIMATE.start_main_~_ha_hashv~0#1_BEFORE_CALL_12|) 28 (select .cse7 28)))) (= (store |v_#memory_$Pointer$.base_21| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12| (store (store .cse13 28 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12|) 32 (select .cse10 32))) |v_#memory_$Pointer$.base_320|) (= (store |v_#memory_$Pointer$.base_319| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12| (store (select |v_#memory_$Pointer$.base_319| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12|) 36 (select .cse13 36))) |v_#memory_$Pointer$.base_21|) (= |v_#memory_int_428| (store |v_#memory_int_128| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12| (store .cse8 12 (select .cse9 12)))))))) (and .cse0 .cse1 .cse3 .cse4 (exists ((|v_#memory_int_129| (Array Int (Array Int Int))) (|v_#valid_56| (Array Int Int)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| Int) (|v_#memory_$Pointer$.offset_106| (Array Int (Array Int Int))) (|v_#memory_int_429| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_107| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_108| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_108| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_107| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_106| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem54#1.base_14| Int) (|v_#length_34| (Array Int Int)) (|v_ULTIMATE.start_main_~_ha_hashv~0#1_BEFORE_CALL_11| Int) (|v_#memory_$Pointer$.base_322| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_322| (Array Int (Array Int Int))) (|v_#memory_int_130| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc61#1.base_6| Int)) (let ((.cse46 (select (select |v_#memory_$Pointer$.base_107| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 8)) (.cse47 (select (select |v_#memory_$Pointer$.offset_108| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 8)) (.cse41 (select (select |v_#memory_$Pointer$.base_322| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 8)) (.cse42 (+ 16 (select (select |v_#memory_$Pointer$.offset_322| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 8)))) (let ((.cse35 (store |v_#memory_$Pointer$.offset_322| .cse41 (store (select |v_#memory_$Pointer$.offset_322| .cse41) .cse42 8))) (.cse44 (store |v_#memory_$Pointer$.base_322| .cse41 (store (select |v_#memory_$Pointer$.base_322| .cse41) .cse42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|))) (.cse50 (select (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 8)) (.cse51 (select (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 8)) (.cse16 (store |v_#memory_$Pointer$.offset_108| .cse46 (store (select |v_#memory_$Pointer$.offset_108| .cse46) .cse47 0))) (.cse32 (store |v_#memory_$Pointer$.base_107| .cse46 (store (select |v_#memory_$Pointer$.base_107| .cse46) .cse47 |v_ULTIMATE.start_main_#t~malloc61#1.base_6|)))) (let ((.cse14 (select (select .cse32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 8)) (.cse15 (+ (select (select .cse16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 8) 40)) (.cse38 (select (select |c_old(#memory_$Pointer$.base)| .cse50) .cse51)) (.cse43 (select (select |c_old(#memory_$Pointer$.offset)| .cse50) .cse51)) (.cse39 (select (select |v_#memory_$Pointer$.base_108| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 8)) (.cse40 (+ (select (select |v_#memory_$Pointer$.offset_106| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 8) 20)) (.cse33 (select (select |v_#memory_$Pointer$.base_106| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 8)) (.cse34 (+ 8 (select (select |v_#memory_$Pointer$.offset_107| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 8))) (.cse36 (select (select .cse44 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 8)) (.cse37 (+ (select (select .cse35 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 8) 4))) (and (= |c_old(#memory_int)| (store |v_#memory_int_129| .cse14 (store (select |v_#memory_int_129| .cse14) .cse15 2685476833))) (= (store .cse16 .cse14 (store (select .cse16 .cse14) .cse15 (select (select |c_old(#memory_$Pointer$.offset)| .cse14) .cse15))) |c_old(#memory_$Pointer$.offset)|) (let ((.cse17 (exists ((|v_#Ultimate.C_memset_#t~loopctr228_26| Int)) (and (<= 0 |v_#Ultimate.C_memset_#t~loopctr228_26|) (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr228_26| 4294967296))))) (.cse18 (exists ((|v_#memory_$Pointer$.offset_21| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_319| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_320| (Array Int (Array Int Int)))) (let ((.cse31 (select |v_#memory_$Pointer$.offset_21| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|))) (and (= |v_#memory_$Pointer$.offset_320| (store |v_#memory_$Pointer$.offset_21| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (store (store .cse31 28 0) 32 (select (select |v_#memory_$Pointer$.offset_320| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 32)))) (= (store |v_#memory_$Pointer$.offset_319| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (store (select |v_#memory_$Pointer$.offset_319| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 36 (select .cse31 36))) |v_#memory_$Pointer$.offset_21|)))))) (or (and .cse17 .cse18 (exists ((|v_#valid_55| (Array Int Int)) (|v_#memory_$Pointer$.base_21| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_319| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_13| (Array Int (Array Int Int))) (|v_#length_33| (Array Int Int)) (|v_#memory_$Pointer$.base_320| (Array Int (Array Int Int)))) (let ((.cse19 (select |v_#memory_$Pointer$.base_21| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|)) (.cse20 (select |v_#memory_$Pointer$.base_320| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|)) (.cse21 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_13| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 8))) (and (= |v_#memory_$Pointer$.base_320| (store |v_#memory_$Pointer$.base_21| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (store (store .cse19 28 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 32 (select .cse20 32)))) (= (store |v_#length_33| .cse21 44) |v_#length_34|) (= (store |v_#memory_$Pointer$.base_319| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (store (select |v_#memory_$Pointer$.base_319| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 36 (select .cse19 36))) |v_#memory_$Pointer$.base_21|) (= (select |v_#valid_55| .cse21) 0) (= (store |v_#valid_55| .cse21 1) |v_#valid_56|) (= |v_ULTIMATE.start_main_#t~mem54#1.base_14| .cse21) (<= (+ 1 .cse21) |c_#StackHeapBarrier|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_13| (store |v_#memory_$Pointer$.base_320| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (store (store (store .cse20 16 0) 12 0) 8 .cse21))) (not (= 0 .cse21))))) (exists ((|v_#memory_int_426| (Array Int (Array Int Int))) (|v_#memory_int_428| (Array Int (Array Int Int))) (|v_#memory_int_35| (Array Int (Array Int Int))) (|v_#memory_int_128| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_18| (Array Int (Array Int Int)))) (let ((.cse22 (select |v_#memory_int_428| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|)) (.cse24 (select |v_#memory_int_35| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|)) (.cse23 (select |v_#memory_int_128| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|))) (and (= (store |v_#memory_int_428| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (store .cse22 8 (select (select |v_#memory_int_BEFORE_CALL_18| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 8))) |v_#memory_int_BEFORE_CALL_18|) (= (store |v_#memory_int_128| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (store .cse23 12 (select .cse22 12))) |v_#memory_int_428|) (= |v_#memory_int_35| (store |v_#memory_int_426| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (store (store (select |v_#memory_int_426| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 36 |v_ULTIMATE.start_main_~_ha_hashv~0#1_BEFORE_CALL_11|) 28 (select .cse24 28)))) (= (store |v_#memory_int_35| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (store (store .cse24 32 4) 16 (select .cse23 16))) |v_#memory_int_128|))))) (and .cse17 .cse18 (exists ((|v_#valid_55| (Array Int Int)) (|v_#memory_$Pointer$.base_21| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_319| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_14| (Array Int (Array Int Int))) (|v_#length_33| (Array Int Int)) (|v_#memory_$Pointer$.base_320| (Array Int (Array Int Int)))) (let ((.cse26 (select |v_#memory_$Pointer$.base_21| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|)) (.cse27 (select |v_#memory_$Pointer$.base_320| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|)) (.cse25 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_14| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 8))) (and (not (= .cse25 0)) (<= (+ .cse25 1) |c_#StackHeapBarrier|) (= |v_#memory_$Pointer$.base_320| (store |v_#memory_$Pointer$.base_21| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (store (store .cse26 28 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 32 (select .cse27 32)))) (= .cse25 |v_ULTIMATE.start_main_#t~mem54#1.base_14|) (= |v_#valid_56| (store |v_#valid_55| .cse25 1)) (= (store |v_#memory_$Pointer$.base_319| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (store (select |v_#memory_$Pointer$.base_319| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 36 (select .cse26 36))) |v_#memory_$Pointer$.base_21|) (= (store |v_#length_33| .cse25 44) |v_#length_34|) (= (store |v_#memory_$Pointer$.base_320| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (store (store (store .cse27 16 0) 12 0) 8 .cse25)) |v_old(#memory_$Pointer$.base)_AFTER_CALL_14|) (= 0 (select |v_#valid_55| .cse25))))) (exists ((|v_#memory_int_426| (Array Int (Array Int Int))) (|v_#memory_int_428| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_14| (Array Int (Array Int Int))) (|v_#memory_int_35| (Array Int (Array Int Int))) (|v_#memory_int_128| (Array Int (Array Int Int)))) (let ((.cse28 (select |v_#memory_int_428| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|)) (.cse30 (select |v_#memory_int_35| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|)) (.cse29 (select |v_#memory_int_128| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|))) (and (= |v_old(#memory_int)_AFTER_CALL_14| (store |v_#memory_int_428| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (store .cse28 8 (select (select |v_old(#memory_int)_AFTER_CALL_14| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 8)))) (= (store |v_#memory_int_128| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (store .cse29 12 (select .cse28 12))) |v_#memory_int_428|) (= |v_#memory_int_35| (store |v_#memory_int_426| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (store (store (select |v_#memory_int_426| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 36 |v_ULTIMATE.start_main_~_ha_hashv~0#1_BEFORE_CALL_11|) 28 (select .cse30 28)))) (= (store |v_#memory_int_35| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (store (store .cse30 32 4) 16 (select .cse29 16))) |v_#memory_int_128|))))))) (= (store .cse32 .cse14 (store (select .cse32 .cse14) .cse15 (select (select |c_old(#memory_$Pointer$.base)| .cse14) .cse15))) |c_old(#memory_$Pointer$.base)|) (= (select |v_#valid_56| |v_ULTIMATE.start_main_#t~malloc61#1.base_6|) 0) (= (store |v_#memory_$Pointer$.base_106| .cse33 (store (select |v_#memory_$Pointer$.base_106| .cse33) .cse34 (select (select |v_#memory_$Pointer$.base_108| .cse33) .cse34))) |v_#memory_$Pointer$.base_108|) (= (store .cse35 .cse36 (store (select .cse35 .cse36) .cse37 (select (select |v_#memory_$Pointer$.offset_107| .cse36) .cse37))) |v_#memory_$Pointer$.offset_107|) (= (store |v_#memory_$Pointer$.offset_107| .cse33 (store (select |v_#memory_$Pointer$.offset_107| .cse33) .cse34 (select (select |v_#memory_$Pointer$.offset_106| .cse33) .cse34))) |v_#memory_$Pointer$.offset_106|) (= |c_#Ultimate.C_memset_#ptr.base| .cse38) (= (store |v_#length_34| |v_ULTIMATE.start_main_#t~malloc61#1.base_6| 384) |c_#length|) (= (store |v_#memory_$Pointer$.offset_106| .cse39 (store (select |v_#memory_$Pointer$.offset_106| .cse39) .cse40 (select (select |v_#memory_$Pointer$.offset_108| .cse39) .cse40))) |v_#memory_$Pointer$.offset_108|) (= (store |v_#memory_$Pointer$.base_108| .cse39 (store (select |v_#memory_$Pointer$.base_108| .cse39) .cse40 (select (select |v_#memory_$Pointer$.base_107| .cse39) .cse40))) |v_#memory_$Pointer$.base_107|) (<= (+ |v_ULTIMATE.start_main_#t~malloc61#1.base_6| 1) |c_#StackHeapBarrier|) (= |v_#memory_int_130| (store |v_#memory_int_429| .cse41 (store (select |v_#memory_int_429| .cse41) .cse42 (select (select |v_#memory_int_130| .cse41) .cse42)))) (not (= |v_ULTIMATE.start_main_#t~malloc61#1.base_6| 0)) (= .cse43 |c_#Ultimate.C_memset_#ptr.offset|) (= |c_#valid| (store |v_#valid_56| |v_ULTIMATE.start_main_#t~malloc61#1.base_6| 1)) (= (store .cse44 .cse36 (store (select .cse44 .cse36) .cse37 (select (select |v_#memory_$Pointer$.base_106| .cse36) .cse37))) |v_#memory_$Pointer$.base_106|) (or (not (= .cse38 0)) (not (= .cse43 0))) (= (let ((.cse45 (let ((.cse48 (let ((.cse49 (store |v_#memory_int_130| .cse36 (store (select |v_#memory_int_130| .cse36) .cse37 32)))) (store .cse49 .cse33 (store (select .cse49 .cse33) .cse34 5))))) (store .cse48 .cse39 (store (select .cse48 .cse39) .cse40 8))))) (store .cse45 .cse46 (store (select .cse45 .cse46) .cse47 (select (select |v_#memory_int_129| .cse46) .cse47)))) |v_#memory_int_129|)))))) .cse52))) (or (and .cse2 .cse4 .cse5) (and .cse4 .cse52)))) is different from false [2024-11-14 04:52:08,884 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse34 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse35 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (and (= |c_ULTIMATE.start_main_~user~0#1.offset| 0) (exists ((|v_#memory_int_129| (Array Int (Array Int Int))) (|v_#valid_56| (Array Int Int)) (|v_#memory_$Pointer$.offset_106| (Array Int (Array Int Int))) (|v_#memory_int_429| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_107| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_108| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_108| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_107| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_106| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem54#1.base_14| Int) (|v_#length_34| (Array Int Int)) (|v_#memory_$Pointer$.base_322| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_322| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc61#1.base_6| Int) (|v_#memory_int_130| (Array Int (Array Int Int)))) (let ((.cse30 (select (select |v_#memory_$Pointer$.base_107| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse31 (select (select |v_#memory_$Pointer$.offset_108| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse27 (select (select |v_#memory_$Pointer$.base_322| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse28 (+ (select (select |v_#memory_$Pointer$.offset_322| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 16))) (let ((.cse10 (store |v_#memory_$Pointer$.offset_322| .cse27 (store (select |v_#memory_$Pointer$.offset_322| .cse27) .cse28 8))) (.cse2 (store |v_#memory_$Pointer$.base_322| .cse27 (store (select |v_#memory_$Pointer$.base_322| .cse27) .cse28 |c_ULTIMATE.start_main_~user~0#1.base|))) (.cse7 (store |v_#memory_$Pointer$.offset_108| .cse30 (store (select |v_#memory_$Pointer$.offset_108| .cse30) .cse31 0))) (.cse11 (store |v_#memory_$Pointer$.base_107| .cse30 (store (select |v_#memory_$Pointer$.base_107| .cse30) .cse31 |v_ULTIMATE.start_main_#t~malloc61#1.base_6|)))) (let ((.cse5 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse6 (+ 40 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (.cse8 (select (select |v_#memory_$Pointer$.base_108| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse9 (+ (select (select |v_#memory_$Pointer$.offset_106| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 20)) (.cse0 (select (select |v_#memory_$Pointer$.base_106| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse1 (+ 8 (select (select |v_#memory_$Pointer$.offset_107| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse4 (+ (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) 8) 4))) (and (= (store |v_#memory_$Pointer$.offset_107| .cse0 (store (select |v_#memory_$Pointer$.offset_107| .cse0) .cse1 (select (select |v_#memory_$Pointer$.offset_106| .cse0) .cse1))) |v_#memory_$Pointer$.offset_106|) (= (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 (select (select |v_#memory_$Pointer$.base_106| .cse3) .cse4))) |v_#memory_$Pointer$.base_106|) (= (store |v_#memory_int_129| .cse5 (store (select |v_#memory_int_129| .cse5) .cse6 2685476833)) |c_#memory_int|) (= (store .cse7 .cse5 (store (select .cse7 .cse5) .cse6 (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6))) |c_#memory_$Pointer$.offset|) (= (select |v_#valid_56| |v_ULTIMATE.start_main_#t~malloc61#1.base_6|) 0) (= (store |v_#memory_$Pointer$.base_108| .cse8 (store (select |v_#memory_$Pointer$.base_108| .cse8) .cse9 (select (select |v_#memory_$Pointer$.base_107| .cse8) .cse9))) |v_#memory_$Pointer$.base_107|) (= (store |v_#memory_$Pointer$.offset_106| .cse8 (store (select |v_#memory_$Pointer$.offset_106| .cse8) .cse9 (select (select |v_#memory_$Pointer$.offset_108| .cse8) .cse9))) |v_#memory_$Pointer$.offset_108|) (= |v_#memory_$Pointer$.offset_107| (store .cse10 .cse3 (store (select .cse10 .cse3) .cse4 (select (select |v_#memory_$Pointer$.offset_107| .cse3) .cse4)))) (= (store |v_#length_34| |v_ULTIMATE.start_main_#t~malloc61#1.base_6| 384) |c_#length|) (= |c_#memory_$Pointer$.base| (store .cse11 .cse5 (store (select .cse11 .cse5) .cse6 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6)))) (let ((.cse12 (exists ((|v_#Ultimate.C_memset_#t~loopctr228_26| Int)) (and (<= 0 |v_#Ultimate.C_memset_#t~loopctr228_26|) (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr228_26| 4294967296))))) (.cse16 (exists ((|v_#memory_$Pointer$.offset_21| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_319| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_320| (Array Int (Array Int Int)))) (let ((.cse26 (select |v_#memory_$Pointer$.offset_21| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_$Pointer$.offset_319| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_319| |c_ULTIMATE.start_main_~user~0#1.base|) 36 (select .cse26 36))) |v_#memory_$Pointer$.offset_21|) (= (store |v_#memory_$Pointer$.offset_21| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse26 28 0) 32 (select (select |v_#memory_$Pointer$.offset_320| |c_ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.offset_320|)))))) (or (and .cse12 (exists ((|v_#memory_int_426| (Array Int (Array Int Int))) (|v_#memory_int_428| (Array Int (Array Int Int))) (|v_#memory_int_35| (Array Int (Array Int Int))) (|v_#memory_int_128| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_18| (Array Int (Array Int Int)))) (let ((.cse13 (select |v_#memory_int_428| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse14 (select |v_#memory_int_128| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse15 (select |v_#memory_int_35| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_int_428| |c_ULTIMATE.start_main_~user~0#1.base| (store .cse13 8 (select (select |v_#memory_int_BEFORE_CALL_18| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) |v_#memory_int_BEFORE_CALL_18|) (= |v_#memory_int_428| (store |v_#memory_int_128| |c_ULTIMATE.start_main_~user~0#1.base| (store .cse14 12 (select .cse13 12)))) (= (store |v_#memory_int_35| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse15 32 4) 16 (select .cse14 16))) |v_#memory_int_128|) (= (store |v_#memory_int_426| |c_ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_426| |c_ULTIMATE.start_main_~user~0#1.base|) 36 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select .cse15 28))) |v_#memory_int_35|)))) .cse16 (exists ((|v_#valid_55| (Array Int Int)) (|v_#memory_$Pointer$.base_21| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_319| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_13| (Array Int (Array Int Int))) (|v_#length_33| (Array Int Int)) (|v_#memory_$Pointer$.base_320| (Array Int (Array Int Int)))) (let ((.cse19 (select |v_#memory_$Pointer$.base_320| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse18 (select |v_#memory_$Pointer$.base_21| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse17 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_13| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (and (= |v_#valid_56| (store |v_#valid_55| .cse17 1)) (= (store |v_#memory_$Pointer$.base_21| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse18 28 |c_ULTIMATE.start_main_~user~0#1.base|) 32 (select .cse19 32))) |v_#memory_$Pointer$.base_320|) (= .cse17 |v_ULTIMATE.start_main_#t~mem54#1.base_14|) (<= (+ .cse17 1) |c_#StackHeapBarrier|) (= (store |v_#memory_$Pointer$.base_320| |c_ULTIMATE.start_main_~user~0#1.base| (store (store (store .cse19 16 0) 12 0) 8 .cse17)) |v_old(#memory_$Pointer$.base)_AFTER_CALL_13|) (not (= .cse17 0)) (= (store |v_#memory_$Pointer$.base_319| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_319| |c_ULTIMATE.start_main_~user~0#1.base|) 36 (select .cse18 36))) |v_#memory_$Pointer$.base_21|) (= (store |v_#length_33| .cse17 44) |v_#length_34|) (= (select |v_#valid_55| .cse17) 0))))) (and .cse12 .cse16 (exists ((|v_#valid_55| (Array Int Int)) (|v_#memory_$Pointer$.base_21| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_319| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_14| (Array Int (Array Int Int))) (|v_#length_33| (Array Int Int)) (|v_#memory_$Pointer$.base_320| (Array Int (Array Int Int)))) (let ((.cse20 (select |v_#memory_$Pointer$.base_21| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse21 (select |v_#memory_$Pointer$.base_320| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse22 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_14| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (and (= (store |v_#memory_$Pointer$.base_21| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse20 28 |c_ULTIMATE.start_main_~user~0#1.base|) 32 (select .cse21 32))) |v_#memory_$Pointer$.base_320|) (not (= .cse22 0)) (= (store |v_#valid_55| .cse22 1) |v_#valid_56|) (<= (+ .cse22 1) |c_#StackHeapBarrier|) (= |v_ULTIMATE.start_main_#t~mem54#1.base_14| .cse22) (= (store |v_#memory_$Pointer$.base_319| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_319| |c_ULTIMATE.start_main_~user~0#1.base|) 36 (select .cse20 36))) |v_#memory_$Pointer$.base_21|) (= (store |v_#length_33| .cse22 44) |v_#length_34|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_14| (store |v_#memory_$Pointer$.base_320| |c_ULTIMATE.start_main_~user~0#1.base| (store (store (store .cse21 16 0) 12 0) 8 .cse22))) (= (select |v_#valid_55| .cse22) 0)))) (exists ((|v_#memory_int_426| (Array Int (Array Int Int))) (|v_#memory_int_428| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_14| (Array Int (Array Int Int))) (|v_#memory_int_35| (Array Int (Array Int Int))) (|v_#memory_int_128| (Array Int (Array Int Int)))) (let ((.cse23 (select |v_#memory_int_128| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse24 (select |v_#memory_int_428| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse25 (select |v_#memory_int_35| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= |v_#memory_int_428| (store |v_#memory_int_128| |c_ULTIMATE.start_main_~user~0#1.base| (store .cse23 12 (select .cse24 12)))) (= (store |v_#memory_int_35| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse25 32 4) 16 (select .cse23 16))) |v_#memory_int_128|) (= |v_old(#memory_int)_AFTER_CALL_14| (store |v_#memory_int_428| |c_ULTIMATE.start_main_~user~0#1.base| (store .cse24 8 (select (select |v_old(#memory_int)_AFTER_CALL_14| |c_ULTIMATE.start_main_~user~0#1.base|) 8)))) (= (store |v_#memory_int_426| |c_ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_426| |c_ULTIMATE.start_main_~user~0#1.base|) 36 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select .cse25 28))) |v_#memory_int_35|))))))) (<= (+ |v_ULTIMATE.start_main_#t~malloc61#1.base_6| 1) |c_#StackHeapBarrier|) (not (= |v_ULTIMATE.start_main_#t~malloc61#1.base_6| 0)) (= (store |v_#memory_$Pointer$.base_106| .cse0 (store (select |v_#memory_$Pointer$.base_106| .cse0) .cse1 (select (select |v_#memory_$Pointer$.base_108| .cse0) .cse1))) |v_#memory_$Pointer$.base_108|) (= (store |v_#memory_int_429| .cse27 (store (select |v_#memory_int_429| .cse27) .cse28 (select (select |v_#memory_int_130| .cse27) .cse28))) |v_#memory_int_130|) (= |c_#valid| (store |v_#valid_56| |v_ULTIMATE.start_main_#t~malloc61#1.base_6| 1)) (= (let ((.cse29 (let ((.cse32 (let ((.cse33 (store |v_#memory_int_130| .cse3 (store (select |v_#memory_int_130| .cse3) .cse4 32)))) (store .cse33 .cse0 (store (select .cse33 .cse0) .cse1 5))))) (store .cse32 .cse8 (store (select .cse32 .cse8) .cse9 8))))) (store .cse29 .cse30 (store (select .cse29 .cse30) .cse31 (select (select |v_#memory_int_129| .cse30) .cse31)))) |v_#memory_int_129|)))))) (= (select (select |c_#memory_$Pointer$.offset| .cse34) .cse35) |c_ULTIMATE.start_main_#t~mem64#1.offset|) (= (select (select |c_#memory_$Pointer$.base| .cse34) .cse35) |c_ULTIMATE.start_main_#t~mem64#1.base|))) is different from false [2024-11-14 04:54:59,107 WARN L286 SmtUtils]: Spent 2.53m on a formula simplification that was a NOOP. DAG size: 306 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:55:56,144 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2646#(and (<= 1 |#StackHeapBarrier|) (= ~count_int_int~0 0))' at error location [2024-11-14 04:55:56,144 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 04:55:56,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:55:56,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-14 04:55:56,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40154187] [2024-11-14 04:55:56,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:55:56,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 04:55:56,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:55:56,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 04:55:56,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1175, Unknown=60, NotChecked=146, Total=1560 [2024-11-14 04:55:56,148 INFO L87 Difference]: Start difference. First operand 138 states and 164 transitions. Second operand has 10 states, 7 states have (on average 11.142857142857142) internal successors, (78), 10 states have internal predecessors, (78), 2 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-14 04:55:59,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:56:01,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:56:03,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:56:05,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:56:06,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:56:09,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:56:11,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:56:13,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:56:15,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:56:17,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:56:19,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:56:21,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:56:23,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:56:25,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:56:27,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:56:29,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:56:32,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-11-14 04:56:33,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:56:33,050 INFO L93 Difference]: Finished difference Result 147 states and 177 transitions. [2024-11-14 04:56:33,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 04:56:33,051 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 11.142857142857142) internal successors, (78), 10 states have internal predecessors, (78), 2 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 75 [2024-11-14 04:56:33,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:56:33,054 INFO L225 Difference]: With dead ends: 147 [2024-11-14 04:56:33,054 INFO L226 Difference]: Without dead ends: 146 [2024-11-14 04:56:33,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 179 SyntacticMatches, 11 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 267.4s TimeCoverageRelationStatistics Valid=204, Invalid=1384, Unknown=60, NotChecked=158, Total=1806 [2024-11-14 04:56:33,056 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 4 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 7 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.6s IncrementalHoareTripleChecker+Time [2024-11-14 04:56:33,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 591 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 151 Invalid, 15 Unknown, 0 Unchecked, 36.6s Time] [2024-11-14 04:56:33,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-14 04:56:33,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2024-11-14 04:56:33,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 130 states have (on average 1.2) internal successors, (156), 138 states have internal predecessors, (156), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-14 04:56:33,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 175 transitions. [2024-11-14 04:56:33,066 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 175 transitions. Word has length 75 [2024-11-14 04:56:33,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:56:33,066 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 175 transitions. [2024-11-14 04:56:33,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 11.142857142857142) internal successors, (78), 10 states have internal predecessors, (78), 2 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-14 04:56:33,067 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 175 transitions. [2024-11-14 04:56:33,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-14 04:56:33,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:56:33,069 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:56:33,135 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199c676a-8ca3-489c-bc3c-6876da4f00fa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-14 04:56:33,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199c676a-8ca3-489c-bc3c-6876da4f00fa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:56:33,269 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-14 04:56:33,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:56:33,270 INFO L85 PathProgramCache]: Analyzing trace with hash 722615296, now seen corresponding path program 2 times [2024-11-14 04:56:33,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:56:33,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861973250] [2024-11-14 04:56:33,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:56:33,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:56:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:56:35,491 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 04:56:35,491 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:56:35,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861973250] [2024-11-14 04:56:35,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861973250] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:56:35,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758189891] [2024-11-14 04:56:35,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 04:56:35,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:56:35,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199c676a-8ca3-489c-bc3c-6876da4f00fa/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:56:35,496 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199c676a-8ca3-489c-bc3c-6876da4f00fa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:56:35,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199c676a-8ca3-489c-bc3c-6876da4f00fa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process