./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-memleak_nexttime.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4addc05-f13f-4a7d-9101-25b8c5da7ecb/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4addc05-f13f-4a7d-9101-25b8c5da7ecb/bin/ukojak-verify-ENZ3QT5qd3/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4addc05-f13f-4a7d-9101-25b8c5da7ecb/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4addc05-f13f-4a7d-9101-25b8c5da7ecb/bin/ukojak-verify-ENZ3QT5qd3/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-memleak_nexttime.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4addc05-f13f-4a7d-9101-25b8c5da7ecb/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4addc05-f13f-4a7d-9101-25b8c5da7ecb/bin/ukojak-verify-ENZ3QT5qd3 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0176377c3fa036d8b42b70bf41d842353f196a854b997aa0bf5f176a7ad1942b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-25 04:08:47,901 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-25 04:08:47,989 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4addc05-f13f-4a7d-9101-25b8c5da7ecb/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf [2024-11-25 04:08:47,995 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-25 04:08:47,995 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-25 04:08:48,045 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-25 04:08:48,047 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-25 04:08:48,047 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-25 04:08:48,047 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-25 04:08:48,047 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-25 04:08:48,048 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-25 04:08:48,048 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-25 04:08:48,048 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-25 04:08:48,048 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-25 04:08:48,048 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-25 04:08:48,048 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-25 04:08:48,049 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-25 04:08:48,049 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-25 04:08:48,049 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-25 04:08:48,049 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-25 04:08:48,049 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-25 04:08:48,050 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-25 04:08:48,050 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-25 04:08:48,050 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-25 04:08:48,050 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-25 04:08:48,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 04:08:48,051 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-25 04:08:48,051 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-25 04:08:48,051 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-25 04:08:48,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-25 04:08:48,051 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_c4addc05-f13f-4a7d-9101-25b8c5da7ecb/bin/ukojak-verify-ENZ3QT5qd3 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak 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 -> 0176377c3fa036d8b42b70bf41d842353f196a854b997aa0bf5f176a7ad1942b [2024-11-25 04:08:48,447 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-25 04:08:48,455 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-25 04:08:48,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-25 04:08:48,460 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-25 04:08:48,460 INFO L274 PluginConnector]: CDTParser initialized [2024-11-25 04:08:48,462 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4addc05-f13f-4a7d-9101-25b8c5da7ecb/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/memsafety/test-memleak_nexttime.i [2024-11-25 04:08:51,914 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4addc05-f13f-4a7d-9101-25b8c5da7ecb/bin/ukojak-verify-ENZ3QT5qd3/data/cb31f319a/82826da03ab74ca4a6213f36605f1f19/FLAG55fb97ddf [2024-11-25 04:08:52,357 INFO L384 CDTParser]: Found 1 translation units. [2024-11-25 04:08:52,357 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4addc05-f13f-4a7d-9101-25b8c5da7ecb/sv-benchmarks/c/memsafety/test-memleak_nexttime.i [2024-11-25 04:08:52,378 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4addc05-f13f-4a7d-9101-25b8c5da7ecb/bin/ukojak-verify-ENZ3QT5qd3/data/cb31f319a/82826da03ab74ca4a6213f36605f1f19/FLAG55fb97ddf [2024-11-25 04:08:52,395 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4addc05-f13f-4a7d-9101-25b8c5da7ecb/bin/ukojak-verify-ENZ3QT5qd3/data/cb31f319a/82826da03ab74ca4a6213f36605f1f19 [2024-11-25 04:08:52,398 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-25 04:08:52,399 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-25 04:08:52,401 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-25 04:08:52,401 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-25 04:08:52,406 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-25 04:08:52,407 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:08:52" (1/1) ... [2024-11-25 04:08:52,409 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46dab861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:08:52, skipping insertion in model container [2024-11-25 04:08:52,409 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:08:52" (1/1) ... [2024-11-25 04:08:52,440 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-25 04:08:52,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 04:08:52,764 INFO L200 MainTranslator]: Completed pre-run [2024-11-25 04:08:52,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 04:08:52,846 INFO L204 MainTranslator]: Completed translation [2024-11-25 04:08:52,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:08:52 WrapperNode [2024-11-25 04:08:52,847 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-25 04:08:52,848 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-25 04:08:52,848 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-25 04:08:52,848 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-25 04:08:52,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:08:52" (1/1) ... [2024-11-25 04:08:52,873 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:08:52" (1/1) ... [2024-11-25 04:08:52,912 INFO L138 Inliner]: procedures = 181, calls = 26, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 54 [2024-11-25 04:08:52,913 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-25 04:08:52,913 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-25 04:08:52,914 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-25 04:08:52,914 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-25 04:08:52,922 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:08:52" (1/1) ... [2024-11-25 04:08:52,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:08:52" (1/1) ... [2024-11-25 04:08:52,928 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:08:52" (1/1) ... [2024-11-25 04:08:52,931 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:08:52" (1/1) ... [2024-11-25 04:08:52,946 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:08:52" (1/1) ... [2024-11-25 04:08:52,946 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:08:52" (1/1) ... [2024-11-25 04:08:52,950 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:08:52" (1/1) ... [2024-11-25 04:08:52,951 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:08:52" (1/1) ... [2024-11-25 04:08:52,952 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:08:52" (1/1) ... [2024-11-25 04:08:52,955 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-25 04:08:52,956 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-25 04:08:52,956 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-25 04:08:52,957 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-25 04:08:52,958 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:08:52" (1/1) ... [2024-11-25 04:08:52,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 04:08:52,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4addc05-f13f-4a7d-9101-25b8c5da7ecb/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-25 04:08:52,996 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4addc05-f13f-4a7d-9101-25b8c5da7ecb/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-25 04:08:53,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4addc05-f13f-4a7d-9101-25b8c5da7ecb/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-25 04:08:53,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-25 04:08:53,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2024-11-25 04:08:53,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2024-11-25 04:08:53,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-25 04:08:53,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-25 04:08:53,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-25 04:08:53,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-25 04:08:53,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-25 04:08:53,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-25 04:08:53,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-25 04:08:53,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2024-11-25 04:08:53,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-25 04:08:53,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-25 04:08:53,205 INFO L234 CfgBuilder]: Building ICFG [2024-11-25 04:08:53,208 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-25 04:08:53,596 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-25 04:08:53,597 INFO L283 CfgBuilder]: Performing block encoding [2024-11-25 04:08:53,668 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-25 04:08:53,670 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-25 04:08:53,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:08:53 BoogieIcfgContainer [2024-11-25 04:08:53,671 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-25 04:08:53,673 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-25 04:08:53,673 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-25 04:08:53,688 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-25 04:08:53,688 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:08:53" (1/1) ... [2024-11-25 04:08:53,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-25 04:08:53,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:08:53,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 33 states and 36 transitions. [2024-11-25 04:08:53,774 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2024-11-25 04:08:53,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-25 04:08:53,777 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:08:53,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:08:53,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:08:54,281 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-25 04:08:54,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:08:54,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 32 states and 35 transitions. [2024-11-25 04:08:54,332 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2024-11-25 04:08:54,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-25 04:08:54,333 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:08:54,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:08:54,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:08:54,470 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-25 04:08:54,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:08:54,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 31 states and 34 transitions. [2024-11-25 04:08:54,595 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2024-11-25 04:08:54,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-25 04:08:54,596 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:08:54,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:08:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:08:54,993 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-25 04:08:55,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:08:55,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 30 states and 33 transitions. [2024-11-25 04:08:55,441 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-11-25 04:08:55,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-25 04:08:55,442 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:08:55,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:08:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:08:55,731 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-25 04:08:56,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:08:56,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 29 states and 32 transitions. [2024-11-25 04:08:56,504 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2024-11-25 04:08:56,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-25 04:08:56,504 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:08:56,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:08:56,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:08:56,638 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-25 04:08:56,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:08:56,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 28 states and 31 transitions. [2024-11-25 04:08:56,663 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2024-11-25 04:08:56,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-25 04:08:56,663 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:08:56,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:08:56,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:08:57,057 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-25 04:08:58,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:08:58,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 27 states and 30 transitions. [2024-11-25 04:08:58,075 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2024-11-25 04:08:58,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-25 04:08:58,076 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:08:58,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:08:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:08:58,320 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-25 04:08:58,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:08:58,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 26 states and 29 transitions. [2024-11-25 04:08:58,736 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-11-25 04:08:58,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-25 04:08:58,736 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:08:58,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:08:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:08:59,182 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-25 04:09:01,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:09:01,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 25 states and 28 transitions. [2024-11-25 04:09:01,555 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2024-11-25 04:09:01,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-25 04:09:01,555 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:09:01,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:09:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:09:01,816 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-25 04:09:03,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:09:03,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 24 states and 27 transitions. [2024-11-25 04:09:03,086 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-11-25 04:09:03,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-25 04:09:03,087 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:09:03,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:09:03,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:09:03,242 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-25 04:09:04,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:09:04,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 23 states and 26 transitions. [2024-11-25 04:09:04,924 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2024-11-25 04:09:04,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-25 04:09:04,925 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:09:04,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:09:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:09:05,195 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-25 04:09:05,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:09:05,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 24 states and 27 transitions. [2024-11-25 04:09:05,696 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-11-25 04:09:05,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-25 04:09:05,697 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:09:05,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:09:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:09:05,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:09:06,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:09:06,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 25 states and 28 transitions. [2024-11-25 04:09:06,577 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2024-11-25 04:09:06,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-25 04:09:06,577 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:09:06,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:09:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:09:06,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:09:07,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:09:07,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 26 states and 29 transitions. [2024-11-25 04:09:07,575 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-11-25 04:09:07,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 04:09:07,576 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:09:07,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:09:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:09:08,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:09:08,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:09:08,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 27 states and 30 transitions. [2024-11-25 04:09:08,769 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2024-11-25 04:09:08,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-25 04:09:08,770 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:09:08,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:09:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:09:09,082 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 04:09:10,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:09:10,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 28 states and 31 transitions. [2024-11-25 04:09:10,039 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2024-11-25 04:09:10,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-25 04:09:10,040 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:09:10,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:09:10,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:09:10,188 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-25 04:09:10,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:09:10,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 29 states and 32 transitions. [2024-11-25 04:09:10,591 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2024-11-25 04:09:10,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-25 04:09:10,591 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:09:10,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:09:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:09:10,844 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-25 04:09:11,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:09:11,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 30 states and 33 transitions. [2024-11-25 04:09:11,296 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-11-25 04:09:11,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-25 04:09:11,296 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:09:11,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:09:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:09:11,505 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-25 04:09:11,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:09:11,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 31 states and 34 transitions. [2024-11-25 04:09:11,998 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2024-11-25 04:09:11,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-25 04:09:11,999 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:09:11,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:09:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:09:12,261 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-25 04:09:12,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:09:12,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 32 states and 35 transitions. [2024-11-25 04:09:12,745 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2024-11-25 04:09:12,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-25 04:09:12,745 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:09:12,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:09:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:09:12,922 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-25 04:09:13,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:09:13,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 33 states and 36 transitions. [2024-11-25 04:09:13,688 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2024-11-25 04:09:13,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-25 04:09:13,689 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:09:13,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:09:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:09:16,312 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-25 04:09:29,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:09:29,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 47 states and 59 transitions. [2024-11-25 04:09:29,246 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2024-11-25 04:09:29,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-25 04:09:29,248 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:09:29,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:09:29,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:09:33,230 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-25 04:09:53,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:09:53,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 62 states and 89 transitions. [2024-11-25 04:09:53,423 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 89 transitions. [2024-11-25 04:09:53,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-25 04:09:53,424 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:09:53,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:09:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:09:53,843 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-25 04:09:55,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:09:55,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 63 states and 91 transitions. [2024-11-25 04:09:55,278 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 91 transitions. [2024-11-25 04:09:55,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-25 04:09:55,279 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:09:55,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:09:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:09:55,425 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-25 04:09:56,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:09:56,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 31 states and 32 transitions. [2024-11-25 04:09:56,587 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2024-11-25 04:09:56,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-25 04:09:56,588 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:09:56,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:09:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:10:01,762 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-25 04:10:31,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:10:31,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 30 states and 31 transitions. [2024-11-25 04:10:31,177 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2024-11-25 04:10:31,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-25 04:10:31,177 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:10:31,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:10:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:10:39,015 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-25 04:11:24,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:11:24,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 29 states and 30 transitions. [2024-11-25 04:11:24,308 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2024-11-25 04:11:24,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-25 04:11:24,308 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 27 iterations. [2024-11-25 04:11:24,319 INFO L726 CodeCheckObserver]: All specifications hold 14 specifications checked. All of them hold [2024-11-25 04:11:28,268 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK(lines 646 652) no Hoare annotation was computed. [2024-11-25 04:11:28,268 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:11:28,268 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:11:28,268 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:11:28,269 INFO L77 FloydHoareUtils]: At program point L651(line 651) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#p~1#1.base|) |ULTIMATE.start_main_~#p~1#1.offset|))) (and (not (= .cse0 |ULTIMATE.start_main_~#p~1#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p~1#1.base|) |ULTIMATE.start_main_~#p~1#1.offset|) 0) (= |ULTIMATE.start_main_~#p~1#1.offset| 0) (= (select |#valid| .cse0) 1) (= (select |#length| |ULTIMATE.start_main_~#p~1#1.base|) 4) (= (store (store |#valid| .cse0 0) |ULTIMATE.start_main_~#p~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= (select |#valid| |ULTIMATE.start_main_~#p~1#1.base|) 1) (< .cse0 |#StackHeapBarrier|))) [2024-11-25 04:11:28,269 INFO L77 FloydHoareUtils]: At program point L651-1(line 651) the Hoare annotation is: (and (not (= |ULTIMATE.start_main_#t~mem6#1.base| |ULTIMATE.start_main_~#p~1#1.base|)) (<= (+ |ULTIMATE.start_main_#t~mem6#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_main_#t~mem6#1.base|) 1) (= |ULTIMATE.start_main_#t~mem6#1.offset| 0) (= |ULTIMATE.start_main_old_#valid#1| (store (store |#valid| |ULTIMATE.start_main_#t~mem6#1.base| 0) |ULTIMATE.start_main_~#p~1#1.base| 0))) [2024-11-25 04:11:28,269 INFO L77 FloydHoareUtils]: At program point L651-2(line 651) the Hoare annotation is: (and (not (= |ULTIMATE.start_main_#t~mem6#1.base| |ULTIMATE.start_main_~#p~1#1.base|)) (<= (+ |ULTIMATE.start_main_#t~mem6#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_main_#t~mem6#1.base|) 1) (= |ULTIMATE.start_main_old_#valid#1| (store (store |#valid| |ULTIMATE.start_main_#t~mem6#1.base| 0) |ULTIMATE.start_main_~#p~1#1.base| 0))) [2024-11-25 04:11:28,269 INFO L77 FloydHoareUtils]: At program point L651-3(line 651) the Hoare annotation is: (and (not (= |ULTIMATE.start_main_#t~mem6#1.base| |ULTIMATE.start_main_~#p~1#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~mem6#1.base|) 1) (= |ULTIMATE.start_main_old_#valid#1| (store (store |#valid| |ULTIMATE.start_main_#t~mem6#1.base| 0) |ULTIMATE.start_main_~#p~1#1.base| 0))) [2024-11-25 04:11:28,270 INFO L77 FloydHoareUtils]: At program point L-1-1(line -1) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_foo_~#p~0#1.base|) 0))) (and (= |ULTIMATE.start_#Ultimate.C_memcpy_size#1| 4) (= (select |#valid| .cse0) 1) (not (= |ULTIMATE.start_foo_~#p~0#1.base| .cse0)) (<= (+ .cse0 1) |#StackHeapBarrier|) (<= 4 (select |#length| |ULTIMATE.start_#Ultimate.C_memcpy_src#1.base|)) (= (select |#valid| |ULTIMATE.start_#Ultimate.C_memcpy_src#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start_foo_~#p~0#1.base| 0) .cse0 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start_foo_~#p~0#1.base| |ULTIMATE.start_#Ultimate.C_memcpy_src#1.base|) (let ((.cse1 (select |#length| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|))) (or (= .cse1 10) (= .cse1 4))) (= 3 |~#a~0.base|) (= |ULTIMATE.start_#Ultimate.C_memcpy_src#1.offset| 0) (= |~#a~0.offset| 0) (= 1 (select |#valid| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|)) (not (= |ULTIMATE.start_foo_~#p~0#1.base| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|)) (= |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.offset| 0) (= 3 |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_foo_~#p~0#1.base|) 0) 0))) [2024-11-25 04:11:28,270 INFO L77 FloydHoareUtils]: At program point L-1-2(line -1) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_foo_~#p~0#1.base|) 0))) (and (= |ULTIMATE.start_#Ultimate.C_memcpy_size#1| 4) (= (select |#valid| .cse0) 1) (not (= |ULTIMATE.start_foo_~#p~0#1.base| .cse0)) (<= (+ .cse0 1) |#StackHeapBarrier|) (<= 4 (select |#length| |ULTIMATE.start_#Ultimate.C_memcpy_src#1.base|)) (= (select |#valid| |ULTIMATE.start_#Ultimate.C_memcpy_src#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start_foo_~#p~0#1.base| 0) .cse0 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start_foo_~#p~0#1.base| |ULTIMATE.start_#Ultimate.C_memcpy_src#1.base|) (let ((.cse1 (select |#length| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|))) (or (= .cse1 10) (= .cse1 4))) (= 3 |~#a~0.base|) (= |ULTIMATE.start_#Ultimate.C_memcpy_src#1.offset| 0) (= |~#a~0.offset| 0) (= 1 (select |#valid| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|)) (not (= |ULTIMATE.start_foo_~#p~0#1.base| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|)) (= |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.offset| 0) (= 3 |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_foo_~#p~0#1.base|) 0) 0))) [2024-11-25 04:11:28,270 INFO L77 FloydHoareUtils]: At program point L-1-3(line -1) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_foo_~#p~0#1.base|) 0))) (and (= |ULTIMATE.start_#Ultimate.C_memcpy_size#1| 4) (= (select |#valid| .cse0) 1) (not (= |ULTIMATE.start_foo_~#p~0#1.base| .cse0)) (<= (+ .cse0 1) |#StackHeapBarrier|) (<= 4 (select |#length| |ULTIMATE.start_#Ultimate.C_memcpy_src#1.base|)) (= (store (store |#valid| |ULTIMATE.start_foo_~#p~0#1.base| 0) .cse0 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start_foo_~#p~0#1.base| |ULTIMATE.start_#Ultimate.C_memcpy_src#1.base|) (let ((.cse1 (select |#length| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|))) (or (= .cse1 10) (= .cse1 4))) (= 3 |~#a~0.base|) (= |ULTIMATE.start_#Ultimate.C_memcpy_src#1.offset| 0) (= |~#a~0.offset| 0) (= 1 (select |#valid| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|)) (not (= |ULTIMATE.start_foo_~#p~0#1.base| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|)) (= |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.offset| 0) (= 3 |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_foo_~#p~0#1.base|) 0) 0))) [2024-11-25 04:11:28,271 INFO L77 FloydHoareUtils]: At program point L-1-4(line -1) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_foo_~#p~0#1.base|) 0))) (and (= |ULTIMATE.start_#Ultimate.C_memcpy_size#1| 4) (= (select |#valid| .cse0) 1) (not (= |ULTIMATE.start_foo_~#p~0#1.base| .cse0)) (<= (+ .cse0 1) |#StackHeapBarrier|) (<= 4 (select |#length| |ULTIMATE.start_#Ultimate.C_memcpy_src#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|)) (= (store (store |#valid| |ULTIMATE.start_foo_~#p~0#1.base| 0) .cse0 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start_foo_~#p~0#1.base| |ULTIMATE.start_#Ultimate.C_memcpy_src#1.base|) (= 3 |~#a~0.base|) (= |ULTIMATE.start_#Ultimate.C_memcpy_src#1.offset| 0) (= |~#a~0.offset| 0) (= 1 (select |#valid| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|)) (not (= |ULTIMATE.start_foo_~#p~0#1.base| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|)) (= |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.offset| 0) (= 3 |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_foo_~#p~0#1.base|) 0) 0))) [2024-11-25 04:11:28,271 INFO L77 FloydHoareUtils]: At program point L-1-6(line -1) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_#Ultimate.C_memcpy_size#1| 4)) (.cse3 (<= 4 (select |#length| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|))) (.cse1 (store |#valid| |ULTIMATE.start_foo_~#p~0#1.base| 0)) (.cse4 (= 3 |~#a~0.base|)) (.cse5 (= |ULTIMATE.start_#Ultimate.C_memcpy_src#1.offset| 0)) (.cse6 (= |~#a~0.offset| 0)) (.cse7 (= 1 (select |#valid| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|))) (.cse8 (not (= |ULTIMATE.start_foo_~#p~0#1.base| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|))) (.cse9 (= |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.offset| 0)) (.cse10 (= 3 |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|))) (or (let ((.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.C_memcpy_src#1.base|) 0))) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memcpy_src#1.base|) 0) 0) .cse0 (= (store .cse1 .cse2 0) |ULTIMATE.start_main_old_#valid#1|) .cse3 (not (= |ULTIMATE.start_foo_~#p~0#1.base| .cse2)) .cse4 (not (and (<= |ULTIMATE.start_#Ultimate.C_memcpy_#t~loopctr8#1| 3) (<= 0 (div |ULTIMATE.start_#Ultimate.C_memcpy_#t~loopctr8#1| 4294967296)))) .cse5 .cse6 .cse7 (= (select |#valid| .cse2) 1) .cse8 (<= (+ .cse2 1) |#StackHeapBarrier|) .cse9 .cse10)) (let ((.cse11 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_foo_~#p~0#1.base|) 0))) (and .cse0 (= (select |#valid| .cse11) 1) (not (= |ULTIMATE.start_foo_~#p~0#1.base| .cse11)) (<= (+ .cse11 1) |#StackHeapBarrier|) .cse3 (= (store .cse1 .cse11 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start_foo_~#p~0#1.base| |ULTIMATE.start_#Ultimate.C_memcpy_src#1.base|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_foo_~#p~0#1.base|) 0) 0))))) [2024-11-25 04:11:28,271 INFO L77 FloydHoareUtils]: At program point L-1-8(line -1) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_#Ultimate.C_memcpy_size#1| 4)) (.cse1 (store |#valid| |ULTIMATE.start_foo_~#p~0#1.base| 0)) (.cse3 (<= 4 (select |#length| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|))) (.cse4 (= 3 |~#a~0.base|)) (.cse5 (= |~#a~0.offset| 0)) (.cse6 (= 1 (select |#valid| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|))) (.cse7 (not (= |ULTIMATE.start_foo_~#p~0#1.base| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|))) (.cse8 (= 3 |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|))) (or (let ((.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.C_memcpy_src#1.base|) 0))) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memcpy_src#1.base|) 0) 0) .cse0 (= (store .cse1 .cse2 0) |ULTIMATE.start_main_old_#valid#1|) .cse3 (not (= |ULTIMATE.start_foo_~#p~0#1.base| .cse2)) (= |ULTIMATE.start_#Ultimate.C_memcpy_#t~loopctr10#1| 0) .cse4 (= |ULTIMATE.start_#Ultimate.C_memcpy_src#1.offset| 0) .cse5 .cse6 (= (select |#valid| .cse2) 1) .cse7 (<= (+ .cse2 1) |#StackHeapBarrier|) (= |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.offset| 0) .cse8)) (let ((.cse9 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|) 0))) (and .cse0 (<= 4 |ULTIMATE.start_#Ultimate.C_memcpy_#t~loopctr10#1|) (= (store .cse1 .cse9 0) |ULTIMATE.start_main_old_#valid#1|) (= (select |#valid| .cse9) 1) .cse3 .cse4 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|) 0) 0) (<= |ULTIMATE.start_#Ultimate.C_memcpy_#t~loopctr10#1| 4294967295) .cse5 .cse6 (not (= |ULTIMATE.start_foo_~#p~0#1.base| .cse9)) .cse7 (<= (+ (select (select |#memory_$Pointer$.base| 3) 0) 1) |#StackHeapBarrier|) .cse8)))) [2024-11-25 04:11:28,272 INFO L77 FloydHoareUtils]: At program point L-1-10(line -1) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.C_memcpy_src#1.base|) 0))) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memcpy_src#1.base|) 0) 0) (= |ULTIMATE.start_#Ultimate.C_memcpy_size#1| 4) (= |ULTIMATE.start_main_~#p~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_#Ultimate.C_memcpy_src#1.base|) 1) (not (= |ULTIMATE.start_#Ultimate.C_memcpy_src#1.base| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|)) (= |ULTIMATE.start_main_~#p~1#1.base| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|) (not (= |ULTIMATE.start_main_~#p~1#1.base| .cse0)) (= |ULTIMATE.start_#Ultimate.C_memcpy_src#1.offset| 0) (= (store (store |#valid| .cse0 0) |ULTIMATE.start_main_~#p~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= 1 (select |#valid| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|)) (= (select |#valid| .cse0) 1) (<= (+ .cse0 1) |#StackHeapBarrier|) (= |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.offset| 0) (<= (+ |ULTIMATE.start_#Ultimate.C_memcpy_src#1.offset| 4) (select |#length| |ULTIMATE.start_#Ultimate.C_memcpy_src#1.base|)) (= (select |#length| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|) 4))) [2024-11-25 04:11:28,272 INFO L77 FloydHoareUtils]: At program point L-1-11(line -1) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.C_memcpy_src#1.base|) 0))) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memcpy_src#1.base|) 0) 0) (= |ULTIMATE.start_#Ultimate.C_memcpy_size#1| 4) (= |ULTIMATE.start_main_~#p~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_#Ultimate.C_memcpy_src#1.base|) 1) (not (= |ULTIMATE.start_#Ultimate.C_memcpy_src#1.base| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|)) (= |ULTIMATE.start_main_~#p~1#1.base| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|) (not (= |ULTIMATE.start_main_~#p~1#1.base| .cse0)) (= |ULTIMATE.start_#Ultimate.C_memcpy_src#1.offset| 0) (= (store (store |#valid| .cse0 0) |ULTIMATE.start_main_~#p~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= 1 (select |#valid| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|)) (= (select |#valid| .cse0) 1) (<= (+ .cse0 1) |#StackHeapBarrier|) (= |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.offset| 0) (<= (+ |ULTIMATE.start_#Ultimate.C_memcpy_src#1.offset| 4) (select |#length| |ULTIMATE.start_#Ultimate.C_memcpy_src#1.base|)) (= (select |#length| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|) 4))) [2024-11-25 04:11:28,272 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:11:28,272 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:11:28,273 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:11:28,273 INFO L77 FloydHoareUtils]: At program point L-1-12(line -1) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.C_memcpy_src#1.base|) 0))) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memcpy_src#1.base|) 0) 0) (= |ULTIMATE.start_#Ultimate.C_memcpy_size#1| 4) (= |ULTIMATE.start_main_~#p~1#1.offset| 0) (not (= |ULTIMATE.start_#Ultimate.C_memcpy_src#1.base| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|)) (= |ULTIMATE.start_main_~#p~1#1.base| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|) (not (= |ULTIMATE.start_main_~#p~1#1.base| .cse0)) (= |ULTIMATE.start_#Ultimate.C_memcpy_src#1.offset| 0) (= (store (store |#valid| .cse0 0) |ULTIMATE.start_main_~#p~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= 1 (select |#valid| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|)) (= (select |#valid| .cse0) 1) (<= (+ .cse0 1) |#StackHeapBarrier|) (= |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.offset| 0) (<= (+ |ULTIMATE.start_#Ultimate.C_memcpy_src#1.offset| 4) (select |#length| |ULTIMATE.start_#Ultimate.C_memcpy_src#1.base|)) (= (select |#length| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|) 4))) [2024-11-25 04:11:28,273 INFO L77 FloydHoareUtils]: At program point L-1-13(line -1) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.C_memcpy_src#1.base|) 0))) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memcpy_src#1.base|) 0) 0) (= |ULTIMATE.start_#Ultimate.C_memcpy_size#1| 4) (= |ULTIMATE.start_main_~#p~1#1.offset| 0) (not (= |ULTIMATE.start_#Ultimate.C_memcpy_src#1.base| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|)) (= |ULTIMATE.start_main_~#p~1#1.base| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|) (not (= |ULTIMATE.start_main_~#p~1#1.base| .cse0)) (= |ULTIMATE.start_#Ultimate.C_memcpy_src#1.offset| 0) (= (store (store |#valid| .cse0 0) |ULTIMATE.start_main_~#p~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= 1 (select |#valid| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|)) (= (select |#valid| .cse0) 1) (<= (+ .cse0 1) |#StackHeapBarrier|) (= |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.offset| 0) (<= (+ |ULTIMATE.start_#Ultimate.C_memcpy_src#1.offset| 4) (select |#length| |ULTIMATE.start_#Ultimate.C_memcpy_src#1.base|)) (= (select |#length| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|) 4))) [2024-11-25 04:11:28,273 INFO L77 FloydHoareUtils]: At program point L-1-15(line -1) the Hoare annotation is: (let ((.cse12 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.C_memcpy_src#1.base|) 0))) (let ((.cse0 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memcpy_src#1.base|) 0) 0)) (.cse1 (= |ULTIMATE.start_#Ultimate.C_memcpy_size#1| 4)) (.cse2 (= |ULTIMATE.start_main_~#p~1#1.offset| 0)) (.cse3 (= (select |#length| |ULTIMATE.start_main_~#p~1#1.base|) 4)) (.cse4 (= |ULTIMATE.start_main_~#p~1#1.base| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|)) (.cse5 (not (= |ULTIMATE.start_main_~#p~1#1.base| .cse12))) (.cse6 (= |ULTIMATE.start_#Ultimate.C_memcpy_src#1.offset| 0)) (.cse7 (= (store (store |#valid| .cse12 0) |ULTIMATE.start_main_~#p~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse8 (= 1 (select |#valid| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|))) (.cse9 (= (select |#valid| .cse12) 1)) (.cse10 (<= (+ .cse12 1) |#StackHeapBarrier|)) (.cse11 (= |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.offset| 0))) (or (and .cse0 .cse1 .cse2 (not (= |ULTIMATE.start_#Ultimate.C_memcpy_src#1.base| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 (not (and (<= |ULTIMATE.start_#Ultimate.C_memcpy_#t~loopctr8#1| 3) (<= 0 (div |ULTIMATE.start_#Ultimate.C_memcpy_#t~loopctr8#1| 4294967296)))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2024-11-25 04:11:28,274 INFO L77 FloydHoareUtils]: At program point L-1-17(line -1) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_#Ultimate.C_memcpy_size#1| 4)) (.cse1 (= |ULTIMATE.start_main_~#p~1#1.offset| 0)) (.cse2 (= (select |#length| |ULTIMATE.start_main_~#p~1#1.base|) 4)) (.cse3 (= |ULTIMATE.start_main_~#p~1#1.base| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|)) (.cse5 (= 1 (select |#valid| |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.base|))) (.cse6 (= |ULTIMATE.start_#Ultimate.C_memcpy_dest#1.offset| 0))) (or (let ((.cse4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.C_memcpy_src#1.base|) 0))) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memcpy_src#1.base|) 0) 0) .cse0 .cse1 .cse2 (= |ULTIMATE.start_#Ultimate.C_memcpy_#t~loopctr10#1| 0) .cse3 (not (= |ULTIMATE.start_main_~#p~1#1.base| .cse4)) (= |ULTIMATE.start_#Ultimate.C_memcpy_src#1.offset| 0) (= (store (store |#valid| .cse4 0) |ULTIMATE.start_main_~#p~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) .cse5 (= (select |#valid| .cse4) 1) (<= (+ .cse4 1) |#StackHeapBarrier|) .cse6)) (let ((.cse7 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#p~1#1.base|) |ULTIMATE.start_main_~#p~1#1.offset|))) (and (not (= .cse7 |ULTIMATE.start_main_~#p~1#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p~1#1.base|) |ULTIMATE.start_main_~#p~1#1.offset|) 0) .cse0 .cse1 (<= 4 |ULTIMATE.start_#Ultimate.C_memcpy_#t~loopctr10#1|) (= (select |#valid| .cse7) 1) (<= (+ .cse7 1) |#StackHeapBarrier|) .cse2 (= (store (store |#valid| .cse7 0) |ULTIMATE.start_main_~#p~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) .cse3 (<= |ULTIMATE.start_#Ultimate.C_memcpy_#t~loopctr10#1| 4294967295) .cse5 .cse6)))) [2024-11-25 04:11:28,274 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE(line 651) no Hoare annotation was computed. [2024-11-25 04:11:28,274 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-25 04:11:28,274 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:11:28,274 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:11:28,274 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE(line 651) no Hoare annotation was computed. [2024-11-25 04:11:28,275 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-25 04:11:28,275 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:11:28,275 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:11:28,275 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE(line 651) no Hoare annotation was computed. [2024-11-25 04:11:28,275 INFO L77 FloydHoareUtils]: At program point L646(lines 646 652) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-25 04:11:28,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 25.11 04:11:28 ImpRootNode [2024-11-25 04:11:28,293 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-25 04:11:28,294 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-25 04:11:28,294 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-25 04:11:28,294 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-25 04:11:28,295 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:08:53" (3/4) ... [2024-11-25 04:11:28,299 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-25 04:11:28,306 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 41 nodes and edges [2024-11-25 04:11:28,307 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-25 04:11:28,307 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-25 04:11:28,307 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-25 04:11:28,379 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4addc05-f13f-4a7d-9101-25b8c5da7ecb/bin/ukojak-verify-ENZ3QT5qd3/witness.graphml [2024-11-25 04:11:28,379 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4addc05-f13f-4a7d-9101-25b8c5da7ecb/bin/ukojak-verify-ENZ3QT5qd3/witness.yml [2024-11-25 04:11:28,380 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-25 04:11:28,381 INFO L158 Benchmark]: Toolchain (without parser) took 155981.42ms. Allocated memory was 117.4MB in the beginning and 822.1MB in the end (delta: 704.6MB). Free memory was 92.2MB in the beginning and 352.9MB in the end (delta: -260.7MB). Peak memory consumption was 443.7MB. Max. memory is 16.1GB. [2024-11-25 04:11:28,381 INFO L158 Benchmark]: CDTParser took 0.56ms. Allocated memory is still 167.8MB. Free memory is still 102.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 04:11:28,382 INFO L158 Benchmark]: CACSL2BoogieTranslator took 446.66ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 72.1MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-25 04:11:28,382 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.81ms. Allocated memory is still 117.4MB. Free memory was 72.1MB in the beginning and 70.4MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 04:11:28,383 INFO L158 Benchmark]: Boogie Preprocessor took 42.00ms. Allocated memory is still 117.4MB. Free memory was 70.4MB in the beginning and 69.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 04:11:28,383 INFO L158 Benchmark]: RCFGBuilder took 714.80ms. Allocated memory is still 117.4MB. Free memory was 69.3MB in the beginning and 51.8MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-25 04:11:28,384 INFO L158 Benchmark]: CodeCheck took 154620.91ms. Allocated memory was 117.4MB in the beginning and 822.1MB in the end (delta: 704.6MB). Free memory was 51.8MB in the beginning and 357.3MB in the end (delta: -305.5MB). Peak memory consumption was 393.4MB. Max. memory is 16.1GB. [2024-11-25 04:11:28,384 INFO L158 Benchmark]: Witness Printer took 85.77ms. Allocated memory is still 822.1MB. Free memory was 357.3MB in the beginning and 352.9MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 04:11:28,386 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 33 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 150.6s, OverallIterations: 27, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2328 SdHoareTripleChecker+Valid, 19.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1974 mSDsluCounter, 398 SdHoareTripleChecker+Invalid, 17.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 222 mSDsCounter, 1753 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6947 IncrementalHoareTripleChecker+Invalid, 8700 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1753 mSolverCounterUnsat, 176 mSDtfsCounter, 6947 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3670 GetRequests, 2984 SyntacticMatches, 28 SemanticMatches, 658 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221613 ImplicationChecksByTransitivity, 136.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 24.6s InterpolantComputationTime, 433 NumberOfCodeBlocks, 433 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 407 ConstructedInterpolants, 0 QuantifiedInterpolants, 4312 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 12 PerfectInterpolantSequences, 152/231 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 651]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 651]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 646]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.56ms. Allocated memory is still 167.8MB. Free memory is still 102.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 446.66ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 72.1MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.81ms. Allocated memory is still 117.4MB. Free memory was 72.1MB in the beginning and 70.4MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.00ms. Allocated memory is still 117.4MB. Free memory was 70.4MB in the beginning and 69.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 714.80ms. Allocated memory is still 117.4MB. Free memory was 69.3MB in the beginning and 51.8MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * CodeCheck took 154620.91ms. Allocated memory was 117.4MB in the beginning and 822.1MB in the end (delta: 704.6MB). Free memory was 51.8MB in the beginning and 357.3MB in the end (delta: -305.5MB). Peak memory consumption was 393.4MB. Max. memory is 16.1GB. * Witness Printer took 85.77ms. Allocated memory is still 822.1MB. Free memory was 357.3MB in the beginning and 352.9MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-25 04:11:28,415 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4addc05-f13f-4a7d-9101-25b8c5da7ecb/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE