./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-15/cstrcspn_reverse_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f55d9f0-44b0-4661-b877-ddeeb8a2c49f/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f55d9f0-44b0-4661-b877-ddeeb8a2c49f/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_1f55d9f0-44b0-4661-b877-ddeeb8a2c49f/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f55d9f0-44b0-4661-b877-ddeeb8a2c49f/bin/ukojak-verify-ImItNfHLgk/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-15/cstrcspn_reverse_alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f55d9f0-44b0-4661-b877-ddeeb8a2c49f/bin/ukojak-verify-ImItNfHLgk/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f55d9f0-44b0-4661-b877-ddeeb8a2c49f/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 64bit --witnessprinter.graph.data.programhash cbd0b45e3a19519452fbcf6fd1c6a1f47a14b8d70acc30b1e21888135763cd85 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 00:35:31,107 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:35:31,183 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f55d9f0-44b0-4661-b877-ddeeb8a2c49f/bin/ukojak-verify-ImItNfHLgk/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf [2024-11-09 00:35:31,190 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:35:31,192 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-09 00:35:31,231 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:35:31,234 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:35:31,235 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:35:31,236 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:35:31,238 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:35:31,239 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:35:31,240 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 00:35:31,240 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 00:35:31,240 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 00:35:31,244 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:35:31,245 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:35:31,245 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 00:35:31,245 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:35:31,246 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-09 00:35:31,246 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-09 00:35:31,247 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-09 00:35:31,249 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:35:31,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:35:31,250 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:35:31,251 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:35:31,251 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-09 00:35:31,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:35:31,252 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_1f55d9f0-44b0-4661-b877-ddeeb8a2c49f/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_1f55d9f0-44b0-4661-b877-ddeeb8a2c49f/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cbd0b45e3a19519452fbcf6fd1c6a1f47a14b8d70acc30b1e21888135763cd85 [2024-11-09 00:35:31,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:35:31,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:35:31,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:35:31,652 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:35:31,653 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:35:31,655 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f55d9f0-44b0-4661-b877-ddeeb8a2c49f/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/termination-15/cstrcspn_reverse_alloca.i Unable to find full path for "g++" [2024-11-09 00:35:33,892 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:35:34,304 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:35:34,305 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f55d9f0-44b0-4661-b877-ddeeb8a2c49f/sv-benchmarks/c/termination-15/cstrcspn_reverse_alloca.i [2024-11-09 00:35:34,323 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f55d9f0-44b0-4661-b877-ddeeb8a2c49f/bin/ukojak-verify-ImItNfHLgk/data/8bc5dafec/0e8f632f9bc644289ede07b3bfbe8690/FLAG4fcf918b4 [2024-11-09 00:35:34,571 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f55d9f0-44b0-4661-b877-ddeeb8a2c49f/bin/ukojak-verify-ImItNfHLgk/data/8bc5dafec/0e8f632f9bc644289ede07b3bfbe8690 [2024-11-09 00:35:34,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:35:34,576 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:35:34,580 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:35:34,581 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:35:34,591 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:35:34,596 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:35:34" (1/1) ... [2024-11-09 00:35:34,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13247a42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:34, skipping insertion in model container [2024-11-09 00:35:34,600 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:35:34" (1/1) ... [2024-11-09 00:35:34,672 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:35:35,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:35:35,099 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:35:35,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:35:35,242 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:35:35,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:35 WrapperNode [2024-11-09 00:35:35,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:35:35,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:35:35,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:35:35,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:35:35,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:35" (1/1) ... [2024-11-09 00:35:35,272 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:35" (1/1) ... [2024-11-09 00:35:35,300 INFO L138 Inliner]: procedures = 152, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2024-11-09 00:35:35,300 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:35:35,301 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:35:35,302 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:35:35,302 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:35:35,312 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:35" (1/1) ... [2024-11-09 00:35:35,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:35" (1/1) ... [2024-11-09 00:35:35,316 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:35" (1/1) ... [2024-11-09 00:35:35,316 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:35" (1/1) ... [2024-11-09 00:35:35,331 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:35" (1/1) ... [2024-11-09 00:35:35,338 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:35" (1/1) ... [2024-11-09 00:35:35,339 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:35" (1/1) ... [2024-11-09 00:35:35,341 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:35" (1/1) ... [2024-11-09 00:35:35,343 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:35:35,344 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:35:35,345 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:35:35,345 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:35:35,346 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:35" (1/1) ... [2024-11-09 00:35:35,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:35:35,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f55d9f0-44b0-4661-b877-ddeeb8a2c49f/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-09 00:35:35,393 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f55d9f0-44b0-4661-b877-ddeeb8a2c49f/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-09 00:35:35,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f55d9f0-44b0-4661-b877-ddeeb8a2c49f/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-09 00:35:35,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 00:35:35,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 00:35:35,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 00:35:35,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 00:35:35,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:35:35,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:35:35,539 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:35:35,541 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:35:35,791 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2024-11-09 00:35:35,791 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:35:35,866 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:35:35,866 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 00:35:35,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:35:35 BoogieIcfgContainer [2024-11-09 00:35:35,867 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:35:35,868 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-09 00:35:35,868 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-09 00:35:35,880 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-09 00:35:35,880 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:35:35" (1/1) ... [2024-11-09 00:35:35,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:35:35,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:35,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 31 states and 36 transitions. [2024-11-09 00:35:35,958 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2024-11-09 00:35:35,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-09 00:35:35,960 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:35,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:36,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:35:36,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:36,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 30 states and 35 transitions. [2024-11-09 00:35:36,411 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-11-09 00:35:36,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-09 00:35:36,414 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:36,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:36,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:35:36,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:36,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 29 states and 34 transitions. [2024-11-09 00:35:36,950 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2024-11-09 00:35:36,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 00:35:36,953 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:36,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:37,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:35:37,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:37,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 28 states and 33 transitions. [2024-11-09 00:35:37,213 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2024-11-09 00:35:37,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 00:35:37,214 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:37,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:37,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:37,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:35:37,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:37,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 27 states and 32 transitions. [2024-11-09 00:35:37,784 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-11-09 00:35:37,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 00:35:37,784 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:37,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:37,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:37,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:35:38,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:38,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 28 states and 33 transitions. [2024-11-09 00:35:38,061 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2024-11-09 00:35:38,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 00:35:38,062 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:38,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:38,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:38,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:35:39,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:39,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 29 states and 34 transitions. [2024-11-09 00:35:39,624 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2024-11-09 00:35:39,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 00:35:39,624 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:39,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:39,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:35:39,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:39,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 28 states and 33 transitions. [2024-11-09 00:35:39,681 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2024-11-09 00:35:39,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 00:35:39,682 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:39,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:39,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:35:39,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:39,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 27 states and 32 transitions. [2024-11-09 00:35:39,745 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-11-09 00:35:39,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 00:35:39,745 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:39,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:39,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:35:40,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:40,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 31 states and 38 transitions. [2024-11-09 00:35:40,505 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2024-11-09 00:35:40,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 00:35:40,505 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:40,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:41,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:35:43,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:43,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 35 states and 44 transitions. [2024-11-09 00:35:43,245 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2024-11-09 00:35:43,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 00:35:43,246 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:43,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:43,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:35:45,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:45,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 40 states and 54 transitions. [2024-11-09 00:35:45,138 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2024-11-09 00:35:45,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 00:35:45,139 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:45,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:45,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:35:45,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:45,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 39 states and 53 transitions. [2024-11-09 00:35:45,193 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2024-11-09 00:35:45,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 00:35:45,194 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:45,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:45,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:35:45,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:45,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 38 states and 52 transitions. [2024-11-09 00:35:45,280 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2024-11-09 00:35:45,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 00:35:45,280 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:45,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:45,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:45,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:35:45,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:45,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 37 states and 50 transitions. [2024-11-09 00:35:45,339 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2024-11-09 00:35:45,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 00:35:45,340 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:45,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:45,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:35:45,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:45,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 36 states and 49 transitions. [2024-11-09 00:35:45,405 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2024-11-09 00:35:45,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 00:35:45,406 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:45,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:45,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:35:45,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:45,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 37 states and 50 transitions. [2024-11-09 00:35:45,915 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2024-11-09 00:35:45,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 00:35:45,915 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:45,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:46,892 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-09 00:35:50,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:50,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 44 states and 62 transitions. [2024-11-09 00:35:50,412 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2024-11-09 00:35:50,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 00:35:50,412 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:50,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:51,416 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-09 00:35:58,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:58,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 52 states and 85 transitions. [2024-11-09 00:35:58,780 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 85 transitions. [2024-11-09 00:35:58,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 00:35:58,781 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:58,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:58,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:36:01,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:01,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 57 states and 95 transitions. [2024-11-09 00:36:01,531 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 95 transitions. [2024-11-09 00:36:01,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 00:36:01,532 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:01,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:01,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:02,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:36:08,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:08,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 63 states and 106 transitions. [2024-11-09 00:36:08,916 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 106 transitions. [2024-11-09 00:36:08,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 00:36:08,917 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:08,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:08,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:36:09,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:09,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 64 states and 109 transitions. [2024-11-09 00:36:09,752 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 109 transitions. [2024-11-09 00:36:09,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 00:36:09,753 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:09,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:09,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:10,002 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-09 00:36:10,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:10,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 65 states and 110 transitions. [2024-11-09 00:36:10,971 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 110 transitions. [2024-11-09 00:36:10,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 00:36:10,972 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:10,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:11,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:36:17,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:17,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 72 states and 123 transitions. [2024-11-09 00:36:17,916 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 123 transitions. [2024-11-09 00:36:17,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 00:36:17,917 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:17,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:18,921 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:36:26,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:26,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 77 states and 135 transitions. [2024-11-09 00:36:26,225 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 135 transitions. [2024-11-09 00:36:26,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 00:36:26,226 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:26,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:26,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:26,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 00:36:32,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:32,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 82 states and 146 transitions. [2024-11-09 00:36:32,936 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 146 transitions. [2024-11-09 00:36:32,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 00:36:32,937 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:32,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:35,452 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:36:47,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:47,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 87 states and 163 transitions. [2024-11-09 00:36:47,756 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 163 transitions. [2024-11-09 00:36:47,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 00:36:47,757 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:47,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:48,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 00:36:51,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:51,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 90 states and 166 transitions. [2024-11-09 00:36:51,876 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 166 transitions. [2024-11-09 00:36:51,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 00:36:51,877 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:51,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:52,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:36:53,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:53,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 91 states and 168 transitions. [2024-11-09 00:36:53,592 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 168 transitions. [2024-11-09 00:36:53,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 00:36:53,593 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:53,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:53,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 00:36:58,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:58,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 91 states and 164 transitions. [2024-11-09 00:36:58,840 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 164 transitions. [2024-11-09 00:36:58,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 00:36:58,841 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:58,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:59,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 00:37:00,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:37:00,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 92 states and 164 transitions. [2024-11-09 00:37:00,292 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 164 transitions. [2024-11-09 00:37:00,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 00:37:00,292 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:37:00,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:37:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:37:00,339 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 00:37:01,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:37:01,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 93 states and 166 transitions. [2024-11-09 00:37:01,857 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 166 transitions. [2024-11-09 00:37:01,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 00:37:01,858 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:37:01,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:37:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:37:01,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 00:37:06,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:37:06,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 96 states and 173 transitions. [2024-11-09 00:37:06,118 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 173 transitions. [2024-11-09 00:37:06,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 00:37:06,118 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:37:06,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:37:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:37:06,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 00:37:07,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:37:07,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 97 states and 173 transitions. [2024-11-09 00:37:07,675 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 173 transitions. [2024-11-09 00:37:07,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 00:37:07,675 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:37:07,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:37:07,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:37:08,948 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:37:18,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:37:18,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 103 states and 186 transitions. [2024-11-09 00:37:18,774 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 186 transitions. [2024-11-09 00:37:18,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 00:37:18,774 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:37:18,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:37:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:37:21,781 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:37:32,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:37:32,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 107 states and 201 transitions. [2024-11-09 00:37:32,518 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 201 transitions. [2024-11-09 00:37:32,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 00:37:32,519 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:37:32,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:37:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:37:34,930 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:37:45,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:37:45,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 111 states and 215 transitions. [2024-11-09 00:37:45,865 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 215 transitions. [2024-11-09 00:37:45,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 00:37:45,865 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:37:45,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:37:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:37:45,917 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 00:37:47,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:37:47,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 112 states and 215 transitions. [2024-11-09 00:37:47,626 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 215 transitions. [2024-11-09 00:37:47,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 00:37:47,627 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:37:47,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:37:47,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:37:50,472 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:38:07,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:38:07,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 120 states and 238 transitions. [2024-11-09 00:38:07,831 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 238 transitions. [2024-11-09 00:38:07,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 00:38:07,832 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:38:07,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:38:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:38:10,696 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:38:19,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:38:19,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 125 states and 250 transitions. [2024-11-09 00:38:19,521 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 250 transitions. [2024-11-09 00:38:19,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 00:38:19,522 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:38:19,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:38:19,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:38:19,718 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:38:30,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:38:30,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 131 states and 270 transitions. [2024-11-09 00:38:30,810 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 270 transitions. [2024-11-09 00:38:30,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 00:38:30,810 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:38:30,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:38:30,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:38:30,882 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 00:38:33,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:38:33,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 131 states and 269 transitions. [2024-11-09 00:38:33,223 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 269 transitions. [2024-11-09 00:38:33,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 00:38:33,224 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:38:33,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:38:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:38:34,971 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:38:38,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:38:38,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 132 states and 275 transitions. [2024-11-09 00:38:38,771 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 275 transitions. [2024-11-09 00:38:38,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 00:38:38,771 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:38:38,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:38:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:38:41,618 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:38:46,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:38:46,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 133 states and 277 transitions. [2024-11-09 00:38:46,539 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 277 transitions. [2024-11-09 00:38:46,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 00:38:46,540 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:38:46,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:38:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:38:46,968 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:38:53,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:38:53,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 136 states and 286 transitions. [2024-11-09 00:38:53,507 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 286 transitions. [2024-11-09 00:38:53,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 00:38:53,508 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:38:53,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:38:53,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:38:53,843 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:38:56,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:38:56,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 137 states and 293 transitions. [2024-11-09 00:38:56,219 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 293 transitions. [2024-11-09 00:38:56,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 00:38:56,219 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:38:56,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:38:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:38:56,273 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 00:39:06,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:39:06,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 143 states and 308 transitions. [2024-11-09 00:39:06,230 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 308 transitions. [2024-11-09 00:39:06,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 00:39:06,231 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:39:06,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:39:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:39:06,418 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:39:08,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:39:08,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 144 states and 313 transitions. [2024-11-09 00:39:08,814 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 313 transitions. [2024-11-09 00:39:08,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 00:39:08,814 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:39:08,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:39:08,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:39:10,371 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:39:13,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:39:13,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 145 states and 315 transitions. [2024-11-09 00:39:13,781 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 315 transitions. [2024-11-09 00:39:13,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 00:39:13,781 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:39:13,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:39:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:39:16,532 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:39:49,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:39:49,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 159 states and 355 transitions. [2024-11-09 00:39:49,462 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 355 transitions. [2024-11-09 00:39:49,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 00:39:49,463 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:39:49,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:39:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:39:52,029 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 00:40:09,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:09,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 165 states and 377 transitions. [2024-11-09 00:40:09,064 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 377 transitions. [2024-11-09 00:40:09,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 00:40:09,065 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:09,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:09,267 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 00:40:21,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:21,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 170 states and 389 transitions. [2024-11-09 00:40:21,335 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 389 transitions. [2024-11-09 00:40:21,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 00:40:21,336 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:21,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:21,632 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 00:40:24,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:24,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 171 states and 391 transitions. [2024-11-09 00:40:24,272 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 391 transitions. [2024-11-09 00:40:24,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 00:40:24,273 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:24,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:24,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:24,409 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 00:40:51,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:51,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 182 states and 431 transitions. [2024-11-09 00:40:51,935 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 431 transitions. [2024-11-09 00:40:51,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 00:40:51,935 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:51,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:52,180 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 00:40:57,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:57,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 184 states and 438 transitions. [2024-11-09 00:40:57,243 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 438 transitions. [2024-11-09 00:40:57,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 00:40:57,244 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:57,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:57,384 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 00:41:00,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:00,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 185 states and 439 transitions. [2024-11-09 00:41:00,382 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 439 transitions. [2024-11-09 00:41:00,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 00:41:00,383 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:00,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:01,396 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 00:41:15,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:15,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 190 states and 456 transitions. [2024-11-09 00:41:15,925 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 456 transitions. [2024-11-09 00:41:15,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 00:41:15,925 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:15,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:16,077 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 00:41:18,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:18,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 191 states and 459 transitions. [2024-11-09 00:41:18,733 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 459 transitions. [2024-11-09 00:41:18,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 00:41:18,733 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:18,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:18,965 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 00:41:21,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:21,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 192 states and 459 transitions. [2024-11-09 00:41:21,818 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 459 transitions. [2024-11-09 00:41:21,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 00:41:21,819 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:21,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:21,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:22,051 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:41:47,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:47,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 202 states and 488 transitions. [2024-11-09 00:41:47,652 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 488 transitions. [2024-11-09 00:41:47,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 00:41:47,652 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:47,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:47,881 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:41:52,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:52,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 204 states and 495 transitions. [2024-11-09 00:41:52,883 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 495 transitions. [2024-11-09 00:41:52,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 00:41:52,883 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:52,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:53,030 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 00:41:55,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:55,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 205 states and 497 transitions. [2024-11-09 00:41:55,488 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 497 transitions. [2024-11-09 00:41:55,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 00:41:55,489 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:55,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:55,828 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:41:58,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:58,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 206 states and 502 transitions. [2024-11-09 00:41:58,307 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 502 transitions. [2024-11-09 00:41:58,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 00:41:58,307 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:58,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:58,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:58,459 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 00:42:06,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:42:06,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 209 states and 512 transitions. [2024-11-09 00:42:06,226 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 512 transitions. [2024-11-09 00:42:06,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 00:42:06,226 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:42:06,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:42:06,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:42:09,857 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 14 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:42:15,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:42:15,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 210 states and 513 transitions. [2024-11-09 00:42:15,507 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 513 transitions. [2024-11-09 00:42:15,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 00:42:15,508 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:42:15,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:42:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:42:15,562 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-09 00:42:18,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:42:18,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 211 states and 514 transitions. [2024-11-09 00:42:18,038 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 514 transitions. [2024-11-09 00:42:18,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 00:42:18,038 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:42:18,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:42:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:42:20,704 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 00:42:33,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:42:33,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 25 states and 32 transitions. [2024-11-09 00:42:33,772 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2024-11-09 00:42:33,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 00:42:33,773 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 67 iterations. [2024-11-09 00:42:33,780 INFO L729 CodeCheckObserver]: All specifications hold 15 specifications checked. All of them hold [2024-11-09 00:42:42,433 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:42:42,433 INFO L77 FloydHoareUtils]: At program point L374(lines 374 375) the Hoare annotation is: (let ((.cse0 (= (store (store |#valid| |ULTIMATE.start_main_#t~malloc216#1.base| 0) |ULTIMATE.start_main_#t~malloc215#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse1 (= (select |#valid| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1)) (.cse2 (not (= |ULTIMATE.start_main_#t~malloc215#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))) (.cse3 (<= 1 |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|)) (.cse4 (<= (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)))) (or (and .cse0 (<= (+ |ULTIMATE.start_cstrcspn_~s2#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s2#1.base|)) .cse1 .cse2 (= (select |#valid| |ULTIMATE.start_cstrcspn_~s2#1.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 0) 0) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) 0) 0) (<= 0 |ULTIMATE.start_cstrcspn_~s2#1.offset|) .cse3 .cse4) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_cstrcspn_#t~mem211#1| |ULTIMATE.start_cstrcspn_~c~0#1|) .cse3 .cse4))) [2024-11-09 00:42:42,433 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:42:42,433 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:42:42,434 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:42:42,434 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 379 395) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-09 00:42:42,434 INFO L77 FloydHoareUtils]: At program point cstrcspn_returnLabel#1(lines 364 378) the Hoare annotation is: (and (= (store (store |#valid| |ULTIMATE.start_main_#t~malloc216#1.base| 0) |ULTIMATE.start_main_#t~malloc215#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_#t~malloc215#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))) [2024-11-09 00:42:42,434 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:42:42,434 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:42:42,434 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:42:42,434 INFO L77 FloydHoareUtils]: At program point L371(line 371) the Hoare annotation is: (let ((.cse0 (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|))) (and (= |ULTIMATE.start_cstrcspn_~s~0#1.offset| |ULTIMATE.start_cstrcspn_~s2#1.offset|) (= (store (store |#valid| |ULTIMATE.start_main_#t~malloc216#1.base| 0) |ULTIMATE.start_main_#t~malloc215#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= (select |#valid| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1) (not (= |ULTIMATE.start_main_#t~malloc215#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|)) (<= (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) (<= 0 |ULTIMATE.start_cstrcspn_~s~0#1.offset|) (= (select .cse0 0) 0) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) 0) 0) (not (= (select .cse0 |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) 0)) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|) (<= 1 |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (= (select |#valid| |ULTIMATE.start_cstrcspn_~s~0#1.base|) 1) (<= (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)))) [2024-11-09 00:42:42,435 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:42:42,435 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-09 00:42:42,435 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:42:42,435 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:42:42,435 INFO L77 FloydHoareUtils]: At program point L372-2(line 372) the Hoare annotation is: (let ((.cse19 (select |#memory_int| |ULTIMATE.start_cstrcspn_~s~0#1.base|))) (let ((.cse11 (select .cse19 |ULTIMATE.start_cstrcspn_~s~0#1.offset|)) (.cse17 (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|)) (.cse18 (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1))) (let ((.cse0 (not (= |ULTIMATE.start_cstrcspn_~c~0#1| 0))) (.cse1 (= (select .cse19 0) 0)) (.cse2 (= (store (store |#valid| |ULTIMATE.start_main_#t~malloc216#1.base| 0) |ULTIMATE.start_main_#t~malloc215#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse3 (<= (+ |ULTIMATE.start_cstrcspn_~s2#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s2#1.base|))) (.cse4 (= (select |#valid| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1)) (.cse5 (not (= |ULTIMATE.start_main_#t~malloc215#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))) (.cse6 (<= .cse18 (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|))) (.cse7 (<= 0 |ULTIMATE.start_cstrcspn_~s~0#1.offset|)) (.cse12 (not |ULTIMATE.start_cstrcspn_#t~short209#1|)) (.cse8 (= (select |#valid| |ULTIMATE.start_cstrcspn_~s2#1.base|) 1)) (.cse9 (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 0) 0)) (.cse10 (= (select .cse17 0) 0)) (.cse13 (or |ULTIMATE.start_cstrcspn_#t~short209#1| (not (= .cse11 |ULTIMATE.start_cstrcspn_~c~0#1|)))) (.cse14 (<= 1 |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|)) (.cse15 (= (select |#valid| |ULTIMATE.start_cstrcspn_~s~0#1.base|) 1)) (.cse16 (<= (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)))) (or (and .cse0 .cse1 (= |ULTIMATE.start_cstrcspn_~s~0#1.offset| |ULTIMATE.start_cstrcspn_~s2#1.offset|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (or (and (not (= .cse11 0)) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) .cse12) .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (or (not (= |ULTIMATE.start_cstrcspn_~s~0#1.offset| 0)) .cse12) .cse8 .cse9 .cse10 (not (= (select .cse17 |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)) (<= .cse18 |ULTIMATE.start_cstrcspn_~s2#1.offset|) .cse13 .cse14 .cse15 .cse16))))) [2024-11-09 00:42:42,436 INFO L77 FloydHoareUtils]: At program point L372-3(line 372) the Hoare annotation is: (let ((.cse12 (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|)) (.cse13 (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1))) (let ((.cse0 (not (= |ULTIMATE.start_cstrcspn_~c~0#1| 0))) (.cse8 (select |#memory_int| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) (.cse1 (= (store (store |#valid| |ULTIMATE.start_main_#t~malloc216#1.base| 0) |ULTIMATE.start_main_#t~malloc215#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse2 (= (select |#valid| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1)) (.cse3 (not (= |ULTIMATE.start_main_#t~malloc215#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))) (.cse4 (<= .cse13 (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|))) (.cse5 (<= 0 |ULTIMATE.start_cstrcspn_~s~0#1.offset|)) (.cse6 (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 0) 0)) (.cse7 (= (select .cse12 0) 0)) (.cse9 (<= 1 |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|)) (.cse10 (= (select |#valid| |ULTIMATE.start_cstrcspn_~s~0#1.base|) 1)) (.cse11 (<= (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)))) (or (and .cse0 (= |ULTIMATE.start_cstrcspn_~s~0#1.offset| |ULTIMATE.start_cstrcspn_~s2#1.offset|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= (select .cse8 |ULTIMATE.start_cstrcspn_~s~0#1.offset|) 0)) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|) .cse9 .cse10 .cse11) (and .cse0 (= (select .cse8 0) 0) .cse1 (<= (+ |ULTIMATE.start_cstrcspn_~s2#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s2#1.base|)) .cse2 .cse3 .cse4 .cse5 (= (select |#valid| |ULTIMATE.start_cstrcspn_~s2#1.base|) 1) (not (= |ULTIMATE.start_cstrcspn_~s~0#1.offset| 0)) .cse6 .cse7 (not (= (select .cse12 |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)) (<= .cse13 |ULTIMATE.start_cstrcspn_~s2#1.offset|) .cse9 .cse10 .cse11)))) [2024-11-09 00:42:42,436 INFO L77 FloydHoareUtils]: At program point L372-6(lines 372 373) the Hoare annotation is: (let ((.cse15 (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|)) (.cse16 (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1)) (.cse17 (select |#memory_int| |ULTIMATE.start_cstrcspn_~s~0#1.base|))) (let ((.cse8 (select .cse17 |ULTIMATE.start_cstrcspn_~s~0#1.offset|)) (.cse0 (not (= |ULTIMATE.start_cstrcspn_~c~0#1| 0))) (.cse1 (= (select .cse17 0) 0)) (.cse2 (= (store (store |#valid| |ULTIMATE.start_main_#t~malloc216#1.base| 0) |ULTIMATE.start_main_#t~malloc215#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse12 (<= (+ |ULTIMATE.start_cstrcspn_~s2#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s2#1.base|))) (.cse3 (= (select |#valid| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1)) (.cse4 (not (= |ULTIMATE.start_main_#t~malloc215#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))) (.cse5 (<= .cse16 (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|))) (.cse6 (<= 0 |ULTIMATE.start_cstrcspn_~s~0#1.offset|)) (.cse13 (= (select |#valid| |ULTIMATE.start_cstrcspn_~s2#1.base|) 1)) (.cse7 (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 0) 0)) (.cse14 (= (select .cse15 0) 0)) (.cse9 (<= 1 |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|)) (.cse10 (= (select |#valid| |ULTIMATE.start_cstrcspn_~s~0#1.base|) 1)) (.cse11 (<= (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)))) (or (and .cse0 .cse1 (= |ULTIMATE.start_cstrcspn_~s~0#1.offset| |ULTIMATE.start_cstrcspn_~s2#1.offset|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= .cse8 0)) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|) .cse9 .cse10 .cse11) (and (not (or |ULTIMATE.start_cstrcspn_#t~short209#1| (not (= .cse8 |ULTIMATE.start_cstrcspn_~c~0#1|)))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 (not (= |ULTIMATE.start_cstrcspn_~s~0#1.offset| 0)) .cse7 .cse14 (not (= (select .cse15 |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)) (<= .cse16 |ULTIMATE.start_cstrcspn_~s2#1.offset|) .cse9 .cse10 .cse11) (and .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse7 (not |ULTIMATE.start_cstrcspn_#t~short209#1|) .cse14 (<= 0 |ULTIMATE.start_cstrcspn_~s2#1.offset|) .cse9 .cse10 .cse11)))) [2024-11-09 00:42:42,436 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:42:42,437 INFO L77 FloydHoareUtils]: At program point L372-8(lines 372 373) the Hoare annotation is: (let ((.cse18 (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|)) (.cse13 (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1)) (.cse5 (select |#length| |ULTIMATE.start_cstrcspn_~s2#1.base|)) (.cse19 (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|))) (let ((.cse0 (not (= |ULTIMATE.start_cstrcspn_~c~0#1| 0))) (.cse1 (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s~0#1.base|) 0) 0)) (.cse3 (+ |ULTIMATE.start_cstrcspn_~s2#1.offset| .cse19)) (.cse2 (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| .cse5)) (.cse4 (= (store (store |#valid| |ULTIMATE.start_main_#t~malloc216#1.base| 0) |ULTIMATE.start_main_#t~malloc215#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse6 (= (select |#valid| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1)) (.cse7 (not (= |ULTIMATE.start_main_#t~malloc215#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))) (.cse17 (<= .cse13 .cse19)) (.cse8 (<= 0 |ULTIMATE.start_cstrcspn_~s~0#1.offset|)) (.cse9 (= (select |#valid| |ULTIMATE.start_cstrcspn_~s2#1.base|) 1)) (.cse10 (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 0) 0)) (.cse11 (= (select .cse18 0) 0)) (.cse12 (not (= (select .cse18 |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))) (.cse14 (<= 1 |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|)) (.cse15 (= (select |#valid| |ULTIMATE.start_cstrcspn_~s~0#1.base|) 1)) (.cse16 (<= (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)))) (or (and .cse0 .cse1 (< .cse2 .cse3) .cse4 (<= (+ |ULTIMATE.start_cstrcspn_~s2#1.offset| 1) .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= .cse13 |ULTIMATE.start_cstrcspn_~s2#1.offset|) .cse14 .cse15 .cse16) (and .cse0 (= |ULTIMATE.start_cstrcspn_~s~0#1.offset| |ULTIMATE.start_cstrcspn_~s2#1.offset|) .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|) .cse14 .cse15 .cse16) (and .cse0 .cse1 (<= .cse3 .cse2) .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 (<= (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 2) |ULTIMATE.start_cstrcspn_~s2#1.offset|) .cse14 .cse15 .cse16)))) [2024-11-09 00:42:42,438 INFO L77 FloydHoareUtils]: At program point L372-9(lines 372 373) the Hoare annotation is: (let ((.cse0 (= (store (store |#valid| |ULTIMATE.start_main_#t~malloc216#1.base| 0) |ULTIMATE.start_main_#t~malloc215#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse1 (= (select |#valid| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1)) (.cse2 (not (= |ULTIMATE.start_main_#t~malloc215#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))) (.cse3 (<= (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|))) (.cse4 (<= 0 |ULTIMATE.start_cstrcspn_~s~0#1.offset|)) (.cse5 (<= 1 |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|)) (.cse6 (= (select |#valid| |ULTIMATE.start_cstrcspn_~s~0#1.base|) 1)) (.cse7 (<= (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)))) (or (and .cse0 (<= (+ |ULTIMATE.start_cstrcspn_~s2#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s2#1.base|)) .cse1 .cse2 .cse3 .cse4 (= (select |#valid| |ULTIMATE.start_cstrcspn_~s2#1.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 0) 0) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) 0) 0) (<= 0 |ULTIMATE.start_cstrcspn_~s2#1.offset|) .cse5 .cse6 .cse7) (and (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s~0#1.base|) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) |ULTIMATE.start_cstrcspn_~c~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2024-11-09 00:42:42,438 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-09 00:42:42,438 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:42:42,438 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:42:42,439 INFO L77 FloydHoareUtils]: At program point L369-1(lines 369 376) the Hoare annotation is: (let ((.cse0 (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|))) (and (= (store (store |#valid| |ULTIMATE.start_main_#t~malloc216#1.base| 0) |ULTIMATE.start_main_#t~malloc215#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= (+ |ULTIMATE.start_cstrcspn_~s2#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s2#1.base|)) (= (select |#valid| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1) (not (= |ULTIMATE.start_main_#t~malloc215#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|)) (= (select |#valid| |ULTIMATE.start_cstrcspn_~s2#1.base|) 1) (= (select .cse0 0) 0) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) 0) 0) (= (select .cse0 |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) |ULTIMATE.start_cstrcspn_#t~mem205#1|) (<= 0 |ULTIMATE.start_cstrcspn_~s2#1.offset|) (or (< 0 |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (= |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 0)) (<= (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)))) [2024-11-09 00:42:42,439 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:42:42,439 INFO L77 FloydHoareUtils]: At program point L369-3(lines 369 376) the Hoare annotation is: (and (= (store (store |#valid| |ULTIMATE.start_main_#t~malloc216#1.base| 0) |ULTIMATE.start_main_#t~malloc215#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= (+ |ULTIMATE.start_cstrcspn_~s2#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s2#1.base|)) (= (select |#valid| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1) (not (= |ULTIMATE.start_main_#t~malloc215#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|)) (= (select |#valid| |ULTIMATE.start_cstrcspn_~s2#1.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 0) 0) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) 0) 0) (<= 0 |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (<= 0 |ULTIMATE.start_cstrcspn_~s2#1.offset|) (<= (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|))) [2024-11-09 00:42:42,439 INFO L77 FloydHoareUtils]: At program point L369-4(lines 369 376) the Hoare annotation is: (and (= (store (store |#valid| |ULTIMATE.start_main_#t~malloc216#1.base| 0) |ULTIMATE.start_main_#t~malloc215#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_#t~malloc215#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))) [2024-11-09 00:42:42,440 INFO L77 FloydHoareUtils]: At program point L390(line 390) the Hoare annotation is: (and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< (div |ULTIMATE.start_main_~length2~0#1| 18446744073709551616) 1) (= (select |#valid| |ULTIMATE.start_main_~nondetString1~0#1.base|) 1) (< (div |ULTIMATE.start_main_~length1~0#1| 18446744073709551616) 1) (= (store (store |#valid| |ULTIMATE.start_main_#t~malloc216#1.base| 0) |ULTIMATE.start_main_#t~malloc215#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_#t~malloc215#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|)) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (< (mod |ULTIMATE.start_main_~length1~0#1| 18446744073709551616) (+ (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|) 1)) (= (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (mod |ULTIMATE.start_main_~length2~0#1| 18446744073709551616)) (= (select |#valid| |ULTIMATE.start_main_~nondetString2~0#1.base|) 1)) [2024-11-09 00:42:42,440 INFO L77 FloydHoareUtils]: At program point L390-1(line 390) the Hoare annotation is: (and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< (div |ULTIMATE.start_main_~length2~0#1| 18446744073709551616) 1) (= (select |#valid| |ULTIMATE.start_main_~nondetString1~0#1.base|) 1) (<= |ULTIMATE.start_main_~length1~0#1| (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= (store (store |#valid| |ULTIMATE.start_main_#t~malloc216#1.base| 0) |ULTIMATE.start_main_#t~malloc215#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_#t~malloc215#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~nondetString1~0#1.base|) 0) 0) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (= (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (mod |ULTIMATE.start_main_~length2~0#1| 18446744073709551616)) (= (select |#valid| |ULTIMATE.start_main_~nondetString2~0#1.base|) 1)) [2024-11-09 00:42:42,440 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK(lines 379 395) no Hoare annotation was computed. [2024-11-09 00:42:42,448 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-09 00:42:42,448 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 00:42:42,451 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-09 00:42:42,452 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-09 00:42:42,452 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc215!base [2024-11-09 00:42:42,452 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc216!base [2024-11-09 00:42:42,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.11 12:42:42 ImpRootNode [2024-11-09 00:42:42,454 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-09 00:42:42,454 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:42:42,454 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:42:42,454 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:42:42,455 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:35:35" (3/4) ... [2024-11-09 00:42:42,458 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 00:42:42,465 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-11-09 00:42:42,465 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-09 00:42:42,466 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-09 00:42:42,466 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 00:42:42,580 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f55d9f0-44b0-4661-b877-ddeeb8a2c49f/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-09 00:42:42,587 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f55d9f0-44b0-4661-b877-ddeeb8a2c49f/bin/ukojak-verify-ImItNfHLgk/witness.yml [2024-11-09 00:42:42,588 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:42:42,588 INFO L158 Benchmark]: Toolchain (without parser) took 428012.75ms. Allocated memory was 151.0MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 117.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 379.2MB. Max. memory is 16.1GB. [2024-11-09 00:42:42,588 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 109.1MB. Free memory is still 86.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:42:42,589 INFO L158 Benchmark]: CACSL2BoogieTranslator took 663.13ms. Allocated memory is still 151.0MB. Free memory was 117.4MB in the beginning and 97.0MB in the end (delta: 20.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 00:42:42,589 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.48ms. Allocated memory is still 151.0MB. Free memory was 97.0MB in the beginning and 94.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:42:42,589 INFO L158 Benchmark]: Boogie Preprocessor took 42.15ms. Allocated memory is still 151.0MB. Free memory was 94.9MB in the beginning and 93.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:42:42,590 INFO L158 Benchmark]: RCFGBuilder took 522.76ms. Allocated memory is still 151.0MB. Free memory was 93.3MB in the beginning and 74.0MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 00:42:42,590 INFO L158 Benchmark]: CodeCheck took 426585.92ms. Allocated memory was 151.0MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 73.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 328.9MB. Max. memory is 16.1GB. [2024-11-09 00:42:42,591 INFO L158 Benchmark]: Witness Printer took 133.43ms. Allocated memory is still 1.7GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 00:42:42,593 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, 31 locations, 15 error locations. Started 1 CEGAR loops. OverallTime: 417.9s, OverallIterations: 67, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13281 SdHoareTripleChecker+Valid, 133.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12418 mSDsluCounter, 3445 SdHoareTripleChecker+Invalid, 120.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2199 mSDsCounter, 11005 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 56800 IncrementalHoareTripleChecker+Invalid, 67805 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11005 mSolverCounterUnsat, 1246 mSDtfsCounter, 56800 mSolverCounterSat, 1.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13965 GetRequests, 12470 SyntacticMatches, 469 SemanticMatches, 1026 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476231 ImplicationChecksByTransitivity, 398.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 45.4s InterpolantComputationTime, 1202 NumberOfCodeBlocks, 1202 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 1136 ConstructedInterpolants, 0 QuantifiedInterpolants, 11113 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 66 InterpolantComputations, 24 PerfectInterpolantSequences, 313/890 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: 379]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 109.1MB. Free memory is still 86.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 663.13ms. Allocated memory is still 151.0MB. Free memory was 117.4MB in the beginning and 97.0MB in the end (delta: 20.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.48ms. Allocated memory is still 151.0MB. Free memory was 97.0MB in the beginning and 94.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.15ms. Allocated memory is still 151.0MB. Free memory was 94.9MB in the beginning and 93.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 522.76ms. Allocated memory is still 151.0MB. Free memory was 93.3MB in the beginning and 74.0MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * CodeCheck took 426585.92ms. Allocated memory was 151.0MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 73.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 328.9MB. Max. memory is 16.1GB. * Witness Printer took 133.43ms. Allocated memory is still 1.7GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 5.2MB). 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: 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: #t~malloc215!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc216!base RESULT: Ultimate proved your program to be correct! [2024-11-09 00:42:42,654 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f55d9f0-44b0-4661-b877-ddeeb8a2c49f/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE