./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.18-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_49fa521e-d9f0-4210-95fe-76cf18700d6f/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49fa521e-d9f0-4210-95fe-76cf18700d6f/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_49fa521e-d9f0-4210-95fe-76cf18700d6f/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49fa521e-d9f0-4210-95fe-76cf18700d6f/bin/ukojak-verify-ImItNfHLgk/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.18-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49fa521e-d9f0-4210-95fe-76cf18700d6f/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_49fa521e-d9f0-4210-95fe-76cf18700d6f/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 64e9a02fe4d55a12958b5de8c28c6c0ab007c7a3dc976261fd9d4ec11bf5feff --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 23:09:09,711 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:09:09,834 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49fa521e-d9f0-4210-95fe-76cf18700d6f/bin/ukojak-verify-ImItNfHLgk/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf [2024-11-08 23:09:09,840 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:09:09,842 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 23:09:09,888 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:09:09,889 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:09:09,889 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:09:09,890 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:09:09,892 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:09:09,894 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:09:09,895 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 23:09:09,895 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 23:09:09,896 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 23:09:09,896 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:09:09,901 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:09:09,901 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 23:09:09,902 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:09:09,902 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 23:09:09,902 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 23:09:09,903 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 23:09:09,904 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:09:09,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:09:09,905 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:09:09,905 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:09:09,905 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 23:09:09,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:09:09,906 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_49fa521e-d9f0-4210-95fe-76cf18700d6f/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_49fa521e-d9f0-4210-95fe-76cf18700d6f/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 -> 64e9a02fe4d55a12958b5de8c28c6c0ab007c7a3dc976261fd9d4ec11bf5feff [2024-11-08 23:09:10,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:09:10,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:09:10,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:09:10,291 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:09:10,294 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:09:10,295 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49fa521e-d9f0-4210-95fe-76cf18700d6f/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/termination-memory-alloca/b.18-alloca.i Unable to find full path for "g++" [2024-11-08 23:09:12,513 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:09:12,809 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:09:12,809 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49fa521e-d9f0-4210-95fe-76cf18700d6f/sv-benchmarks/c/termination-memory-alloca/b.18-alloca.i [2024-11-08 23:09:12,823 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49fa521e-d9f0-4210-95fe-76cf18700d6f/bin/ukojak-verify-ImItNfHLgk/data/4001f9d20/c18dcd033c3d4cf9a4fd04600e585c9d/FLAG9bc7b8345 [2024-11-08 23:09:12,848 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49fa521e-d9f0-4210-95fe-76cf18700d6f/bin/ukojak-verify-ImItNfHLgk/data/4001f9d20/c18dcd033c3d4cf9a4fd04600e585c9d [2024-11-08 23:09:12,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:09:12,852 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:09:12,854 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:09:12,854 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:09:12,859 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:09:12,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:09:12" (1/1) ... [2024-11-08 23:09:12,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63461845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:12, skipping insertion in model container [2024-11-08 23:09:12,862 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:09:12" (1/1) ... [2024-11-08 23:09:12,920 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:09:13,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:09:13,286 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:09:13,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:09:13,375 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:09:13,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:13 WrapperNode [2024-11-08 23:09:13,376 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:09:13,377 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:09:13,378 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:09:13,378 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:09:13,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:13" (1/1) ... [2024-11-08 23:09:13,406 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:13" (1/1) ... [2024-11-08 23:09:13,439 INFO L138 Inliner]: procedures = 111, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2024-11-08 23:09:13,440 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:09:13,441 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:09:13,441 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:09:13,441 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:09:13,452 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:13" (1/1) ... [2024-11-08 23:09:13,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:13" (1/1) ... [2024-11-08 23:09:13,456 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:13" (1/1) ... [2024-11-08 23:09:13,456 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:13" (1/1) ... [2024-11-08 23:09:13,467 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:13" (1/1) ... [2024-11-08 23:09:13,471 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:13" (1/1) ... [2024-11-08 23:09:13,479 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:13" (1/1) ... [2024-11-08 23:09:13,484 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:13" (1/1) ... [2024-11-08 23:09:13,486 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:09:13,491 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:09:13,492 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:09:13,492 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:09:13,493 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:13" (1/1) ... [2024-11-08 23:09:13,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:09:13,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49fa521e-d9f0-4210-95fe-76cf18700d6f/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 23:09:13,533 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49fa521e-d9f0-4210-95fe-76cf18700d6f/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 23:09:13,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49fa521e-d9f0-4210-95fe-76cf18700d6f/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 23:09:13,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 23:09:13,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 23:09:13,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 23:09:13,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 23:09:13,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:09:13,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:09:13,776 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:09:13,780 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:09:14,213 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2024-11-08 23:09:14,214 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:09:14,292 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:09:14,292 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-08 23:09:14,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:09:14 BoogieIcfgContainer [2024-11-08 23:09:14,293 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:09:14,294 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 23:09:14,295 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 23:09:14,309 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 23:09:14,310 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:09:14" (1/1) ... [2024-11-08 23:09:14,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:09:14,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:14,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 60 states and 69 transitions. [2024-11-08 23:09:14,395 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2024-11-08 23:09:14,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-08 23:09:14,398 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:14,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:14,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:14,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:14,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 59 states and 68 transitions. [2024-11-08 23:09:14,831 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2024-11-08 23:09:14,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-08 23:09:14,831 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:14,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:15,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:15,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:15,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 58 states and 67 transitions. [2024-11-08 23:09:15,161 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2024-11-08 23:09:15,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-08 23:09:15,163 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:15,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:15,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:15,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:15,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:15,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 57 states and 66 transitions. [2024-11-08 23:09:15,472 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2024-11-08 23:09:15,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-08 23:09:15,473 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:15,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:15,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:15,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:15,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 56 states and 65 transitions. [2024-11-08 23:09:15,884 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2024-11-08 23:09:15,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 23:09:15,885 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:15,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:15,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:15,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:16,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:16,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 57 states and 65 transitions. [2024-11-08 23:09:16,081 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2024-11-08 23:09:16,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 23:09:16,083 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:16,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:16,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:16,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:16,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 58 states and 68 transitions. [2024-11-08 23:09:16,318 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2024-11-08 23:09:16,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 23:09:16,320 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:16,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:16,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:16,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:16,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 61 states and 75 transitions. [2024-11-08 23:09:16,405 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2024-11-08 23:09:16,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 23:09:16,405 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:16,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:16,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:16,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:16,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 64 states and 82 transitions. [2024-11-08 23:09:16,961 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 82 transitions. [2024-11-08 23:09:16,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 23:09:16,962 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:16,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:16,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:17,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:17,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 66 states and 89 transitions. [2024-11-08 23:09:17,146 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 89 transitions. [2024-11-08 23:09:17,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 23:09:17,147 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:17,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:17,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:17,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:17,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:17,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 69 states and 98 transitions. [2024-11-08 23:09:17,321 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 98 transitions. [2024-11-08 23:09:17,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 23:09:17,321 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:17,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:17,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:17,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:17,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 70 states and 100 transitions. [2024-11-08 23:09:17,556 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 100 transitions. [2024-11-08 23:09:17,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 23:09:17,557 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:17,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:17,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:17,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:17,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 71 states and 100 transitions. [2024-11-08 23:09:17,620 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2024-11-08 23:09:17,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 23:09:17,620 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:17,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:17,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:17,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:17,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:17,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 72 states and 100 transitions. [2024-11-08 23:09:17,699 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 100 transitions. [2024-11-08 23:09:17,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 23:09:17,699 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:17,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:17,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:17,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:17,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 73 states and 101 transitions. [2024-11-08 23:09:17,772 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2024-11-08 23:09:17,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 23:09:17,772 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:17,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:17,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:17,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:17,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 74 states and 103 transitions. [2024-11-08 23:09:17,966 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 103 transitions. [2024-11-08 23:09:17,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 23:09:17,966 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:17,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:18,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:18,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:18,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 77 states and 107 transitions. [2024-11-08 23:09:18,241 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 107 transitions. [2024-11-08 23:09:18,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 23:09:18,241 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:18,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:18,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:18,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:18,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 81 states and 115 transitions. [2024-11-08 23:09:18,642 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2024-11-08 23:09:18,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 23:09:18,642 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:18,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:18,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:19,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:19,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 85 states and 120 transitions. [2024-11-08 23:09:19,051 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 120 transitions. [2024-11-08 23:09:19,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 23:09:19,051 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:19,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:19,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:19,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:19,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 87 states and 127 transitions. [2024-11-08 23:09:19,108 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 127 transitions. [2024-11-08 23:09:19,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 23:09:19,109 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:19,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:19,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:19,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:19,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 90 states and 136 transitions. [2024-11-08 23:09:19,194 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 136 transitions. [2024-11-08 23:09:19,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 23:09:19,195 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:19,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:19,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:19,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:19,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:19,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 92 states and 140 transitions. [2024-11-08 23:09:19,245 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 140 transitions. [2024-11-08 23:09:19,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 23:09:19,246 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:19,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:19,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:19,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:19,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:19,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 95 states and 146 transitions. [2024-11-08 23:09:19,321 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 146 transitions. [2024-11-08 23:09:19,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 23:09:19,322 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:19,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:19,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:19,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:19,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 96 states and 149 transitions. [2024-11-08 23:09:19,362 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 149 transitions. [2024-11-08 23:09:19,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 23:09:19,362 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:19,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:19,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:19,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:19,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 98 states and 155 transitions. [2024-11-08 23:09:19,450 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 155 transitions. [2024-11-08 23:09:19,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 23:09:19,451 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:19,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:19,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:19,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:19,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:19,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 99 states and 157 transitions. [2024-11-08 23:09:19,755 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 157 transitions. [2024-11-08 23:09:19,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 23:09:19,755 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:19,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:19,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:19,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:19,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 102 states and 162 transitions. [2024-11-08 23:09:19,996 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 162 transitions. [2024-11-08 23:09:19,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 23:09:19,996 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:19,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:20,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:20,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:20,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:20,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 105 states and 166 transitions. [2024-11-08 23:09:20,282 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 166 transitions. [2024-11-08 23:09:20,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 23:09:20,282 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:20,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:20,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:20,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:20,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 106 states and 167 transitions. [2024-11-08 23:09:20,523 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 167 transitions. [2024-11-08 23:09:20,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 23:09:20,523 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:20,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:20,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:20,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:20,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 106 states and 166 transitions. [2024-11-08 23:09:20,640 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 166 transitions. [2024-11-08 23:09:20,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 23:09:20,640 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:20,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:20,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:20,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:22,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:22,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 115 states and 186 transitions. [2024-11-08 23:09:22,238 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 186 transitions. [2024-11-08 23:09:22,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 23:09:22,238 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:22,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:22,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 23:09:22,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:22,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 116 states and 188 transitions. [2024-11-08 23:09:22,338 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 188 transitions. [2024-11-08 23:09:22,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 23:09:22,339 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:22,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:22,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:24,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:24,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 120 states and 196 transitions. [2024-11-08 23:09:24,828 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 196 transitions. [2024-11-08 23:09:24,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 23:09:24,828 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:24,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:24,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 23:09:24,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:24,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 120 states and 195 transitions. [2024-11-08 23:09:24,948 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 195 transitions. [2024-11-08 23:09:24,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 23:09:24,948 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:24,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:24,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:24,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:24,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 121 states and 197 transitions. [2024-11-08 23:09:24,985 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 197 transitions. [2024-11-08 23:09:24,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 23:09:24,987 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:24,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:25,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:25,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:25,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 122 states and 198 transitions. [2024-11-08 23:09:25,054 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 198 transitions. [2024-11-08 23:09:25,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 23:09:25,055 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:25,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:25,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 23:09:25,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:25,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 124 states and 204 transitions. [2024-11-08 23:09:25,133 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 204 transitions. [2024-11-08 23:09:25,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 23:09:25,133 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:25,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:25,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 23:09:25,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:25,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 126 states and 208 transitions. [2024-11-08 23:09:25,188 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 208 transitions. [2024-11-08 23:09:25,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 23:09:25,188 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:25,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:25,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:25,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:25,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:25,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 127 states and 210 transitions. [2024-11-08 23:09:25,244 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 210 transitions. [2024-11-08 23:09:25,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 23:09:25,245 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:25,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:25,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:25,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:25,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:25,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 129 states and 214 transitions. [2024-11-08 23:09:25,325 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 214 transitions. [2024-11-08 23:09:25,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 23:09:25,326 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:25,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:25,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:25,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:25,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 132 states and 218 transitions. [2024-11-08 23:09:25,954 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 218 transitions. [2024-11-08 23:09:25,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 23:09:25,955 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:25,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:26,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:26,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:26,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 133 states and 219 transitions. [2024-11-08 23:09:26,257 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 219 transitions. [2024-11-08 23:09:26,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 23:09:26,258 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:26,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:26,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:26,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:26,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:26,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 132 states and 218 transitions. [2024-11-08 23:09:26,301 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 218 transitions. [2024-11-08 23:09:26,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 23:09:26,302 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:26,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:26,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:26,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:26,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:26,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 133 states and 218 transitions. [2024-11-08 23:09:26,375 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 218 transitions. [2024-11-08 23:09:26,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 23:09:26,376 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:26,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:26,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:26,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:26,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 132 states and 217 transitions. [2024-11-08 23:09:26,421 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 217 transitions. [2024-11-08 23:09:26,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 23:09:26,421 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:26,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:26,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:26,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:26,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 133 states and 217 transitions. [2024-11-08 23:09:26,489 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 217 transitions. [2024-11-08 23:09:26,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 23:09:26,489 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:26,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:26,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 23:09:26,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:26,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 135 states and 220 transitions. [2024-11-08 23:09:26,529 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 220 transitions. [2024-11-08 23:09:26,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 23:09:26,530 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:26,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:26,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 23:09:26,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:26,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 137 states and 223 transitions. [2024-11-08 23:09:26,598 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 223 transitions. [2024-11-08 23:09:26,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 23:09:26,599 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:26,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:26,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 23:09:26,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:26,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 141 states and 230 transitions. [2024-11-08 23:09:26,865 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 230 transitions. [2024-11-08 23:09:26,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 23:09:26,865 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:26,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:26,904 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 23:09:26,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:26,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 143 states and 231 transitions. [2024-11-08 23:09:26,938 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 231 transitions. [2024-11-08 23:09:26,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-08 23:09:26,938 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:26,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:26,964 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 23:09:26,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:26,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 140 states and 226 transitions. [2024-11-08 23:09:26,985 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 226 transitions. [2024-11-08 23:09:26,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-08 23:09:26,986 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:26,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:27,045 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 23:09:27,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:27,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 47 states and 64 transitions. [2024-11-08 23:09:27,107 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2024-11-08 23:09:27,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 23:09:27,108 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:27,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:27,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:27,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:27,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 55 states and 76 transitions. [2024-11-08 23:09:27,819 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 76 transitions. [2024-11-08 23:09:27,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 23:09:27,819 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:27,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:27,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:27,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:27,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 57 states and 80 transitions. [2024-11-08 23:09:27,972 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2024-11-08 23:09:27,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 23:09:27,973 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:27,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:27,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:28,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:30,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:30,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 62 states and 89 transitions. [2024-11-08 23:09:30,465 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 89 transitions. [2024-11-08 23:09:30,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 23:09:30,466 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:30,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:30,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:30,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:30,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 64 states and 93 transitions. [2024-11-08 23:09:30,549 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 93 transitions. [2024-11-08 23:09:30,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 23:09:30,549 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:30,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:30,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:30,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:30,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 65 states and 93 transitions. [2024-11-08 23:09:30,629 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2024-11-08 23:09:30,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 23:09:30,630 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:30,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:31,434 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:34,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:34,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 69 states and 99 transitions. [2024-11-08 23:09:34,499 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 99 transitions. [2024-11-08 23:09:34,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 23:09:34,500 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:34,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:34,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:35,185 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:09:39,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:39,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 79 states and 116 transitions. [2024-11-08 23:09:39,175 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 116 transitions. [2024-11-08 23:09:39,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 23:09:39,175 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:39,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:39,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:39,523 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 23:09:40,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:40,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 79 states and 114 transitions. [2024-11-08 23:09:40,357 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 114 transitions. [2024-11-08 23:09:40,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 23:09:40,358 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:40,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:40,429 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 23:09:41,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:41,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 78 states and 110 transitions. [2024-11-08 23:09:41,056 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 110 transitions. [2024-11-08 23:09:41,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 23:09:41,057 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:41,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:42,124 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 23:09:48,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:48,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 89 states and 131 transitions. [2024-11-08 23:09:48,994 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 131 transitions. [2024-11-08 23:09:48,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 23:09:48,995 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:48,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:49,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 23:09:54,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:54,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 99 states and 144 transitions. [2024-11-08 23:09:54,026 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 144 transitions. [2024-11-08 23:09:54,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 23:09:54,027 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:54,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:54,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:54,972 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 23:09:59,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:09:59,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 107 states and 154 transitions. [2024-11-08 23:09:59,905 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 154 transitions. [2024-11-08 23:09:59,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 23:09:59,905 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:09:59,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:59,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:00,301 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 23:10:01,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:10:01,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 107 states and 153 transitions. [2024-11-08 23:10:01,213 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 153 transitions. [2024-11-08 23:10:01,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 23:10:01,214 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:10:01,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:10:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:01,385 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 23:10:02,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:10:02,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 98 states and 135 transitions. [2024-11-08 23:10:02,176 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 135 transitions. [2024-11-08 23:10:02,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 23:10:02,177 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:10:02,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:10:02,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:02,315 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 23:10:08,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:10:08,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 108 states and 149 transitions. [2024-11-08 23:10:08,536 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 149 transitions. [2024-11-08 23:10:08,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 23:10:08,537 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:10:08,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:10:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:08,665 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 23:10:10,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:10:10,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 110 states and 150 transitions. [2024-11-08 23:10:10,827 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 150 transitions. [2024-11-08 23:10:10,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 23:10:10,828 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:10:10,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:10:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:11,591 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 23:10:13,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:10:13,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 110 states and 148 transitions. [2024-11-08 23:10:13,229 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 148 transitions. [2024-11-08 23:10:13,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 23:10:13,229 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:10:13,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:10:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:13,409 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 23:10:14,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:10:14,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 41 states and 51 transitions. [2024-11-08 23:10:14,954 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2024-11-08 23:10:14,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 23:10:14,955 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 70 iterations. [2024-11-08 23:10:14,966 INFO L729 CodeCheckObserver]: All specifications hold 33 specifications checked. All of them hold [2024-11-08 23:10:19,666 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:10:19,666 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:10:19,666 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:10:19,669 INFO L77 FloydHoareUtils]: At program point L564-1(line 564) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-08 23:10:19,672 INFO L77 FloydHoareUtils]: At program point L564-2(line 564) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-08 23:10:19,672 INFO L77 FloydHoareUtils]: At program point L564-5(lines 564 565) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse4 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)))) (or (and .cse0 .cse1 |ULTIMATE.start_test_fun_#t~short15#1| .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) .cse4 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))))) [2024-11-08 23:10:19,673 INFO L77 FloydHoareUtils]: At program point L556(line 556) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-08 23:10:19,673 INFO L77 FloydHoareUtils]: At program point L556-1(line 556) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= 1 |ULTIMATE.start_test_fun_#t~mem10#1|) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-08 23:10:19,673 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 568 570) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-08 23:10:19,673 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:10:19,673 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:10:19,678 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:10:19,678 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:10:19,679 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:10:19,679 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:10:19,679 INFO L77 FloydHoareUtils]: At program point test_fun_returnLabel#1(lines 547 567) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-08 23:10:19,679 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:10:19,679 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:10:19,679 INFO L77 FloydHoareUtils]: At program point L566(line 566) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-08 23:10:19,680 INFO L77 FloydHoareUtils]: At program point L566-1(line 566) the Hoare annotation is: (and (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-08 23:10:19,680 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:10:19,680 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-08 23:10:19,680 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:10:19,680 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:10:19,680 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:10:19,681 INFO L77 FloydHoareUtils]: At program point L559-1(lines 559 561) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse4 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse5 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse6 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse7 (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (.cse8 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 (= .cse4 |ULTIMATE.start_test_fun_#t~mem11#1|) .cse5 .cse6 .cse7 .cse8 .cse9 (<= .cse4 0)) (and .cse0 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse1 .cse2 .cse3 (< 0 .cse4) .cse5 .cse6 .cse7 .cse8 .cse9))) [2024-11-08 23:10:19,681 INFO L77 FloydHoareUtils]: At program point L559-3(lines 559 561) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-08 23:10:19,681 INFO L77 FloydHoareUtils]: At program point L559-4(lines 553 563) the Hoare annotation is: (let ((.cse6 (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse0 (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse1 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse2 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse3 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse4 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse5 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) .cse6) (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not .cse6) .cse0 .cse1 .cse2 .cse3 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse4 .cse5))) [2024-11-08 23:10:19,681 INFO L77 FloydHoareUtils]: At program point L551(line 551) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 4) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) [2024-11-08 23:10:19,688 INFO L77 FloydHoareUtils]: At program point L551-1(line 551) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 4) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) [2024-11-08 23:10:19,688 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:10:19,688 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:10:19,689 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:10:19,689 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK(lines 568 570) no Hoare annotation was computed. [2024-11-08 23:10:19,689 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:10:19,689 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:10:19,689 INFO L77 FloydHoareUtils]: At program point L560(line 560) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (< 0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-08 23:10:19,690 INFO L77 FloydHoareUtils]: At program point L560-1(line 560) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 1 |ULTIMATE.start_test_fun_#t~mem12#1|) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-08 23:10:19,690 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:10:19,690 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:10:19,690 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:10:19,690 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:10:19,691 INFO L77 FloydHoareUtils]: At program point L553-1(line 553) the Hoare annotation is: (let ((.cse7 (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse4 (not |ULTIMATE.start_test_fun_#t~short6#1|)) (.cse0 (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse1 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse2 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse3 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse5 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse6 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not .cse7) (or (< 0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) .cse4) .cse0 .cse1 .cse2 .cse3 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse5 .cse6))) [2024-11-08 23:10:19,691 INFO L77 FloydHoareUtils]: At program point L553-2(line 553) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-08 23:10:19,691 INFO L77 FloydHoareUtils]: At program point L553-5(lines 553 563) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse4 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse5 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse6 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse7 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)))) (or (and .cse0 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse1 .cse2 .cse3 (< 0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) .cse4 .cse5 (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not |ULTIMATE.start_test_fun_#t~short6#1|) .cse6 .cse7))) [2024-11-08 23:10:19,694 INFO L77 FloydHoareUtils]: At program point L553-7(lines 553 563) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-08 23:10:19,694 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-08 23:10:19,694 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:10:19,696 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:10:19,696 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:10:19,697 INFO L77 FloydHoareUtils]: At program point L554(line 554) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (< 0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-08 23:10:19,698 INFO L77 FloydHoareUtils]: At program point L554-1(line 554) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_#t~mem7#1| .cse0) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= (+ |ULTIMATE.start_test_fun_#t~mem7#1| 1) (* .cse0 2)))) [2024-11-08 23:10:19,698 INFO L77 FloydHoareUtils]: At program point L554-2(lines 554 562) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_#t~mem7#1| .cse0) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (< 0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 1 |ULTIMATE.start_test_fun_#t~mem8#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= (+ |ULTIMATE.start_test_fun_#t~mem7#1| 1) (* .cse0 2)))) [2024-11-08 23:10:19,698 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:10:19,699 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:10:19,699 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:10:19,699 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:10:19,699 INFO L77 FloydHoareUtils]: At program point L555-1(lines 555 557) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse7 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse4 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse5 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse6 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse8 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_test_fun_#t~mem9#1| .cse7) .cse8 (<= 0 |ULTIMATE.start_test_fun_#t~mem9#1|)) (and .cse0 .cse1 .cse2 .cse3 (< 0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (<= 1 |ULTIMATE.start_test_fun_#t~mem9#1|) (<= 2 .cse7) .cse4 .cse5 .cse6 .cse8))) [2024-11-08 23:10:19,700 INFO L77 FloydHoareUtils]: At program point L555-3(lines 555 557) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) [2024-11-08 23:10:19,700 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 23:10:19,710 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-08 23:10:19,711 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 23:10:19,716 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-08 23:10:19,716 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 23:10:19,718 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-08 23:10:19,718 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-08 23:10:19,718 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-08 23:10:19,718 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-08 23:10:19,718 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset [2024-11-08 23:10:19,722 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset [2024-11-08 23:10:19,722 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 23:10:19,723 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-08 23:10:19,723 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-08 23:10:19,723 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-08 23:10:19,723 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-08 23:10:19,724 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-08 23:10:19,724 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-11-08 23:10:19,724 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!base [2024-11-08 23:10:19,724 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!base [2024-11-08 23:10:19,724 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 23:10:19,724 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-08 23:10:19,724 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!base [2024-11-08 23:10:19,725 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!base [2024-11-08 23:10:19,725 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-08 23:10:19,725 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-08 23:10:19,725 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-08 23:10:19,725 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-08 23:10:19,725 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset [2024-11-08 23:10:19,726 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset [2024-11-08 23:10:19,726 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-08 23:10:19,726 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-08 23:10:19,726 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 23:10:19,726 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-08 23:10:19,727 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-08 23:10:19,727 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-08 23:10:19,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 11:10:19 ImpRootNode [2024-11-08 23:10:19,729 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 23:10:19,730 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:10:19,730 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:10:19,730 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:10:19,730 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:09:14" (3/4) ... [2024-11-08 23:10:19,733 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 23:10:19,743 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-11-08 23:10:19,744 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-08 23:10:19,744 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-08 23:10:19,744 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 23:10:19,858 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49fa521e-d9f0-4210-95fe-76cf18700d6f/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 23:10:19,859 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49fa521e-d9f0-4210-95fe-76cf18700d6f/bin/ukojak-verify-ImItNfHLgk/witness.yml [2024-11-08 23:10:19,859 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:10:19,860 INFO L158 Benchmark]: Toolchain (without parser) took 67007.92ms. Allocated memory was 151.0MB in the beginning and 541.1MB in the end (delta: 390.1MB). Free memory was 108.6MB in the beginning and 200.1MB in the end (delta: -91.5MB). Peak memory consumption was 300.7MB. Max. memory is 16.1GB. [2024-11-08 23:10:19,861 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 151.0MB. Free memory is still 95.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:10:19,861 INFO L158 Benchmark]: CACSL2BoogieTranslator took 522.27ms. Allocated memory is still 151.0MB. Free memory was 108.1MB in the beginning and 89.7MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 23:10:19,862 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.60ms. Allocated memory is still 151.0MB. Free memory was 89.7MB in the beginning and 88.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:10:19,862 INFO L158 Benchmark]: Boogie Preprocessor took 49.99ms. Allocated memory is still 151.0MB. Free memory was 88.2MB in the beginning and 86.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:10:19,863 INFO L158 Benchmark]: RCFGBuilder took 802.06ms. Allocated memory is still 151.0MB. Free memory was 86.7MB in the beginning and 65.1MB in the end (delta: 21.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-08 23:10:19,863 INFO L158 Benchmark]: CodeCheck took 65434.48ms. Allocated memory was 151.0MB in the beginning and 541.1MB in the end (delta: 390.1MB). Free memory was 65.1MB in the beginning and 205.3MB in the end (delta: -140.2MB). Peak memory consumption was 252.5MB. Max. memory is 16.1GB. [2024-11-08 23:10:19,864 INFO L158 Benchmark]: Witness Printer took 129.87ms. Allocated memory is still 541.1MB. Free memory was 205.3MB in the beginning and 200.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:10:19,866 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, 60 locations, 33 error locations. Started 1 CEGAR loops. OverallTime: 60.6s, OverallIterations: 70, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15374 SdHoareTripleChecker+Valid, 52.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13973 mSDsluCounter, 13536 SdHoareTripleChecker+Invalid, 44.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11071 mSDsCounter, 4234 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27652 IncrementalHoareTripleChecker+Invalid, 31886 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4234 mSolverCounterUnsat, 2465 mSDtfsCounter, 27652 mSolverCounterSat, 1.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9055 GetRequests, 8331 SyntacticMatches, 298 SemanticMatches, 426 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88147 ImplicationChecksByTransitivity, 52.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 1034 NumberOfCodeBlocks, 1034 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 965 ConstructedInterpolants, 0 QuantifiedInterpolants, 5724 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 69 InterpolantComputations, 59 PerfectInterpolantSequences, 159/174 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -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: 568]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 33 specifications checked. All of them hold * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.42ms. Allocated memory is still 151.0MB. Free memory is still 95.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 522.27ms. Allocated memory is still 151.0MB. Free memory was 108.1MB in the beginning and 89.7MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.60ms. Allocated memory is still 151.0MB. Free memory was 89.7MB in the beginning and 88.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.99ms. Allocated memory is still 151.0MB. Free memory was 88.2MB in the beginning and 86.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 802.06ms. Allocated memory is still 151.0MB. Free memory was 86.7MB in the beginning and 65.1MB in the end (delta: 21.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * CodeCheck took 65434.48ms. Allocated memory was 151.0MB in the beginning and 541.1MB in the end (delta: 390.1MB). Free memory was 65.1MB in the beginning and 205.3MB in the end (delta: -140.2MB). Peak memory consumption was 252.5MB. Max. memory is 16.1GB. * Witness Printer took 129.87ms. Allocated memory is still 541.1MB. Free memory was 205.3MB in the beginning and 200.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: 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~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~y_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~y_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] RESULT: Ultimate proved your program to be correct! [2024-11-08 23:10:19,909 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49fa521e-d9f0-4210-95fe-76cf18700d6f/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE