./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-regression/test22-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd52093e-ec31-405b-8091-f2a69d5564a0/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd52093e-ec31-405b-8091-f2a69d5564a0/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd52093e-ec31-405b-8091-f2a69d5564a0/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd52093e-ec31-405b-8091-f2a69d5564a0/bin/ukojak-verify-ImItNfHLgk/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-regression/test22-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd52093e-ec31-405b-8091-f2a69d5564a0/bin/ukojak-verify-ImItNfHLgk/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd52093e-ec31-405b-8091-f2a69d5564a0/bin/ukojak-verify-ImItNfHLgk --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 e1ce1c36cc17bb5fac8e93fbe54fbc2a77334d62ad40c06c722f9da96af2516f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 00:40:16,212 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:40:16,303 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd52093e-ec31-405b-8091-f2a69d5564a0/bin/ukojak-verify-ImItNfHLgk/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf [2024-11-09 00:40:16,307 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:40:16,308 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-09 00:40:16,331 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:40:16,332 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:40:16,332 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:40:16,333 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:40:16,333 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:40:16,333 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:40:16,334 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:40:16,334 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:40:16,335 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 00:40:16,335 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 00:40:16,335 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 00:40:16,336 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:40:16,336 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:40:16,340 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 00:40:16,340 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:40:16,340 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:40:16,343 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-09 00:40:16,343 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-09 00:40:16,343 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-09 00:40:16,344 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:40:16,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:40:16,345 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:40:16,345 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:40:16,345 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-09 00:40:16,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:40:16,346 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd52093e-ec31-405b-8091-f2a69d5564a0/bin/ukojak-verify-ImItNfHLgk/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd52093e-ec31-405b-8091-f2a69d5564a0/bin/ukojak-verify-ImItNfHLgk 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 -> e1ce1c36cc17bb5fac8e93fbe54fbc2a77334d62ad40c06c722f9da96af2516f [2024-11-09 00:40:16,608 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:40:16,640 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:40:16,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:40:16,646 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:40:16,647 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:40:16,648 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd52093e-ec31-405b-8091-f2a69d5564a0/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/ldv-regression/test22-1.c Unable to find full path for "g++" [2024-11-09 00:40:18,779 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:40:18,976 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:40:18,977 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd52093e-ec31-405b-8091-f2a69d5564a0/sv-benchmarks/c/ldv-regression/test22-1.c [2024-11-09 00:40:18,985 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd52093e-ec31-405b-8091-f2a69d5564a0/bin/ukojak-verify-ImItNfHLgk/data/61788dff4/4f053e04f1324e6fab135424c51e8a3f/FLAG1a7351675 [2024-11-09 00:40:19,002 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd52093e-ec31-405b-8091-f2a69d5564a0/bin/ukojak-verify-ImItNfHLgk/data/61788dff4/4f053e04f1324e6fab135424c51e8a3f [2024-11-09 00:40:19,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:40:19,007 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:40:19,009 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:40:19,009 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:40:19,014 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:40:19,015 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:40:19" (1/1) ... [2024-11-09 00:40:19,016 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48ce674f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:40:19, skipping insertion in model container [2024-11-09 00:40:19,017 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:40:19" (1/1) ... [2024-11-09 00:40:19,043 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:40:19,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:40:19,372 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:40:19,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:40:19,420 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:40:19,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:40:19 WrapperNode [2024-11-09 00:40:19,421 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:40:19,422 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:40:19,422 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:40:19,423 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:40:19,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:40:19" (1/1) ... [2024-11-09 00:40:19,441 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:40:19" (1/1) ... [2024-11-09 00:40:19,467 INFO L138 Inliner]: procedures = 16, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 109 [2024-11-09 00:40:19,468 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:40:19,469 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:40:19,469 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:40:19,469 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:40:19,488 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:40:19" (1/1) ... [2024-11-09 00:40:19,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:40:19" (1/1) ... [2024-11-09 00:40:19,495 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:40:19" (1/1) ... [2024-11-09 00:40:19,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:40:19" (1/1) ... [2024-11-09 00:40:19,511 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:40:19" (1/1) ... [2024-11-09 00:40:19,517 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:40:19" (1/1) ... [2024-11-09 00:40:19,524 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:40:19" (1/1) ... [2024-11-09 00:40:19,525 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:40:19" (1/1) ... [2024-11-09 00:40:19,532 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:40:19,533 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:40:19,533 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:40:19,533 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:40:19,538 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:40:19" (1/1) ... [2024-11-09 00:40:19,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:40:19,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd52093e-ec31-405b-8091-f2a69d5564a0/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-09 00:40:19,580 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd52093e-ec31-405b-8091-f2a69d5564a0/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-09 00:40:19,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd52093e-ec31-405b-8091-f2a69d5564a0/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-09 00:40:19,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:40:19,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 00:40:19,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 00:40:19,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:40:19,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:40:19,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 00:40:19,697 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:40:19,701 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:40:20,017 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-11-09 00:40:20,017 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:40:20,157 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:40:20,157 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:40:20,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:40:20 BoogieIcfgContainer [2024-11-09 00:40:20,158 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:40:20,159 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-09 00:40:20,160 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-09 00:40:20,173 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-09 00:40:20,173 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:40:20" (1/1) ... [2024-11-09 00:40:20,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:40:20,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:20,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 36 states and 40 transitions. [2024-11-09 00:40:20,246 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2024-11-09 00:40:20,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-09 00:40:20,249 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:20,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:20,579 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-09 00:40:20,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:20,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 35 states and 39 transitions. [2024-11-09 00:40:20,644 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-11-09 00:40:20,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-09 00:40:20,645 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:20,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:20,826 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-09 00:40:20,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:20,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 34 states and 38 transitions. [2024-11-09 00:40:20,983 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2024-11-09 00:40:20,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 00:40:20,984 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:20,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:21,054 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-09 00:40:21,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:21,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 33 states and 37 transitions. [2024-11-09 00:40:21,098 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-11-09 00:40:21,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 00:40:21,099 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:21,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:21,254 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-09 00:40:21,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:21,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 32 states and 36 transitions. [2024-11-09 00:40:21,365 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-11-09 00:40:21,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 00:40:21,365 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:21,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:21,462 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-09 00:40:21,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:21,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 31 states and 35 transitions. [2024-11-09 00:40:21,815 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-11-09 00:40:21,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 00:40:21,815 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:21,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:21,995 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-09 00:40:22,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:22,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 30 states and 34 transitions. [2024-11-09 00:40:22,548 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2024-11-09 00:40:22,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 00:40:22,549 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:22,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:22,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:22,623 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-09 00:40:22,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:22,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 29 states and 33 transitions. [2024-11-09 00:40:22,678 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-11-09 00:40:22,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 00:40:22,679 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:22,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:22,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:22,789 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-09 00:40:22,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:22,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 28 states and 32 transitions. [2024-11-09 00:40:22,965 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-11-09 00:40:22,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 00:40:22,966 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:22,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:23,634 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-09 00:40:24,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:24,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 27 states and 31 transitions. [2024-11-09 00:40:24,827 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-11-09 00:40:24,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 00:40:24,828 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:24,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:25,099 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-09 00:40:25,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:25,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 26 states and 30 transitions. [2024-11-09 00:40:25,921 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2024-11-09 00:40:25,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 00:40:25,925 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:25,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:26,028 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-09 00:40:26,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:26,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 27 states and 31 transitions. [2024-11-09 00:40:26,105 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-11-09 00:40:26,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 00:40:26,106 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:26,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:26,209 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-09 00:40:27,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:27,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 30 states and 34 transitions. [2024-11-09 00:40:27,618 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2024-11-09 00:40:27,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 00:40:27,619 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:27,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:27,654 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-09 00:40:27,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:27,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 29 states and 33 transitions. [2024-11-09 00:40:27,818 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-11-09 00:40:27,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 00:40:27,818 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:27,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:27,947 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-09 00:40:28,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:28,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 28 states and 32 transitions. [2024-11-09 00:40:28,621 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-11-09 00:40:28,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 00:40:28,622 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:28,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:28,668 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-09 00:40:28,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:28,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 27 states and 30 transitions. [2024-11-09 00:40:28,947 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2024-11-09 00:40:28,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 00:40:28,948 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:28,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:28,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:29,407 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-09 00:40:31,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:31,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 28 states and 31 transitions. [2024-11-09 00:40:31,280 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2024-11-09 00:40:31,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 00:40:31,281 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:31,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:32,014 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-09 00:40:34,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:34,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 29 states and 32 transitions. [2024-11-09 00:40:34,312 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2024-11-09 00:40:34,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 00:40:34,312 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:34,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:34,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:40:34,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:34,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 28 states and 30 transitions. [2024-11-09 00:40:34,382 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2024-11-09 00:40:34,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 00:40:34,384 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:34,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:34,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:40:34,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:34,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 25 states and 27 transitions. [2024-11-09 00:40:34,613 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2024-11-09 00:40:34,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 00:40:34,617 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:34,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:34,784 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-09 00:40:35,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:35,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 24 states and 26 transitions. [2024-11-09 00:40:35,307 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2024-11-09 00:40:35,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 00:40:35,307 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:35,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:35,813 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-09 00:40:37,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:37,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 26 states and 31 transitions. [2024-11-09 00:40:37,096 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2024-11-09 00:40:37,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 00:40:37,096 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:37,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:37,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:40:39,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:39,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 29 states and 40 transitions. [2024-11-09 00:40:39,704 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2024-11-09 00:40:39,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 00:40:39,705 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:39,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:40,276 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-09 00:40:42,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:42,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 31 states and 47 transitions. [2024-11-09 00:40:42,139 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 47 transitions. [2024-11-09 00:40:42,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 00:40:42,140 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:42,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:42,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:42,420 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-09 00:40:42,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:42,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 31 states and 46 transitions. [2024-11-09 00:40:42,979 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 46 transitions. [2024-11-09 00:40:42,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 00:40:42,980 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:42,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:42,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:43,572 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:40:45,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:45,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 33 states and 53 transitions. [2024-11-09 00:40:45,518 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 53 transitions. [2024-11-09 00:40:45,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 00:40:45,518 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:45,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:45,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:46,112 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:40:48,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:48,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 35 states and 61 transitions. [2024-11-09 00:40:48,170 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 61 transitions. [2024-11-09 00:40:48,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 00:40:48,171 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:48,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:48,854 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:40:51,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:51,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 37 states and 70 transitions. [2024-11-09 00:40:51,193 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 70 transitions. [2024-11-09 00:40:51,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 00:40:51,193 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:51,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:51,918 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:40:54,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:54,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 39 states and 80 transitions. [2024-11-09 00:40:54,420 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 80 transitions. [2024-11-09 00:40:54,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 00:40:54,421 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:54,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:55,120 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:40:57,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:57,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 41 states and 91 transitions. [2024-11-09 00:40:57,609 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 91 transitions. [2024-11-09 00:40:57,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 00:40:57,610 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:57,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:58,414 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:41:01,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:01,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 43 states and 103 transitions. [2024-11-09 00:41:01,245 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 103 transitions. [2024-11-09 00:41:01,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 00:41:01,247 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:01,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:02,003 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:41:04,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:04,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 45 states and 105 transitions. [2024-11-09 00:41:04,910 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 105 transitions. [2024-11-09 00:41:04,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 00:41:04,911 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:04,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:05,871 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 00:41:27,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:27,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 68 states and 177 transitions. [2024-11-09 00:41:27,835 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 177 transitions. [2024-11-09 00:41:27,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 00:41:27,836 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:27,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:27,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:28,067 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 00:41:29,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:29,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 44 states and 104 transitions. [2024-11-09 00:41:29,146 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 104 transitions. [2024-11-09 00:41:29,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 00:41:29,147 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:29,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:29,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:34,570 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:42:07,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:42:07,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 41 states and 42 transitions. [2024-11-09 00:42:07,328 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2024-11-09 00:42:07,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 00:42:07,328 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:42:07,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:42:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:42:07,380 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-09 00:42:37,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:42:37,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 38 states and 39 transitions. [2024-11-09 00:42:37,775 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2024-11-09 00:42:37,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 00:42:37,775 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 36 iterations. [2024-11-09 00:42:37,784 INFO L729 CodeCheckObserver]: All specifications hold 18 specifications checked. All of them hold [2024-11-09 00:42:41,155 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:42:41,156 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:42:41,156 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:42:41,156 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:42:41,156 INFO L77 FloydHoareUtils]: At program point L19(line 19) the Hoare annotation is: (and (= (select |#valid| |~#d1~0.base|) 1) (= |~#d2~0.offset| 0) (= |ULTIMATE.start_main_old_#valid#1| |#valid|) (= 5 |~#d2~0.base|) (<= 8 (select |#length| |~#d1~0.base|)) (= |~#d1~0.offset| 0) (= (select |#valid| |~#d2~0.base|) 1) (= 8 (select |#length| 5))) [2024-11-09 00:42:41,156 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:42:41,157 INFO L77 FloydHoareUtils]: At program point L15(line 15) the Hoare annotation is: (and (= |~#d2~0.offset| 0) (= |~#d1~0.base| 4) (= |ULTIMATE.start_main_old_#valid#1| |#valid|) (= 5 |~#d2~0.base|) (= (select |#valid| 4) 1) (= |~#d1~0.offset| 0) (= (select |#valid| |~#d2~0.base|) 1) (= 8 (select |#length| 5)) (= (select |#length| |~#d1~0.base|) 8)) [2024-11-09 00:42:41,157 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 32 52) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-09 00:42:41,158 INFO L77 FloydHoareUtils]: At program point L40-1(lines 40 42) the Hoare annotation is: (let ((.cse12 (+ 3 |ULTIMATE.start_main_~i~0#1|)) (.cse15 (+ 2 |ULTIMATE.start_main_~i~0#1|)) (.cse11 (+ |ULTIMATE.start_main_~i~0#1| 4)) (.cse9 (+ 5 |ULTIMATE.start_main_~i~0#1|)) (.cse2 (+ |ULTIMATE.start_main_~i~0#1| 8)) (.cse10 (+ 6 |ULTIMATE.start_main_~i~0#1|)) (.cse17 (+ 7 |ULTIMATE.start_main_~i~0#1|)) (.cse13 (select (select |#memory_int| |ULTIMATE.start_main_~pd2~0#1.base|) |ULTIMATE.start_main_~pd2~0#1.offset|)) (.cse16 (+ |ULTIMATE.start_main_~i~0#1| 1)) (.cse1 (= |ULTIMATE.start_main_old_#valid#1| |#valid|)) (.cse3 (select (select |#memory_int| |ULTIMATE.start_main_~pa~0#1.base|) |ULTIMATE.start_main_~pa~0#1.offset|)) (.cse4 (= (select |#valid| |ULTIMATE.start_main_~pd2~0#1.base|) 1)) (.cse5 (= |ULTIMATE.start_main_~pa~0#1.base| |ULTIMATE.start_main_~pd2~0#1.base|)) (.cse6 (<= (+ 4 |ULTIMATE.start_main_~pa~0#1.offset|) (select |#length| |ULTIMATE.start_main_~pa~0#1.base|))) (.cse7 (<= 0 |ULTIMATE.start_main_~pa~0#1.offset|)) (.cse14 (+ |ULTIMATE.start_main_~i~0#1| 10)) (.cse0 (+ 9 |ULTIMATE.start_main_~i~0#1|)) (.cse8 (= |ULTIMATE.start_main_~pd2~0#1.offset| |ULTIMATE.start_main_~pa~0#1.offset|))) (or (and (< |ULTIMATE.start_main_#t~mem17#1| .cse0) .cse1 (= .cse2 .cse3) (<= .cse2 |ULTIMATE.start_main_#t~mem17#1|) .cse4 .cse5 .cse6 .cse7 .cse8) (and (= .cse9 .cse3) .cse1 (<= .cse9 |ULTIMATE.start_main_#t~mem17#1|) (< |ULTIMATE.start_main_#t~mem17#1| .cse10) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 (< |ULTIMATE.start_main_#t~mem17#1| .cse11) .cse4 .cse5 .cse6 (= .cse12 .cse3) .cse7 (<= .cse12 |ULTIMATE.start_main_#t~mem17#1|) .cse8) (and (= .cse13 .cse14) .cse1 .cse4 .cse5 (= |ULTIMATE.start_main_#t~mem17#1| .cse3) .cse6 .cse7 .cse8) (and (= .cse15 .cse3) .cse1 (<= .cse15 |ULTIMATE.start_main_#t~mem17#1|) .cse4 .cse5 .cse6 (< |ULTIMATE.start_main_#t~mem17#1| .cse12) .cse7 .cse8) (and .cse1 (< |ULTIMATE.start_main_#t~mem17#1| .cse15) (= .cse3 .cse16) (<= .cse16 |ULTIMATE.start_main_#t~mem17#1|) .cse4 .cse5 .cse6 .cse7 .cse8) (and (= .cse11 .cse3) (<= .cse11 |ULTIMATE.start_main_#t~mem17#1|) .cse1 (< |ULTIMATE.start_main_#t~mem17#1| .cse9) .cse4 .cse5 .cse6 .cse7 .cse8) (and (< |ULTIMATE.start_main_#t~mem17#1| .cse2) (= .cse17 .cse3) .cse1 (<= .cse17 |ULTIMATE.start_main_#t~mem17#1|) .cse4 .cse5 .cse6 .cse7 .cse8) (and (<= .cse10 |ULTIMATE.start_main_#t~mem17#1|) .cse1 (= .cse10 .cse3) (< |ULTIMATE.start_main_#t~mem17#1| .cse17) .cse4 .cse5 .cse6 .cse7 .cse8) (and (= (select |#valid| |ULTIMATE.start_main_~pa~0#1.base|) 1) (= .cse13 |ULTIMATE.start_main_~i~0#1|) (< |ULTIMATE.start_main_#t~mem17#1| .cse16) .cse1 (<= 0 |ULTIMATE.start_main_~pd2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~pd2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~pd2~0#1.base|)) .cse4 .cse6 .cse7) (and .cse1 (= .cse0 .cse3) .cse4 .cse5 .cse6 .cse7 (< |ULTIMATE.start_main_#t~mem17#1| .cse14) (<= .cse0 |ULTIMATE.start_main_#t~mem17#1|) .cse8))) [2024-11-09 00:42:41,158 INFO L77 FloydHoareUtils]: At program point L40-3(lines 40 42) the Hoare annotation is: (let ((.cse10 (+ |ULTIMATE.start_main_~i~0#1| 4)) (.cse9 (+ 3 |ULTIMATE.start_main_~i~0#1|)) (.cse3 (+ 7 |ULTIMATE.start_main_~i~0#1|)) (.cse1 (+ 6 |ULTIMATE.start_main_~i~0#1|)) (.cse11 (+ 5 |ULTIMATE.start_main_~i~0#1|)) (.cse0 (= |ULTIMATE.start_main_old_#valid#1| |#valid|)) (.cse4 (= (select |#valid| |ULTIMATE.start_main_~pd2~0#1.base|) 1)) (.cse5 (= |ULTIMATE.start_main_~pa~0#1.base| |ULTIMATE.start_main_~pd2~0#1.base|)) (.cse6 (<= (+ 4 |ULTIMATE.start_main_~pa~0#1.offset|) (select |#length| |ULTIMATE.start_main_~pa~0#1.base|))) (.cse2 (select (select |#memory_int| |ULTIMATE.start_main_~pa~0#1.base|) |ULTIMATE.start_main_~pa~0#1.offset|)) (.cse12 (+ |ULTIMATE.start_main_~i~0#1| 1)) (.cse7 (<= 0 |ULTIMATE.start_main_~pa~0#1.offset|)) (.cse8 (= |ULTIMATE.start_main_~pd2~0#1.offset| |ULTIMATE.start_main_~pa~0#1.offset|))) (or (and .cse0 (< .cse1 .cse2) (<= .cse2 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8) (and (< .cse9 .cse2) .cse0 .cse4 .cse5 .cse6 (<= .cse2 .cse10) .cse7 .cse8) (and .cse0 (= (+ 9 |ULTIMATE.start_main_~i~0#1|) .cse2) .cse4 .cse5 .cse6 .cse7 .cse8) (and (<= .cse2 .cse11) .cse0 (< .cse10 .cse2) .cse4 .cse5 .cse6 .cse7 .cse8) (and (= |ULTIMATE.start_main_~i~0#1| .cse2) .cse0 .cse4 .cse5 .cse6 .cse7 .cse8) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~pd2~0#1.base|) |ULTIMATE.start_main_~pd2~0#1.offset|) (+ |ULTIMATE.start_main_~i~0#1| 10)) .cse0 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse4 .cse5 .cse6 (= .cse9 .cse2) .cse7 .cse8) (and .cse0 (< .cse3 .cse2) .cse4 .cse5 .cse6 (<= .cse2 (+ |ULTIMATE.start_main_~i~0#1| 8)) .cse7 .cse8) (and .cse0 .cse4 .cse5 .cse6 (<= .cse2 .cse1) .cse7 (< .cse11 .cse2) .cse8) (and (<= .cse2 (+ 2 |ULTIMATE.start_main_~i~0#1|)) .cse0 .cse4 .cse5 .cse6 (< .cse12 .cse2) .cse7 .cse8) (and .cse0 .cse4 (< |ULTIMATE.start_main_~i~0#1| .cse2) .cse5 .cse6 (<= .cse2 .cse12) .cse7 .cse8))) [2024-11-09 00:42:41,158 INFO L77 FloydHoareUtils]: At program point L40-4(lines 40 42) the Hoare annotation is: (and (= (select (select |#memory_int| |ULTIMATE.start_main_~pd2~0#1.base|) |ULTIMATE.start_main_~pd2~0#1.offset|) |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_old_#valid#1| |#valid|) (<= 0 |ULTIMATE.start_main_~pd2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~pd2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~pd2~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~pd2~0#1.base|) 1)) [2024-11-09 00:42:41,159 INFO L75 FloydHoareUtils]: For program point L3(line 3) no Hoare annotation was computed. [2024-11-09 00:42:41,159 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK(lines 32 52) no Hoare annotation was computed. [2024-11-09 00:42:41,159 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:42:41,159 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:42:41,160 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:42:41,160 INFO L77 FloydHoareUtils]: At program point L16(line 16) the Hoare annotation is: (and (= (select |#valid| |~#d1~0.base|) 1) (= |~#d2~0.offset| 0) (= |ULTIMATE.start_main_old_#valid#1| |#valid|) (= 5 |~#d2~0.base|) (= |~#d1~0.offset| 0) (= (select |#valid| |~#d2~0.base|) 1) (= 8 (select |#length| 5)) (= (select |#length| |~#d1~0.base|) 8)) [2024-11-09 00:42:41,160 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:42:41,160 INFO L77 FloydHoareUtils]: At program point L37(line 37) the Hoare annotation is: (let ((.cse0 (not |ULTIMATE.start_main_#t~short15#1|))) (and (= |ULTIMATE.start_main_old_#valid#1| |#valid|) (or (= |ULTIMATE.start_main_~pd2~0#1.base| |ULTIMATE.start_main_~pd1~0#1.base|) .cse0) (or (and (<= 8 (select |#length| |ULTIMATE.start_main_~pd2~0#1.base|)) (= |ULTIMATE.start_main_~pd2~0#1.offset| 0)) .cse0) (or (= (select |#valid| |ULTIMATE.start_main_~pd2~0#1.base|) 1) .cse0) (or (= |ULTIMATE.start_main_~pd1~0#1.offset| |ULTIMATE.start_main_~pd2~0#1.offset|) .cse0))) [2024-11-09 00:42:41,161 INFO L77 FloydHoareUtils]: At program point L37-1(line 37) the Hoare annotation is: (and (<= 8 (select |#length| |ULTIMATE.start_main_~pd2~0#1.base|)) (= |ULTIMATE.start_main_~pd2~0#1.offset| 0) (= |ULTIMATE.start_main_old_#valid#1| |#valid|) (= |ULTIMATE.start_main_~pd1~0#1.offset| |ULTIMATE.start_main_~pd2~0#1.offset|) (= |ULTIMATE.start_main_~pd2~0#1.base| |ULTIMATE.start_main_~pd1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~pd2~0#1.base|) 1)) [2024-11-09 00:42:41,161 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK(line 3) no Hoare annotation was computed. [2024-11-09 00:42:41,161 INFO L77 FloydHoareUtils]: At program point L37-4(lines 37 46) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_old_#valid#1| |#valid|))) (or (and .cse0 (not |ULTIMATE.start_main_#t~short15#1|)) (and .cse0 (= |ULTIMATE.start_main_~pd1~0#1.offset| |ULTIMATE.start_main_~pd2~0#1.offset|) (<= 0 |ULTIMATE.start_main_~pd2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~pd2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~pd2~0#1.base|)) (= |ULTIMATE.start_main_~pd2~0#1.base| |ULTIMATE.start_main_~pd1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~pd2~0#1.base|) 1)))) [2024-11-09 00:42:41,161 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-09 00:42:41,161 INFO L77 FloydHoareUtils]: At program point L37-6(lines 37 46) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-09 00:42:41,162 INFO L77 FloydHoareUtils]: At program point L29(line 29) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_check_~s1#1.offset|) (= |ULTIMATE.start_main_old_#valid#1| |#valid|) (<= (+ |ULTIMATE.start_check_~s1#1.offset| 4) (select |#length| |ULTIMATE.start_check_~s1#1.base|)) (= |ULTIMATE.start_check_~i#1| (select (select |#memory_int| |ULTIMATE.start_check_~s1#1.base|) |ULTIMATE.start_check_~s1#1.offset|)) (= (select |#valid| |ULTIMATE.start_check_~s1#1.base|) 1)) [2024-11-09 00:42:41,162 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:42:41,162 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:42:41,162 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:42:41,162 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-09 00:42:41,163 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:42:41,163 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:42:41,163 INFO L77 FloydHoareUtils]: At program point L18(line 18) the Hoare annotation is: (and (= (select |#valid| |~#d1~0.base|) 1) (= |~#d2~0.offset| 0) (= |ULTIMATE.start_main_old_#valid#1| |#valid|) (= 5 |~#d2~0.base|) (<= 8 (select |#length| |~#d1~0.base|)) (= |~#d1~0.offset| 0) (= (select |#valid| |~#d2~0.base|) 1) (= 8 (select |#length| 5))) [2024-11-09 00:42:41,163 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:42:41,163 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:42:41,164 INFO L77 FloydHoareUtils]: At program point L43(lines 43 45) the Hoare annotation is: (and (= |ULTIMATE.start_main_old_#valid#1| |#valid|) (<= 1 |ULTIMATE.start_main_#t~ret19#1|)) [2024-11-09 00:42:41,164 INFO L77 FloydHoareUtils]: At program point L39(line 39) the Hoare annotation is: (and (= |ULTIMATE.start_main_old_#valid#1| |#valid|) (<= 0 |ULTIMATE.start_main_~pd2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~pd2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~pd2~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~pd2~0#1.base|) 1) (= |ULTIMATE.start_main_~pa~0#1.base| |ULTIMATE.start_main_~pd2~0#1.base|) (= |ULTIMATE.start_main_~pd2~0#1.offset| |ULTIMATE.start_main_~pa~0#1.offset|)) [2024-11-09 00:42:41,184 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-09 00:42:41,185 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 00:42:41,186 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-09 00:42:41,186 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 00:42:41,188 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~ret19 [2024-11-09 00:42:41,188 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s1!offset [2024-11-09 00:42:41,189 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-09 00:42:41,189 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 00:42:41,189 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s1!offset [2024-11-09 00:42:41,189 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 00:42:41,189 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 00:42:41,189 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 00:42:41,190 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 00:42:41,190 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~s1!base,]]] [2024-11-09 00:42:41,190 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 00:42:41,190 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 00:42:41,191 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 00:42:41,191 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 00:42:41,191 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d2~0!offset [2024-11-09 00:42:41,191 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-09 00:42:41,191 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 00:42:41,191 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d2~0!base [2024-11-09 00:42:41,192 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 00:42:41,192 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 00:42:41,192 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d1~0!offset [2024-11-09 00:42:41,192 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 00:42:41,192 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 00:42:41,192 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 00:42:41,192 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 00:42:41,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.11 12:42:41 ImpRootNode [2024-11-09 00:42:41,194 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-09 00:42:41,195 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:42:41,195 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:42:41,195 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:42:41,196 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:40:20" (3/4) ... [2024-11-09 00:42:41,199 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 00:42:41,207 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2024-11-09 00:42:41,207 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-09 00:42:41,208 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 00:42:41,208 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 00:42:41,308 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd52093e-ec31-405b-8091-f2a69d5564a0/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-09 00:42:41,309 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd52093e-ec31-405b-8091-f2a69d5564a0/bin/ukojak-verify-ImItNfHLgk/witness.yml [2024-11-09 00:42:41,309 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:42:41,310 INFO L158 Benchmark]: Toolchain (without parser) took 142302.45ms. Allocated memory was 157.3MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 119.8MB in the beginning and 516.9MB in the end (delta: -397.1MB). Peak memory consumption was 636.8MB. Max. memory is 16.1GB. [2024-11-09 00:42:41,310 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 113.2MB. Free memory is still 65.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:42:41,311 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.43ms. Allocated memory is still 157.3MB. Free memory was 119.8MB in the beginning and 106.6MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 00:42:41,311 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.81ms. Allocated memory is still 157.3MB. Free memory was 106.6MB in the beginning and 105.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:42:41,311 INFO L158 Benchmark]: Boogie Preprocessor took 63.41ms. Allocated memory is still 157.3MB. Free memory was 105.1MB in the beginning and 103.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:42:41,312 INFO L158 Benchmark]: RCFGBuilder took 625.56ms. Allocated memory is still 157.3MB. Free memory was 103.3MB in the beginning and 82.4MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 00:42:41,313 INFO L158 Benchmark]: CodeCheck took 141034.59ms. Allocated memory was 157.3MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 82.4MB in the beginning and 522.2MB in the end (delta: -439.8MB). Peak memory consumption was 594.8MB. Max. memory is 16.1GB. [2024-11-09 00:42:41,313 INFO L158 Benchmark]: Witness Printer took 113.95ms. Allocated memory is still 1.2GB. Free memory was 522.2MB in the beginning and 516.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:42:41,315 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, 36 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 137.6s, OverallIterations: 36, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2675 SdHoareTripleChecker+Valid, 30.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2240 mSDsluCounter, 658 SdHoareTripleChecker+Invalid, 26.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 456 mSDsCounter, 3190 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13405 IncrementalHoareTripleChecker+Invalid, 16595 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3190 mSolverCounterUnsat, 202 mSDtfsCounter, 13405 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6976 GetRequests, 6122 SyntacticMatches, 170 SemanticMatches, 684 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220392 ImplicationChecksByTransitivity, 125.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 16.7s InterpolantComputationTime, 518 NumberOfCodeBlocks, 518 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 483 ConstructedInterpolants, 0 QuantifiedInterpolants, 3441 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 22 PerfectInterpolantSequences, 312/778 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 - 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: -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: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 32]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 113.2MB. Free memory is still 65.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 412.43ms. Allocated memory is still 157.3MB. Free memory was 119.8MB in the beginning and 106.6MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.81ms. Allocated memory is still 157.3MB. Free memory was 106.6MB in the beginning and 105.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 63.41ms. Allocated memory is still 157.3MB. Free memory was 105.1MB in the beginning and 103.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 625.56ms. Allocated memory is still 157.3MB. Free memory was 103.3MB in the beginning and 82.4MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * CodeCheck took 141034.59ms. Allocated memory was 157.3MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 82.4MB in the beginning and 522.2MB in the end (delta: -439.8MB). Peak memory consumption was 594.8MB. Max. memory is 16.1GB. * Witness Printer took 113.95ms. Allocated memory is still 1.2GB. Free memory was 522.2MB in the beginning and 516.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~ret19 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s1!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s1!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~s1!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d2~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d2~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d1~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] RESULT: Ultimate proved your program to be correct! [2024-11-09 00:42:41,354 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd52093e-ec31-405b-8091-f2a69d5564a0/bin/ukojak-verify-ImItNfHLgk/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