./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test13.i --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_ed837001-66db-4678-8d84-b75b9ccc93b5/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed837001-66db-4678-8d84-b75b9ccc93b5/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_ed837001-66db-4678-8d84-b75b9ccc93b5/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed837001-66db-4678-8d84-b75b9ccc93b5/bin/ukojak-verify-ImItNfHLgk/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test13.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed837001-66db-4678-8d84-b75b9ccc93b5/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_ed837001-66db-4678-8d84-b75b9ccc93b5/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 e403b28035008257649d82a96310933a0e656461d578ec0892b41718c92e86af --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 23:24:20,080 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:24:20,177 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed837001-66db-4678-8d84-b75b9ccc93b5/bin/ukojak-verify-ImItNfHLgk/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf [2024-11-08 23:24:20,185 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:24:20,186 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 23:24:20,232 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:24:20,234 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:24:20,234 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:24:20,236 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:24:20,237 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:24:20,237 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:24:20,238 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:24:20,238 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:24:20,239 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 23:24:20,241 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 23:24:20,241 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 23:24:20,241 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:24:20,242 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:24:20,242 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 23:24:20,242 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:24:20,243 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:24:20,247 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 23:24:20,247 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 23:24:20,248 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 23:24:20,248 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:24:20,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:24:20,249 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:24:20,249 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:24:20,249 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 23:24:20,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:24:20,250 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_ed837001-66db-4678-8d84-b75b9ccc93b5/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_ed837001-66db-4678-8d84-b75b9ccc93b5/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 -> e403b28035008257649d82a96310933a0e656461d578ec0892b41718c92e86af [2024-11-08 23:24:20,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:24:20,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:24:20,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:24:20,592 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:24:20,592 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:24:20,593 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed837001-66db-4678-8d84-b75b9ccc93b5/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/ldv-memsafety/memleaks_test13.i Unable to find full path for "g++" [2024-11-08 23:24:22,494 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:24:22,825 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:24:22,825 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed837001-66db-4678-8d84-b75b9ccc93b5/sv-benchmarks/c/ldv-memsafety/memleaks_test13.i [2024-11-08 23:24:22,850 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed837001-66db-4678-8d84-b75b9ccc93b5/bin/ukojak-verify-ImItNfHLgk/data/020d9dfb4/8340f0c9df7a4d069a96a2acc142ded2/FLAGc828954c6 [2024-11-08 23:24:23,064 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed837001-66db-4678-8d84-b75b9ccc93b5/bin/ukojak-verify-ImItNfHLgk/data/020d9dfb4/8340f0c9df7a4d069a96a2acc142ded2 [2024-11-08 23:24:23,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:24:23,068 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:24:23,070 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:24:23,070 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:24:23,076 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:24:23,076 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:24:23" (1/1) ... [2024-11-08 23:24:23,078 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45a60225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:23, skipping insertion in model container [2024-11-08 23:24:23,078 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:24:23" (1/1) ... [2024-11-08 23:24:23,125 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:24:23,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:24:23,674 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:24:23,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:24:23,817 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:24:23,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:23 WrapperNode [2024-11-08 23:24:23,818 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:24:23,820 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:24:23,820 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:24:23,820 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:24:23,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:23" (1/1) ... [2024-11-08 23:24:23,853 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:23" (1/1) ... [2024-11-08 23:24:23,887 INFO L138 Inliner]: procedures = 166, calls = 80, calls flagged for inlining = 34, calls inlined = 11, statements flattened = 91 [2024-11-08 23:24:23,888 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:24:23,888 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:24:23,889 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:24:23,889 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:24:23,900 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:23" (1/1) ... [2024-11-08 23:24:23,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:23" (1/1) ... [2024-11-08 23:24:23,911 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:23" (1/1) ... [2024-11-08 23:24:23,911 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:23" (1/1) ... [2024-11-08 23:24:23,921 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:23" (1/1) ... [2024-11-08 23:24:23,924 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:23" (1/1) ... [2024-11-08 23:24:23,926 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:23" (1/1) ... [2024-11-08 23:24:23,928 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:23" (1/1) ... [2024-11-08 23:24:23,930 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:24:23,935 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:24:23,935 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:24:23,935 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:24:23,936 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:24:23" (1/1) ... [2024-11-08 23:24:23,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:24:23,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed837001-66db-4678-8d84-b75b9ccc93b5/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 23:24:23,977 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed837001-66db-4678-8d84-b75b9ccc93b5/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 23:24:23,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed837001-66db-4678-8d84-b75b9ccc93b5/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 23:24:24,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 23:24:24,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:24:24,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-08 23:24:24,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-08 23:24:24,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 23:24:24,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-08 23:24:24,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:24:24,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:24:24,142 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:24:24,145 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:24:24,482 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2024-11-08 23:24:24,482 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:24:24,567 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:24:24,568 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 23:24:24,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:24:24 BoogieIcfgContainer [2024-11-08 23:24:24,569 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:24:24,570 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 23:24:24,570 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 23:24:24,579 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 23:24:24,579 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:24:24" (1/1) ... [2024-11-08 23:24:24,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:24:24,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:24:24,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 57 states and 59 transitions. [2024-11-08 23:24:24,635 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2024-11-08 23:24:24,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-08 23:24:24,638 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:24:24,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:24:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:24:25,104 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-08 23:24:25,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:24:25,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 56 states and 58 transitions. [2024-11-08 23:24:25,210 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2024-11-08 23:24:25,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-08 23:24:25,210 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:24:25,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:24:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:24:25,556 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-08 23:24:25,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:24:25,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 55 states and 57 transitions. [2024-11-08 23:24:25,956 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2024-11-08 23:24:25,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 23:24:25,957 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:24:25,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:24:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:24:26,061 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-08 23:24:26,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:24:26,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 57 states and 60 transitions. [2024-11-08 23:24:26,332 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2024-11-08 23:24:26,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 23:24:26,332 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:24:26,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:24:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:24:26,509 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-08 23:24:26,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:24:26,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 59 states and 63 transitions. [2024-11-08 23:24:26,999 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2024-11-08 23:24:26,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 23:24:27,000 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:24:27,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:24:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:24:27,156 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-08 23:24:27,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:24:27,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 58 states and 62 transitions. [2024-11-08 23:24:27,691 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2024-11-08 23:24:27,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 23:24:27,691 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:24:27,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:24:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:24:28,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-08 23:24:29,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:24:29,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 57 states and 61 transitions. [2024-11-08 23:24:29,136 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2024-11-08 23:24:29,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 23:24:29,136 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:24:29,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:24:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:24:29,250 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-08 23:24:29,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:24:29,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 60 states and 67 transitions. [2024-11-08 23:24:29,568 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2024-11-08 23:24:29,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 23:24:29,568 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:24:29,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:24:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:24:29,919 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-08 23:24:31,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:24:31,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 63 states and 74 transitions. [2024-11-08 23:24:31,080 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2024-11-08 23:24:31,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 23:24:31,080 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:24:31,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:24:31,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:24:31,414 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-08 23:24:32,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:24:32,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 62 states and 73 transitions. [2024-11-08 23:24:32,604 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2024-11-08 23:24:32,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 23:24:32,605 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:24:32,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:24:32,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:24:32,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-08 23:24:34,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:24:34,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 61 states and 72 transitions. [2024-11-08 23:24:34,800 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2024-11-08 23:24:34,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 23:24:34,802 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:24:34,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:24:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:24:34,845 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-08 23:24:34,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:24:34,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 60 states and 71 transitions. [2024-11-08 23:24:34,865 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2024-11-08 23:24:34,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 23:24:34,865 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:24:34,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:24:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:24:35,401 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-08 23:24:36,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:24:36,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 59 states and 70 transitions. [2024-11-08 23:24:36,178 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2024-11-08 23:24:36,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 23:24:36,179 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:24:36,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:24:36,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:24:36,310 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-08 23:24:37,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:24:37,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 58 states and 69 transitions. [2024-11-08 23:24:37,639 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2024-11-08 23:24:37,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 23:24:37,639 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:24:37,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:24:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:24:38,435 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-08 23:24:40,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:24:40,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 57 states and 68 transitions. [2024-11-08 23:24:40,678 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2024-11-08 23:24:40,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 23:24:40,679 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:24:40,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:24:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:24:41,000 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-08 23:24:41,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:24:41,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 59 states and 71 transitions. [2024-11-08 23:24:41,726 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2024-11-08 23:24:41,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 23:24:41,727 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:24:41,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:24:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:24:41,895 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-08 23:24:42,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:24:42,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 62 states and 76 transitions. [2024-11-08 23:24:42,391 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2024-11-08 23:24:42,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 23:24:42,391 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:24:42,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:24:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:24:42,894 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-08 23:24:44,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:24:44,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 66 states and 83 transitions. [2024-11-08 23:24:44,932 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2024-11-08 23:24:44,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 23:24:44,933 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:24:44,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:24:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:24:44,953 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-08 23:24:44,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:24:44,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 65 states and 82 transitions. [2024-11-08 23:24:44,969 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2024-11-08 23:24:44,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 23:24:44,970 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:24:44,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:24:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:24:45,496 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-08 23:24:45,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:24:45,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 66 states and 83 transitions. [2024-11-08 23:24:45,894 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2024-11-08 23:24:45,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 23:24:45,894 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:24:45,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:24:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:24:46,110 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-08 23:24:49,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:24:49,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 63 states and 79 transitions. [2024-11-08 23:24:49,126 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 79 transitions. [2024-11-08 23:24:49,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 23:24:49,127 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:24:49,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:24:49,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:24:49,737 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-08 23:24:53,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:24:53,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 62 states and 78 transitions. [2024-11-08 23:24:53,943 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2024-11-08 23:24:53,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 23:24:53,943 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:24:53,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:24:53,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:24:54,312 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-08 23:24:57,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:24:57,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 70 states and 90 transitions. [2024-11-08 23:24:57,535 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2024-11-08 23:24:57,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 23:24:57,536 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:24:57,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:24:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:24:58,297 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-08 23:25:02,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:25:02,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 70 states and 89 transitions. [2024-11-08 23:25:02,639 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2024-11-08 23:25:02,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 23:25:02,641 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:25:02,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:25:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:03,761 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-08 23:25:06,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:25:06,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 71 states and 92 transitions. [2024-11-08 23:25:06,270 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2024-11-08 23:25:06,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 23:25:06,271 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:25:06,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:25:06,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:06,432 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-08 23:25:07,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:25:07,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 71 states and 91 transitions. [2024-11-08 23:25:07,219 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 91 transitions. [2024-11-08 23:25:07,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 23:25:07,219 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:25:07,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:25:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:07,346 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-08 23:25:08,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:25:08,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 69 states and 88 transitions. [2024-11-08 23:25:08,034 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2024-11-08 23:25:08,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 23:25:08,035 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:25:08,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:25:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:08,208 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-08 23:25:09,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:25:09,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 67 states and 84 transitions. [2024-11-08 23:25:09,125 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 84 transitions. [2024-11-08 23:25:09,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 23:25:09,125 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:25:09,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:25:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:10,043 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-08 23:25:12,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:25:12,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 61 states and 75 transitions. [2024-11-08 23:25:12,410 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2024-11-08 23:25:12,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 23:25:12,410 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:25:12,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:25:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:12,691 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-08 23:25:13,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:25:13,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 64 states and 79 transitions. [2024-11-08 23:25:13,572 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2024-11-08 23:25:13,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 23:25:13,573 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:25:13,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:25:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:13,734 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-08 23:25:15,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:25:15,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 64 states and 78 transitions. [2024-11-08 23:25:15,268 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2024-11-08 23:25:15,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 23:25:15,268 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:25:15,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:25:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:16,629 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-08 23:25:21,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:25:21,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 67 states and 83 transitions. [2024-11-08 23:25:21,639 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2024-11-08 23:25:21,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 23:25:21,639 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:25:21,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:25:21,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:22,486 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-08 23:25:24,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:25:24,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 66 states and 80 transitions. [2024-11-08 23:25:24,962 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2024-11-08 23:25:24,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 23:25:24,963 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:25:24,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:25:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:25,142 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-08 23:25:25,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:25:25,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 66 states and 79 transitions. [2024-11-08 23:25:25,521 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2024-11-08 23:25:25,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 23:25:25,521 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:25:25,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:25:25,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:25,560 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-08 23:25:25,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:25:25,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 65 states and 78 transitions. [2024-11-08 23:25:25,591 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2024-11-08 23:25:25,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 23:25:25,592 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:25:25,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:25:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:26,401 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-08 23:25:27,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:25:27,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 66 states and 80 transitions. [2024-11-08 23:25:27,745 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2024-11-08 23:25:27,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 23:25:27,745 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:25:27,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:25:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:29,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-08 23:25:39,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:25:39,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 72 states and 91 transitions. [2024-11-08 23:25:39,714 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2024-11-08 23:25:39,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 23:25:39,714 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:25:39,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:25:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:43,264 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-08 23:25:55,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:25:55,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 78 states and 103 transitions. [2024-11-08 23:25:55,591 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 103 transitions. [2024-11-08 23:25:55,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 23:25:55,592 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:25:55,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:25:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:57,096 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-08 23:25:59,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:25:59,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 77 states and 100 transitions. [2024-11-08 23:25:59,149 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 100 transitions. [2024-11-08 23:25:59,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 23:25:59,149 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:25:59,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:25:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:59,827 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-08 23:26:01,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:26:01,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 76 states and 98 transitions. [2024-11-08 23:26:01,491 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2024-11-08 23:26:01,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 23:26:01,491 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:26:01,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:26:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:04,850 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-08 23:26:18,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:26:18,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 83 states and 112 transitions. [2024-11-08 23:26:18,803 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 112 transitions. [2024-11-08 23:26:18,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 23:26:18,803 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:26:18,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:26:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:23,796 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-08 23:26:41,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:26:41,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 90 states and 127 transitions. [2024-11-08 23:26:41,144 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 127 transitions. [2024-11-08 23:26:41,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 23:26:41,145 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:26:41,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:26:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:42,940 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-08 23:26:44,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:26:44,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 89 states and 125 transitions. [2024-11-08 23:26:44,977 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 125 transitions. [2024-11-08 23:26:44,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 23:26:44,977 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:26:44,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:26:44,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:45,800 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-08 23:26:47,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:26:47,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 88 states and 123 transitions. [2024-11-08 23:26:47,793 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 123 transitions. [2024-11-08 23:26:47,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 23:26:47,793 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:26:47,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:26:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:49,728 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-08 23:26:57,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:26:57,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 91 states and 129 transitions. [2024-11-08 23:26:57,407 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2024-11-08 23:26:57,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 23:26:57,407 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:26:57,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:26:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:59,430 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-08 23:27:25,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:27:25,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 100 states and 146 transitions. [2024-11-08 23:27:25,590 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 146 transitions. [2024-11-08 23:27:25,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 23:27:25,591 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:27:25,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:27:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,868 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-08 23:27:27,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:27:27,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 99 states and 144 transitions. [2024-11-08 23:27:27,855 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 144 transitions. [2024-11-08 23:27:27,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-08 23:27:27,855 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:27:27,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:27:27,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:27,882 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-08 23:27:37,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:27:37,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 104 states and 153 transitions. [2024-11-08 23:27:37,501 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 153 transitions. [2024-11-08 23:27:37,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 23:27:37,502 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:27:37,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:27:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:43,150 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-08 23:28:03,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:28:03,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 114 states and 174 transitions. [2024-11-08 23:28:03,560 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 174 transitions. [2024-11-08 23:28:03,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 23:28:03,560 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:28:03,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:28:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:11,141 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-08 23:28:39,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:28:39,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 124 states and 209 transitions. [2024-11-08 23:28:39,068 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 209 transitions. [2024-11-08 23:28:39,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 23:28:39,069 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:28:39,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:28:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:43,386 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-08 23:28:52,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:28:52,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 127 states and 211 transitions. [2024-11-08 23:28:52,224 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 211 transitions. [2024-11-08 23:28:52,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 23:28:52,225 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:28:52,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:28:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:55,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 23:29:19,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:29:19,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 138 states and 237 transitions. [2024-11-08 23:29:19,966 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 237 transitions. [2024-11-08 23:29:19,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 23:29:19,967 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:29:19,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:29:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:22,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 23:29:25,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:29:25,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 139 states and 239 transitions. [2024-11-08 23:29:25,896 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 239 transitions. [2024-11-08 23:29:25,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 23:29:25,897 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:29:25,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:29:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:31,350 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:30:07,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:30:07,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 150 states and 263 transitions. [2024-11-08 23:30:07,697 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 263 transitions. [2024-11-08 23:30:07,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 23:30:07,697 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:30:07,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:30:07,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:12,145 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-08 23:31:00,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:00,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 161 states and 287 transitions. [2024-11-08 23:31:00,535 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 287 transitions. [2024-11-08 23:31:00,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 23:31:00,536 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:00,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:03,364 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-08 23:31:16,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:16,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 164 states and 291 transitions. [2024-11-08 23:31:16,094 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 291 transitions. [2024-11-08 23:31:16,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 23:31:16,095 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:31:16,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:31:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:21,262 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:31:31,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:31:31,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 35 states and 38 transitions. [2024-11-08 23:31:31,055 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-11-08 23:31:31,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 23:31:31,055 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 57 iterations. [2024-11-08 23:31:31,062 INFO L729 CodeCheckObserver]: All specifications hold 32 specifications checked. All of them hold [2024-11-08 23:31:36,917 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:31:36,917 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:31:36,918 INFO L77 FloydHoareUtils]: At program point L762(lines 762 767) the Hoare annotation is: (let ((.cse3 (select |#memory_$Pointer$.base| |~#global_list_13~0.base|))) (let ((.cse4 (select .cse3 |~#global_list_13~0.offset|))) (let ((.cse2 (= (select |#valid| |~#global_list_13~0.base|) 1)) (.cse1 (= .cse4 |~#global_list_13~0.base|)) (.cse0 (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|))) (or (and (= (select .cse0 0) 0) (= |ULTIMATE.start_main_old_#valid#1| |#valid|) .cse1 .cse2 (= 8 (select |#length| 2)) (= |~#global_list_13~0.offset| 0) (= 2 (select .cse3 0))) (let ((.cse5 (select |#memory_$Pointer$.base| .cse4)) (.cse6 (select .cse0 |~#global_list_13~0.offset|))) (let ((.cse8 (select |#memory_$Pointer$.offset| .cse4)) (.cse7 (select .cse5 .cse6))) (and (= |ULTIMATE.start_main_old_#valid#1| (store |#valid| .cse4 0)) (= |~#global_list_13~0.base| (select .cse5 8)) (<= (+ .cse4 1) |#StackHeapBarrier|) (= .cse6 4) (<= 0 |~#global_list_13~0.offset|) (<= (+ 8 |~#global_list_13~0.offset|) (select |#length| .cse7)) .cse2 (= (select |#valid| .cse4) 1) (= (select .cse8 8) |~#global_list_13~0.offset|) (= |~#global_list_13~0.offset| (select .cse8 .cse6)) (= |~#global_list_13~0.base| .cse7) (not .cse1) (<= |~#global_list_13~0.offset| 0) (<= (+ .cse6 8) (select |#length| .cse4))))))))) [2024-11-08 23:31:36,918 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:31:36,918 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:31:36,918 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:31:36,919 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:31:36,919 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:31:36,919 INFO L77 FloydHoareUtils]: At program point L548(line 548) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start___ldv_list_add_~new#1.base|) |ULTIMATE.start___ldv_list_add_~new#1.offset|))) (and (= (select |#valid| |ULTIMATE.start___ldv_list_add_~new#1.base|) 1) (<= (+ 1 |ULTIMATE.start___ldv_list_add_~new#1.base|) |#StackHeapBarrier|) (= |ULTIMATE.start___ldv_list_add_~new#1.offset| 4) (<= (+ 8 |~#global_list_13~0.offset|) (select |#length| .cse0)) (<= 0 |ULTIMATE.start___ldv_list_add_~prev#1.offset|) (= .cse0 |~#global_list_13~0.base|) (= (select |#valid| |~#global_list_13~0.base|) 1) (= |ULTIMATE.start___ldv_list_add_~prev#1.offset| |~#global_list_13~0.offset|) (= (store |#valid| |ULTIMATE.start___ldv_list_add_~new#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start___ldv_list_add_~new#1.base|) |ULTIMATE.start___ldv_list_add_~new#1.offset|)) (not (= |~#global_list_13~0.base| |ULTIMATE.start___ldv_list_add_~new#1.base|)) (= |ULTIMATE.start___ldv_list_add_~prev#1.base| |~#global_list_13~0.base|) (<= |~#global_list_13~0.offset| 0) (<= (+ |ULTIMATE.start___ldv_list_add_~new#1.offset| 8) (select |#length| |ULTIMATE.start___ldv_list_add_~new#1.base|)))) [2024-11-08 23:31:36,919 INFO L77 FloydHoareUtils]: At program point L771(line 771) the Hoare annotation is: (let ((.cse3 (select |#memory_$Pointer$.base| |~#global_list_13~0.base|))) (let ((.cse4 (select .cse3 |~#global_list_13~0.offset|))) (let ((.cse2 (= (select |#valid| |~#global_list_13~0.base|) 1)) (.cse1 (= .cse4 |~#global_list_13~0.base|)) (.cse0 (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|))) (or (and (= (select .cse0 0) 0) (= |ULTIMATE.start_main_old_#valid#1| |#valid|) .cse1 .cse2 (= 8 (select |#length| 2)) (= |~#global_list_13~0.offset| 0) (= 2 (select .cse3 0))) (let ((.cse5 (select |#memory_$Pointer$.base| .cse4)) (.cse6 (select .cse0 |~#global_list_13~0.offset|))) (let ((.cse8 (select |#memory_$Pointer$.offset| .cse4)) (.cse7 (select .cse5 .cse6))) (and (= |ULTIMATE.start_main_old_#valid#1| (store |#valid| .cse4 0)) (= |~#global_list_13~0.base| (select .cse5 8)) (<= (+ .cse4 1) |#StackHeapBarrier|) (= .cse6 4) (<= 0 |~#global_list_13~0.offset|) (<= (+ 8 |~#global_list_13~0.offset|) (select |#length| .cse7)) .cse2 (= (select |#valid| .cse4) 1) (= (select .cse8 8) |~#global_list_13~0.offset|) (= |~#global_list_13~0.offset| (select .cse8 .cse6)) (= |~#global_list_13~0.base| .cse7) (not .cse1) (<= |~#global_list_13~0.offset| 0) (<= (+ .cse6 8) (select |#length| .cse4))))))))) [2024-11-08 23:31:36,920 INFO L77 FloydHoareUtils]: At program point L771-2(line 771) the Hoare annotation is: (let ((.cse4 (= |ULTIMATE.start_free_13_~p~1#1.base| |~#global_list_13~0.base|)) (.cse5 (= (select |#valid| |ULTIMATE.start_free_13_~p~1#1.base|) 1)) (.cse3 (+ |ULTIMATE.start_free_13_~p~1#1.offset| 4))) (or (let ((.cse2 (select |#memory_$Pointer$.base| |ULTIMATE.start_free_13_~p~1#1.base|))) (let ((.cse1 (select .cse2 8)) (.cse0 (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_13_~p~1#1.base|))) (and (<= (+ |ULTIMATE.start_free_13_~p~1#1.base| 1) |#StackHeapBarrier|) (= (select .cse0 8) |~#global_list_13~0.offset|) (<= (+ 8 |~#global_list_13~0.offset|) (select |#length| .cse1)) (= (select .cse2 .cse3) |~#global_list_13~0.base|) (= .cse1 |~#global_list_13~0.base|) (= (store |#valid| |ULTIMATE.start_free_13_~p~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 0 |~#global_list_13~0.offset|) (not .cse4) (= (select |#valid| |~#global_list_13~0.base|) 1) .cse5 (= |~#global_list_13~0.offset| (select .cse0 .cse3)) (<= (+ 12 |ULTIMATE.start_free_13_~p~1#1.offset|) (select |#length| |ULTIMATE.start_free_13_~p~1#1.base|)) (= |ULTIMATE.start_free_13_~p~1#1.offset| 0) (<= |~#global_list_13~0.offset| 0)))) (and (= |ULTIMATE.start_main_old_#valid#1| |#valid|) .cse4 .cse5 (= 2 |~#global_list_13~0.base|) (= 8 (select |#length| 2)) (= .cse3 |~#global_list_13~0.offset|) (= |~#global_list_13~0.offset| 0)))) [2024-11-08 23:31:36,920 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:31:36,920 INFO L77 FloydHoareUtils]: At program point L771-5(lines 771 774) the Hoare annotation is: (let ((.cse2 (select |#memory_$Pointer$.base| |ULTIMATE.start_free_13_~p~1#1.base|)) (.cse0 (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_13_~p~1#1.base|)) (.cse4 (+ |ULTIMATE.start_free_13_~p~1#1.offset| 4))) (let ((.cse3 (select .cse0 .cse4)) (.cse1 (select .cse2 .cse4))) (and (<= (+ |ULTIMATE.start_free_13_~p~1#1.base| 1) |#StackHeapBarrier|) (= (select .cse0 8) |~#global_list_13~0.offset|) (= |ULTIMATE.start_free_13_~n~1#1.base| .cse1) (= (select .cse0 4) |~#global_list_13~0.offset|) (= (select .cse2 8) |~#global_list_13~0.base|) (= (store |#valid| |ULTIMATE.start_free_13_~p~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start_free_13_~n~1#1.base| |~#global_list_13~0.base|) (= (select |#valid| |~#global_list_13~0.base|) 1) (= (select |#valid| |ULTIMATE.start_free_13_~p~1#1.base|) 1) (not (= |ULTIMATE.start_free_13_~p~1#1.base| |ULTIMATE.start_free_13_~n~1#1.base|)) (<= (+ 12 |ULTIMATE.start_free_13_~p~1#1.offset|) (select |#length| |ULTIMATE.start_free_13_~p~1#1.base|)) (= |ULTIMATE.start_free_13_~p~1#1.offset| 0) (<= 0 .cse3) (= (+ |ULTIMATE.start_free_13_~n~1#1.offset| 4) .cse3) (<= (+ 8 .cse3) (select |#length| .cse1)) (<= |~#global_list_13~0.offset| 0)))) [2024-11-08 23:31:36,920 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK(lines 781 783) no Hoare annotation was computed. [2024-11-08 23:31:36,921 INFO L77 FloydHoareUtils]: At program point L771-7(line 771) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_free_13_~n~1#1.offset| 4))) (and (= .cse0 |~#global_list_13~0.offset|) (= (select |#valid| |ULTIMATE.start_free_13_~n~1#1.base|) 1) (= |ULTIMATE.start_free_13_~p~1#1.base| |ULTIMATE.start_free_13_~n~1#1.base|) (= |ULTIMATE.start_main_old_#valid#1| |#valid|) (= |ULTIMATE.start_free_13_~p~1#1.base| |~#global_list_13~0.base|) (<= 0 .cse0) (= (+ |ULTIMATE.start_free_13_~p~1#1.offset| 4) |~#global_list_13~0.offset|) (<= (+ 12 |ULTIMATE.start_free_13_~p~1#1.offset|) (select |#length| |ULTIMATE.start_free_13_~n~1#1.base|)))) [2024-11-08 23:31:36,921 INFO L77 FloydHoareUtils]: At program point L540(line 540) the Hoare annotation is: (and (= |ULTIMATE.start_main_old_#valid#1| |#valid|) (= (select |#valid| |ULTIMATE.start_LDV_INIT_LIST_HEAD_~list#1.base|) 1) (<= (+ |ULTIMATE.start_LDV_INIT_LIST_HEAD_~list#1.offset| 8) (select |#length| |ULTIMATE.start_LDV_INIT_LIST_HEAD_~list#1.base|)) (<= 0 |ULTIMATE.start_LDV_INIT_LIST_HEAD_~list#1.offset|)) [2024-11-08 23:31:36,921 INFO L77 FloydHoareUtils]: At program point L540-1(line 540) the Hoare annotation is: (and (= |ULTIMATE.start_main_old_#valid#1| |#valid|) (= (select |#valid| |ULTIMATE.start_LDV_INIT_LIST_HEAD_~list#1.base|) 1) (<= (+ |ULTIMATE.start_LDV_INIT_LIST_HEAD_~list#1.offset| 8) (select |#length| |ULTIMATE.start_LDV_INIT_LIST_HEAD_~list#1.base|)) (<= 0 |ULTIMATE.start_LDV_INIT_LIST_HEAD_~list#1.offset|)) [2024-11-08 23:31:36,922 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:31:36,922 INFO L77 FloydHoareUtils]: At program point L771-9(lines 771 774) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |~#global_list_13~0.base|) 1)) (.cse1 (+ |ULTIMATE.start_free_13_~p~1#1.offset| 4))) (or (and (= |ULTIMATE.start_main_old_#valid#1| |#valid|) (= |ULTIMATE.start_free_13_~p~1#1.base| |~#global_list_13~0.base|) (<= 0 |~#global_list_13~0.offset|) .cse0 (<= (+ 8 |~#global_list_13~0.offset|) (select |#length| |~#global_list_13~0.base|)) (= .cse1 |~#global_list_13~0.offset|)) (let ((.cse4 (select |#memory_$Pointer$.base| |ULTIMATE.start_free_13_~p~1#1.base|)) (.cse2 (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_13_~p~1#1.base|))) (let ((.cse5 (select .cse2 .cse1)) (.cse3 (select .cse4 .cse1))) (and (<= (+ |ULTIMATE.start_free_13_~p~1#1.base| 1) |#StackHeapBarrier|) (= (select .cse2 8) |~#global_list_13~0.offset|) (= |ULTIMATE.start_free_13_~n~1#1.base| .cse3) (= (select .cse2 4) |~#global_list_13~0.offset|) (= (select .cse4 8) |~#global_list_13~0.base|) (= (store |#valid| |ULTIMATE.start_free_13_~p~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start_free_13_~n~1#1.base| |~#global_list_13~0.base|) .cse0 (= (select |#valid| |ULTIMATE.start_free_13_~p~1#1.base|) 1) (not (= |ULTIMATE.start_free_13_~p~1#1.base| |ULTIMATE.start_free_13_~n~1#1.base|)) (<= (+ 12 |ULTIMATE.start_free_13_~p~1#1.offset|) (select |#length| |ULTIMATE.start_free_13_~p~1#1.base|)) (= |ULTIMATE.start_free_13_~p~1#1.offset| 0) (<= 0 .cse5) (= (+ |ULTIMATE.start_free_13_~n~1#1.offset| 4) .cse5) (<= (+ 8 .cse5) (select |#length| .cse3)) (<= |~#global_list_13~0.offset| 0)))))) [2024-11-08 23:31:36,922 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:31:36,922 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:31:36,923 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:31:36,923 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:31:36,923 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE(line 773) no Hoare annotation was computed. [2024-11-08 23:31:36,923 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:31:36,924 INFO L77 FloydHoareUtils]: At program point L549(line 549) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start___ldv_list_add_~new#1.base|))) (let ((.cse2 (select |#memory_$Pointer$.offset| |ULTIMATE.start___ldv_list_add_~new#1.base|)) (.cse1 (select .cse0 8))) (and (= (select |#valid| |ULTIMATE.start___ldv_list_add_~new#1.base|) 1) (<= (+ 1 |ULTIMATE.start___ldv_list_add_~new#1.base|) |#StackHeapBarrier|) (= |ULTIMATE.start___ldv_list_add_~new#1.offset| 4) (<= 0 |ULTIMATE.start___ldv_list_add_~prev#1.offset|) (= (select .cse0 |ULTIMATE.start___ldv_list_add_~new#1.offset|) |~#global_list_13~0.base|) (= .cse1 |~#global_list_13~0.base|) (= (select |#valid| |~#global_list_13~0.base|) 1) (= |ULTIMATE.start___ldv_list_add_~prev#1.offset| |~#global_list_13~0.offset|) (= (select .cse2 8) |~#global_list_13~0.offset|) (= (store |#valid| |ULTIMATE.start___ldv_list_add_~new#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |~#global_list_13~0.offset| (select .cse2 |ULTIMATE.start___ldv_list_add_~new#1.offset|)) (<= (+ 8 |~#global_list_13~0.offset|) (select |#length| .cse1)) (not (= |~#global_list_13~0.base| |ULTIMATE.start___ldv_list_add_~new#1.base|)) (= |ULTIMATE.start___ldv_list_add_~prev#1.base| |~#global_list_13~0.base|) (<= |~#global_list_13~0.offset| 0) (<= (+ |ULTIMATE.start___ldv_list_add_~new#1.offset| 8) (select |#length| |ULTIMATE.start___ldv_list_add_~new#1.base|))))) [2024-11-08 23:31:36,924 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-08 23:31:36,924 INFO L77 FloydHoareUtils]: At program point L768(lines 768 775) the Hoare annotation is: (and (= |ULTIMATE.start_main_old_#valid#1| |#valid|) (<= 0 |~#global_list_13~0.offset|) (= (select |#valid| |~#global_list_13~0.base|) 1) (<= (+ 8 |~#global_list_13~0.offset|) (select |#length| |~#global_list_13~0.base|))) [2024-11-08 23:31:36,924 INFO L77 FloydHoareUtils]: At program point L764(lines 764 766) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_alloc_13_~p~0#1.base| 0)) (.cse3 (= |ULTIMATE.start_alloc_13_~p~0#1.offset| 0))) (let ((.cse0 (and .cse1 .cse3)) (.cse2 (select |#memory_$Pointer$.base| |~#global_list_13~0.base|))) (and (or (= (select |#valid| |ULTIMATE.start_alloc_13_~p~0#1.base|) 1) .cse0) (<= (+ |ULTIMATE.start_alloc_13_~p~0#1.base| 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) 0) 0) (or (= |ULTIMATE.start_main_old_#valid#1| |#valid|) (not .cse1)) (= (select .cse2 |~#global_list_13~0.offset|) |~#global_list_13~0.base|) (= (select |#valid| |~#global_list_13~0.base|) 1) (or .cse0 (and (= (select |#length| |ULTIMATE.start_alloc_13_~p~0#1.base|) 12) .cse3)) (= (select |#length| |~#global_list_13~0.base|) 8) (or .cse0 (= (store |#valid| |ULTIMATE.start_alloc_13_~p~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (= |~#global_list_13~0.offset| 0) (= 2 (select .cse2 0))))) [2024-11-08 23:31:36,924 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:31:36,925 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:31:36,925 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:31:36,925 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:31:36,925 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:31:36,925 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:31:36,925 INFO L77 FloydHoareUtils]: At program point L781(lines 781 783) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-08 23:31:36,926 INFO L77 FloydHoareUtils]: At program point L554(line 554) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_free_13_~n~1#1.offset| 4))) (and (= (select |#valid| |ULTIMATE.start___ldv_list_del_~prev#1.base|) 1) (not (= |ULTIMATE.start_free_13_~p~1#1.base| |ULTIMATE.start___ldv_list_del_~next#1.base|)) (= (select |#valid| |ULTIMATE.start___ldv_list_del_~next#1.base|) 1) (<= (+ |ULTIMATE.start_free_13_~p~1#1.base| 1) |#StackHeapBarrier|) (= .cse0 |~#global_list_13~0.offset|) (= (store |#valid| |ULTIMATE.start_free_13_~p~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start_free_13_~n~1#1.base| |ULTIMATE.start___ldv_list_del_~next#1.base|) (= |ULTIMATE.start_free_13_~n~1#1.base| |~#global_list_13~0.base|) (<= 0 |~#global_list_13~0.offset|) (<= (+ |ULTIMATE.start___ldv_list_del_~prev#1.offset| 8) (select |#length| |ULTIMATE.start___ldv_list_del_~prev#1.base|)) (= (select |#valid| |ULTIMATE.start_free_13_~p~1#1.base|) 1) (= |ULTIMATE.start_free_13_~p~1#1.offset| 0) (= .cse0 |ULTIMATE.start___ldv_list_del_~next#1.offset|) (<= 0 |ULTIMATE.start___ldv_list_del_~prev#1.offset|) (<= (+ 8 |~#global_list_13~0.offset|) (select |#length| |~#global_list_13~0.base|)) (<= |~#global_list_13~0.offset| 0))) [2024-11-08 23:31:36,926 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-08 23:31:36,926 INFO L77 FloydHoareUtils]: At program point L554-1(line 554) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_free_13_~n~1#1.offset| 4))) (and (= (select |#valid| |ULTIMATE.start___ldv_list_del_~prev#1.base|) 1) (not (= |ULTIMATE.start_free_13_~p~1#1.base| |ULTIMATE.start___ldv_list_del_~next#1.base|)) (= (select |#valid| |ULTIMATE.start___ldv_list_del_~next#1.base|) 1) (<= (+ |ULTIMATE.start_free_13_~p~1#1.base| 1) |#StackHeapBarrier|) (= .cse0 |~#global_list_13~0.offset|) (= (store |#valid| |ULTIMATE.start_free_13_~p~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start_free_13_~n~1#1.base| |ULTIMATE.start___ldv_list_del_~next#1.base|) (= |ULTIMATE.start_free_13_~n~1#1.base| |~#global_list_13~0.base|) (<= 0 |~#global_list_13~0.offset|) (<= (+ |ULTIMATE.start___ldv_list_del_~prev#1.offset| 8) (select |#length| |ULTIMATE.start___ldv_list_del_~prev#1.base|)) (= (select |#valid| |ULTIMATE.start_free_13_~p~1#1.base|) 1) (= |ULTIMATE.start_free_13_~p~1#1.offset| 0) (= .cse0 |ULTIMATE.start___ldv_list_del_~next#1.offset|) (<= 0 |ULTIMATE.start___ldv_list_del_~prev#1.offset|) (<= (+ 8 |~#global_list_13~0.offset|) (select |#length| |~#global_list_13~0.base|)) (<= |~#global_list_13~0.offset| 0))) [2024-11-08 23:31:36,926 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:31:36,927 INFO L77 FloydHoareUtils]: At program point L773(line 773) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_free_13_~n~1#1.offset| 4))) (and (<= (+ |ULTIMATE.start_free_13_~p~1#1.base| 1) |#StackHeapBarrier|) (= .cse0 |~#global_list_13~0.offset|) (= (select |#valid| |ULTIMATE.start_free_13_~n~1#1.base|) 1) (= (store |#valid| |ULTIMATE.start_free_13_~p~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start_free_13_~n~1#1.base| |~#global_list_13~0.base|) (= (select |#valid| |ULTIMATE.start_free_13_~p~1#1.base|) 1) (not (= |ULTIMATE.start_free_13_~p~1#1.base| |ULTIMATE.start_free_13_~n~1#1.base|)) (= |ULTIMATE.start_free_13_~p~1#1.offset| 0) (<= 0 .cse0) (<= (+ 8 |~#global_list_13~0.offset|) (select |#length| |~#global_list_13~0.base|)) (<= |~#global_list_13~0.offset| 0))) [2024-11-08 23:31:36,927 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE(line 773) no Hoare annotation was computed. [2024-11-08 23:31:36,927 INFO L77 FloydHoareUtils]: At program point L773-1(line 773) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_free_13_~n~1#1.offset| 4))) (and (<= (+ |ULTIMATE.start_free_13_~p~1#1.base| 1) |#StackHeapBarrier|) (= .cse0 |~#global_list_13~0.offset|) (= (select |#valid| |ULTIMATE.start_free_13_~n~1#1.base|) 1) (= (store |#valid| |ULTIMATE.start_free_13_~p~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start_free_13_~n~1#1.base| |~#global_list_13~0.base|) (= (select |#valid| |ULTIMATE.start_free_13_~p~1#1.base|) 1) (not (= |ULTIMATE.start_free_13_~p~1#1.base| |ULTIMATE.start_free_13_~n~1#1.base|)) (<= 0 .cse0) (<= (+ 8 |~#global_list_13~0.offset|) (select |#length| |~#global_list_13~0.base|)) (<= |~#global_list_13~0.offset| 0))) [2024-11-08 23:31:36,927 INFO L77 FloydHoareUtils]: At program point L773-2(line 773) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_free_13_~n~1#1.offset| 4))) (and (= .cse0 |~#global_list_13~0.offset|) (= (select |#valid| |ULTIMATE.start_free_13_~n~1#1.base|) 1) (= (store |#valid| |ULTIMATE.start_free_13_~p~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start_free_13_~n~1#1.base| |~#global_list_13~0.base|) (= (select |#valid| |ULTIMATE.start_free_13_~p~1#1.base|) 1) (not (= |ULTIMATE.start_free_13_~p~1#1.base| |ULTIMATE.start_free_13_~n~1#1.base|)) (<= 0 .cse0) (<= (+ 8 |~#global_list_13~0.offset|) (select |#length| |~#global_list_13~0.base|)) (<= |~#global_list_13~0.offset| 0))) [2024-11-08 23:31:36,928 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE(line 773) no Hoare annotation was computed. [2024-11-08 23:31:36,928 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:31:36,928 INFO L77 FloydHoareUtils]: At program point L567(line 567) the Hoare annotation is: (let ((.cse2 (select |#memory_$Pointer$.base| |ULTIMATE.start_ldv_list_del_~entry#1.base|)) (.cse4 (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_list_del_~entry#1.base|))) (let ((.cse3 (+ |ULTIMATE.start_free_13_~n~1#1.offset| 4)) (.cse0 (select .cse4 8)) (.cse1 (select .cse2 8))) (and (<= (+ .cse0 8) (select |#length| .cse1)) (<= (+ |ULTIMATE.start_free_13_~p~1#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| (select .cse2 |ULTIMATE.start_ldv_list_del_~entry#1.offset|)) 1) (= .cse3 |~#global_list_13~0.offset|) (= |ULTIMATE.start_free_13_~p~1#1.base| |ULTIMATE.start_ldv_list_del_~entry#1.base|) (= (store |#valid| |ULTIMATE.start_free_13_~p~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start_free_13_~n~1#1.base| |~#global_list_13~0.base|) (= (select |#valid| |ULTIMATE.start_free_13_~p~1#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_13_~p~1#1.base|) 4) |ULTIMATE.start_free_13_~n~1#1.base|) (not (= |ULTIMATE.start_free_13_~p~1#1.base| |ULTIMATE.start_free_13_~n~1#1.base|)) (= |ULTIMATE.start_free_13_~p~1#1.offset| 0) (= .cse3 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_13_~p~1#1.base|) (+ |ULTIMATE.start_free_13_~p~1#1.offset| 4))) (<= 0 .cse0) (<= (+ 8 |~#global_list_13~0.offset|) (select |#length| |~#global_list_13~0.base|)) (<= 0 (select .cse4 |ULTIMATE.start_ldv_list_del_~entry#1.offset|)) (<= |~#global_list_13~0.offset| 0) (= (select |#valid| .cse1) 1) (= |ULTIMATE.start_ldv_list_del_~entry#1.offset| 4) (<= (+ |ULTIMATE.start_ldv_list_del_~entry#1.offset| 8) (select |#length| |ULTIMATE.start_ldv_list_del_~entry#1.base|))))) [2024-11-08 23:31:36,929 INFO L77 FloydHoareUtils]: At program point L567-1(line 567) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_free_13_~n~1#1.offset| 4))) (and (= (select |#valid| |ULTIMATE.start_ldv_list_del_#t~mem16#1.base|) 1) (<= (+ |ULTIMATE.start_free_13_~p~1#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_ldv_list_del_~entry#1.base|) |ULTIMATE.start_ldv_list_del_~entry#1.offset|)) 1) (<= (+ |ULTIMATE.start_ldv_list_del_#t~mem16#1.offset| 8) (select |#length| |ULTIMATE.start_ldv_list_del_#t~mem16#1.base|)) (= .cse0 |~#global_list_13~0.offset|) (= |ULTIMATE.start_free_13_~p~1#1.base| |ULTIMATE.start_ldv_list_del_~entry#1.base|) (= (store |#valid| |ULTIMATE.start_free_13_~p~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start_free_13_~n~1#1.base| |~#global_list_13~0.base|) (= (select |#valid| |ULTIMATE.start_free_13_~p~1#1.base|) 1) (<= 0 |ULTIMATE.start_ldv_list_del_#t~mem16#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_13_~p~1#1.base|) 4) |ULTIMATE.start_free_13_~n~1#1.base|) (not (= |ULTIMATE.start_free_13_~p~1#1.base| |ULTIMATE.start_free_13_~n~1#1.base|)) (= |ULTIMATE.start_free_13_~p~1#1.offset| 0) (= .cse0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_13_~p~1#1.base|) (+ |ULTIMATE.start_free_13_~p~1#1.offset| 4))) (<= (+ 8 |~#global_list_13~0.offset|) (select |#length| |~#global_list_13~0.base|)) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_list_del_~entry#1.base|) |ULTIMATE.start_ldv_list_del_~entry#1.offset|)) (<= |~#global_list_13~0.offset| 0) (= |ULTIMATE.start_ldv_list_del_~entry#1.offset| 4) (<= (+ |ULTIMATE.start_ldv_list_del_~entry#1.offset| 8) (select |#length| |ULTIMATE.start_ldv_list_del_~entry#1.base|)))) [2024-11-08 23:31:36,929 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:31:36,929 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:31:36,929 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:31:36,929 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:31:36,930 INFO L77 FloydHoareUtils]: At program point L559(line 559) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_ldv_list_add_~new#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_ldv_list_add_~head#1.base|) 1) (= 12 (select |#length| |ULTIMATE.start_ldv_list_add_~new#1.base|)) (= (select |#length| |ULTIMATE.start_ldv_list_add_~head#1.base|) 8) (= 4 |ULTIMATE.start_ldv_list_add_~new#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_list_add_~head#1.base|) |ULTIMATE.start_ldv_list_add_~head#1.offset|) 0) (= (store |#valid| |ULTIMATE.start_ldv_list_add_~new#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |~#global_list_13~0.offset| |ULTIMATE.start_ldv_list_add_~head#1.offset|) (= |~#global_list_13~0.offset| 0) (= |ULTIMATE.start_ldv_list_add_~head#1.base| |~#global_list_13~0.base|) (= (select |#valid| |ULTIMATE.start_ldv_list_add_~new#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_ldv_list_add_~head#1.base|) |ULTIMATE.start_ldv_list_add_~head#1.offset|) |ULTIMATE.start_ldv_list_add_~head#1.base|)) [2024-11-08 23:31:36,930 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:31:36,930 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:31:36,930 INFO L77 FloydHoareUtils]: At program point L547(line 547) the Hoare annotation is: (and (= (select |#length| |ULTIMATE.start___ldv_list_add_~next#1.base|) 8) (= |ULTIMATE.start___ldv_list_add_~prev#1.offset| 0) (= (select |#valid| |ULTIMATE.start___ldv_list_add_~new#1.base|) 1) (<= (+ 1 |ULTIMATE.start___ldv_list_add_~new#1.base|) |#StackHeapBarrier|) (= |ULTIMATE.start___ldv_list_add_~new#1.offset| 4) (= (select |#length| |ULTIMATE.start___ldv_list_add_~new#1.base|) 12) (= |ULTIMATE.start___ldv_list_add_~prev#1.offset| |~#global_list_13~0.offset|) (= (select |#valid| |ULTIMATE.start___ldv_list_add_~next#1.base|) 1) (= (store |#valid| |ULTIMATE.start___ldv_list_add_~new#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start___ldv_list_add_~next#1.offset| 0) (= |ULTIMATE.start___ldv_list_add_~prev#1.base| |~#global_list_13~0.base|) (= |~#global_list_13~0.base| |ULTIMATE.start___ldv_list_add_~next#1.base|)) [2024-11-08 23:31:36,930 INFO L77 FloydHoareUtils]: At program point L547-1(line 547) the Hoare annotation is: (and (<= (+ |ULTIMATE.start___ldv_list_add_~next#1.offset| 8) (select |#length| |ULTIMATE.start___ldv_list_add_~next#1.base|)) (= |ULTIMATE.start___ldv_list_add_~next#1.offset| |~#global_list_13~0.offset|) (= (select |#valid| |ULTIMATE.start___ldv_list_add_~new#1.base|) 1) (<= (+ 1 |ULTIMATE.start___ldv_list_add_~new#1.base|) |#StackHeapBarrier|) (= |ULTIMATE.start___ldv_list_add_~new#1.offset| 4) (<= 0 |ULTIMATE.start___ldv_list_add_~prev#1.offset|) (= (select |#length| |ULTIMATE.start___ldv_list_add_~new#1.base|) 12) (= (select |#valid| |~#global_list_13~0.base|) 1) (= |ULTIMATE.start___ldv_list_add_~prev#1.offset| |~#global_list_13~0.offset|) (= (store |#valid| |ULTIMATE.start___ldv_list_add_~new#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |~#global_list_13~0.base| |ULTIMATE.start___ldv_list_add_~new#1.base|)) (= |ULTIMATE.start___ldv_list_add_~prev#1.base| |~#global_list_13~0.base|) (<= |~#global_list_13~0.offset| 0) (= |~#global_list_13~0.base| |ULTIMATE.start___ldv_list_add_~next#1.base|)) [2024-11-08 23:31:36,941 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-08 23:31:36,941 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 23:31:36,943 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~p~1!base [2024-11-08 23:31:36,943 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#global_list_13~0!base [2024-11-08 23:31:36,944 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#global_list_13~0!offset [2024-11-08 23:31:36,944 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 23:31:36,945 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-08 23:31:36,945 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#global_list_13~0!offset [2024-11-08 23:31:36,945 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-08 23:31:36,945 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-08 23:31:36,945 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~p~1!offset [2024-11-08 23:31:36,946 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#global_list_13~0!offset [2024-11-08 23:31:36,946 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~p~1!base [2024-11-08 23:31:36,946 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-08 23:31:36,946 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset [2024-11-08 23:31:36,946 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] [2024-11-08 23:31:36,947 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~p~1!base,]]] [2024-11-08 23:31:36,947 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#global_list_13~0!offset [2024-11-08 23:31:36,947 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~n~1!base [2024-11-08 23:31:36,947 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-11-08 23:31:36,947 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-11-08 23:31:36,948 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~p~1!base,]]] [2024-11-08 23:31:36,948 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset [2024-11-08 23:31:36,948 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] [2024-11-08 23:31:36,948 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~p~1!base,]]] [2024-11-08 23:31:36,948 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#global_list_13~0!offset [2024-11-08 23:31:36,949 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-11-08 23:31:36,949 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-11-08 23:31:36,949 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~p~1!base,]]] [2024-11-08 23:31:36,949 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#global_list_13~0!base [2024-11-08 23:31:36,949 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-08 23:31:36,949 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-08 23:31:36,950 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~n~1!base [2024-11-08 23:31:36,950 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#global_list_13~0!base [2024-11-08 23:31:36,950 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 23:31:36,950 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-08 23:31:36,950 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 23:31:36,951 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-08 23:31:36,951 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~p~1!base [2024-11-08 23:31:36,951 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~n~1!base [2024-11-08 23:31:36,951 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~p~1!offset [2024-11-08 23:31:36,951 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-08 23:31:36,951 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-08 23:31:36,952 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~p~1!offset [2024-11-08 23:31:36,952 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset [2024-11-08 23:31:36,952 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] [2024-11-08 23:31:36,952 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~p~1!base,]]] [2024-11-08 23:31:36,952 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~n~1!offset [2024-11-08 23:31:36,953 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset [2024-11-08 23:31:36,953 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] [2024-11-08 23:31:36,953 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~p~1!base,]]] [2024-11-08 23:31:36,953 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset [2024-11-08 23:31:36,953 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] [2024-11-08 23:31:36,953 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~p~1!base,]]] [2024-11-08 23:31:36,954 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-08 23:31:36,954 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-08 23:31:36,954 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#global_list_13~0!offset [2024-11-08 23:31:36,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 11:31:36 ImpRootNode [2024-11-08 23:31:36,956 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 23:31:36,956 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:31:36,957 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:31:36,957 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:31:36,957 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:24:24" (3/4) ... [2024-11-08 23:31:36,960 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 23:31:36,967 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2024-11-08 23:31:36,967 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-08 23:31:36,967 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 23:31:37,080 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed837001-66db-4678-8d84-b75b9ccc93b5/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 23:31:37,081 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed837001-66db-4678-8d84-b75b9ccc93b5/bin/ukojak-verify-ImItNfHLgk/witness.yml [2024-11-08 23:31:37,081 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:31:37,082 INFO L158 Benchmark]: Toolchain (without parser) took 434013.21ms. Allocated memory was 169.9MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 138.7MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 388.3MB. Max. memory is 16.1GB. [2024-11-08 23:31:37,082 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 119.5MB. Free memory is still 93.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:31:37,082 INFO L158 Benchmark]: CACSL2BoogieTranslator took 748.77ms. Allocated memory is still 169.9MB. Free memory was 138.7MB in the beginning and 113.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-08 23:31:37,082 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.29ms. Allocated memory is still 169.9MB. Free memory was 113.5MB in the beginning and 111.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:31:37,083 INFO L158 Benchmark]: Boogie Preprocessor took 42.06ms. Allocated memory is still 169.9MB. Free memory was 111.4MB in the beginning and 109.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:31:37,083 INFO L158 Benchmark]: RCFGBuilder took 634.25ms. Allocated memory is still 169.9MB. Free memory was 109.3MB in the beginning and 80.6MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-08 23:31:37,083 INFO L158 Benchmark]: CodeCheck took 432386.02ms. Allocated memory was 169.9MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 80.6MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 323.3MB. Max. memory is 16.1GB. [2024-11-08 23:31:37,084 INFO L158 Benchmark]: Witness Printer took 124.56ms. Allocated memory is still 1.9GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 23:31:37,086 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, 57 locations, 32 error locations. Started 1 CEGAR loops. OverallTime: 426.5s, OverallIterations: 57, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7697 SdHoareTripleChecker+Valid, 72.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7048 mSDsluCounter, 2946 SdHoareTripleChecker+Invalid, 64.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2628 mSDsCounter, 8938 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36660 IncrementalHoareTripleChecker+Invalid, 45598 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8938 mSolverCounterUnsat, 318 mSDtfsCounter, 36660 mSolverCounterSat, 0.9s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6791 GetRequests, 5371 SyntacticMatches, 244 SemanticMatches, 1176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705097 ImplicationChecksByTransitivity, 408.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 77.8s InterpolantComputationTime, 701 NumberOfCodeBlocks, 701 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 645 ConstructedInterpolants, 0 QuantifiedInterpolants, 7724 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 56 InterpolantComputations, 51 PerfectInterpolantSequences, 10/17 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: -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: 773]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 773]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 773]: free always succeeds For all program executions holds that free 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: 781]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 32 specifications checked. All of them hold * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 119.5MB. Free memory is still 93.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 748.77ms. Allocated memory is still 169.9MB. Free memory was 138.7MB in the beginning and 113.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.29ms. Allocated memory is still 169.9MB. Free memory was 113.5MB in the beginning and 111.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.06ms. Allocated memory is still 169.9MB. Free memory was 111.4MB in the beginning and 109.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 634.25ms. Allocated memory is still 169.9MB. Free memory was 109.3MB in the beginning and 80.6MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * CodeCheck took 432386.02ms. Allocated memory was 169.9MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 80.6MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 323.3MB. Max. memory is 16.1GB. * Witness Printer took 124.56ms. Allocated memory is still 1.9GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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: ~p~1!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#global_list_13~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#global_list_13~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: ~#global_list_13~0!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: ~p~1!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#global_list_13~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~p~1!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~p~1!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#global_list_13~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~n~1!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~p~1!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~p~1!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#global_list_13~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~p~1!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#global_list_13~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~n~1!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#global_list_13~0!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: ~p~1!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~n~1!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~p~1!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: ~p~1!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~p~1!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~n~1!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~p~1!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~p~1!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: ~#global_list_13~0!offset RESULT: Ultimate proved your program to be correct! [2024-11-08 23:31:37,130 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed837001-66db-4678-8d84-b75b9ccc93b5/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