./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.09_assume-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_5a17bcbb-ad17-4521-ad60-dcda47d9df78/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a17bcbb-ad17-4521-ad60-dcda47d9df78/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_5a17bcbb-ad17-4521-ad60-dcda47d9df78/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a17bcbb-ad17-4521-ad60-dcda47d9df78/bin/ukojak-verify-ImItNfHLgk/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a17bcbb-ad17-4521-ad60-dcda47d9df78/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_5a17bcbb-ad17-4521-ad60-dcda47d9df78/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 4cca1c0210c0a53cd372224714db019427e8e227743584713b4610995b14f457 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 00:42:54,492 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:42:54,592 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a17bcbb-ad17-4521-ad60-dcda47d9df78/bin/ukojak-verify-ImItNfHLgk/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf [2024-11-09 00:42:54,599 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:42:54,600 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-09 00:42:54,638 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:42:54,640 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:42:54,641 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:42:54,641 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:42:54,643 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:42:54,643 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:42:54,644 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 00:42:54,644 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 00:42:54,644 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 00:42:54,645 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:42:54,647 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:42:54,647 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 00:42:54,648 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:42:54,648 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-09 00:42:54,648 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-09 00:42:54,649 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-09 00:42:54,652 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:42:54,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:42:54,653 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:42:54,653 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:42:54,653 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-09 00:42:54,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:42:54,654 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_5a17bcbb-ad17-4521-ad60-dcda47d9df78/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_5a17bcbb-ad17-4521-ad60-dcda47d9df78/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 -> 4cca1c0210c0a53cd372224714db019427e8e227743584713b4610995b14f457 [2024-11-09 00:42:54,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:42:55,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:42:55,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:42:55,008 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:42:55,010 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:42:55,011 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a17bcbb-ad17-4521-ad60-dcda47d9df78/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca.i Unable to find full path for "g++" [2024-11-09 00:42:57,072 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:42:57,311 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:42:57,312 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a17bcbb-ad17-4521-ad60-dcda47d9df78/sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca.i [2024-11-09 00:42:57,324 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a17bcbb-ad17-4521-ad60-dcda47d9df78/bin/ukojak-verify-ImItNfHLgk/data/c2bfd9ed2/9b90c81f8a52457189478c7e54bab673/FLAG13f6ef3f1 [2024-11-09 00:42:57,338 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a17bcbb-ad17-4521-ad60-dcda47d9df78/bin/ukojak-verify-ImItNfHLgk/data/c2bfd9ed2/9b90c81f8a52457189478c7e54bab673 [2024-11-09 00:42:57,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:42:57,343 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:42:57,344 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:42:57,345 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:42:57,349 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:42:57,350 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:42:57" (1/1) ... [2024-11-09 00:42:57,351 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@652e0e64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:42:57, skipping insertion in model container [2024-11-09 00:42:57,351 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:42:57" (1/1) ... [2024-11-09 00:42:57,391 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:42:57,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:42:57,754 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:42:57,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:42:57,825 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:42:57,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:42:57 WrapperNode [2024-11-09 00:42:57,826 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:42:57,827 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:42:57,827 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:42:57,827 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:42:57,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:42:57" (1/1) ... [2024-11-09 00:42:57,850 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:42:57" (1/1) ... [2024-11-09 00:42:57,877 INFO L138 Inliner]: procedures = 111, calls = 35, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 103 [2024-11-09 00:42:57,878 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:42:57,878 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:42:57,878 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:42:57,879 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:42:57,890 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:42:57" (1/1) ... [2024-11-09 00:42:57,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:42:57" (1/1) ... [2024-11-09 00:42:57,895 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:42:57" (1/1) ... [2024-11-09 00:42:57,897 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:42:57" (1/1) ... [2024-11-09 00:42:57,907 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:42:57" (1/1) ... [2024-11-09 00:42:57,913 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:42:57" (1/1) ... [2024-11-09 00:42:57,914 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:42:57" (1/1) ... [2024-11-09 00:42:57,919 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:42:57" (1/1) ... [2024-11-09 00:42:57,921 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:42:57,926 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:42:57,926 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:42:57,926 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:42:57,927 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:42:57" (1/1) ... [2024-11-09 00:42:57,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:42:57,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a17bcbb-ad17-4521-ad60-dcda47d9df78/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-09 00:42:57,968 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a17bcbb-ad17-4521-ad60-dcda47d9df78/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-09 00:42:57,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a17bcbb-ad17-4521-ad60-dcda47d9df78/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-09 00:42:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 00:42:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 00:42:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 00:42:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 00:42:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:42:58,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:42:58,152 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:42:58,155 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:42:58,565 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-09 00:42:58,565 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:42:58,616 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:42:58,616 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:42:58,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:42:58 BoogieIcfgContainer [2024-11-09 00:42:58,617 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:42:58,618 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-09 00:42:58,618 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-09 00:42:58,629 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-09 00:42:58,629 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:42:58" (1/1) ... [2024-11-09 00:42:58,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:42:58,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:42:58,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 61 states and 66 transitions. [2024-11-09 00:42:58,697 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2024-11-09 00:42:58,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-09 00:42:58,699 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:42:58,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:42:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:42:59,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:42:59,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:42:59,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 60 states and 65 transitions. [2024-11-09 00:42:59,201 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2024-11-09 00:42:59,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-09 00:42:59,201 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:42:59,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:42:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:42:59,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:42:59,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:42:59,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 59 states and 64 transitions. [2024-11-09 00:42:59,496 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2024-11-09 00:42:59,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 00:42:59,496 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:42:59,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:42:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:42:59,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:42:59,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:42:59,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 58 states and 63 transitions. [2024-11-09 00:42:59,736 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2024-11-09 00:42:59,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 00:42:59,736 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:42:59,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:42:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:42:59,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:00,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:00,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 57 states and 62 transitions. [2024-11-09 00:43:00,201 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2024-11-09 00:43:00,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 00:43:00,202 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:00,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:00,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:00,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:00,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 56 states and 61 transitions. [2024-11-09 00:43:00,604 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2024-11-09 00:43:00,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 00:43:00,605 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:00,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:00,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:01,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:01,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 55 states and 60 transitions. [2024-11-09 00:43:01,304 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2024-11-09 00:43:01,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 00:43:01,305 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:01,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:01,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:01,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:01,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 54 states and 59 transitions. [2024-11-09 00:43:01,704 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2024-11-09 00:43:01,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 00:43:01,705 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:01,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:01,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:02,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:02,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 53 states and 58 transitions. [2024-11-09 00:43:02,147 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2024-11-09 00:43:02,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 00:43:02,150 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:02,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:02,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:02,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:02,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 52 states and 57 transitions. [2024-11-09 00:43:02,400 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2024-11-09 00:43:02,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 00:43:02,400 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:02,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:02,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:03,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:03,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 51 states and 56 transitions. [2024-11-09 00:43:03,266 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2024-11-09 00:43:03,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 00:43:03,267 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:03,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:03,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:03,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:03,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:03,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 52 states and 56 transitions. [2024-11-09 00:43:03,417 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2024-11-09 00:43:03,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 00:43:03,418 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:03,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:03,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:05,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:05,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 55 states and 62 transitions. [2024-11-09 00:43:05,371 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2024-11-09 00:43:05,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 00:43:05,371 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:05,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:05,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-09 00:43:06,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:06,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 56 states and 64 transitions. [2024-11-09 00:43:06,063 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2024-11-09 00:43:06,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 00:43:06,064 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:06,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:06,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:06,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:06,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 57 states and 66 transitions. [2024-11-09 00:43:06,598 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2024-11-09 00:43:06,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 00:43:06,599 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:06,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:06,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:07,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:07,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:07,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 56 states and 63 transitions. [2024-11-09 00:43:07,561 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2024-11-09 00:43:07,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 00:43:07,561 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:07,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:07,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:09,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:09,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 58 states and 66 transitions. [2024-11-09 00:43:09,363 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2024-11-09 00:43:09,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 00:43:09,364 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:09,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:09,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:09,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:09,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:09,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 57 states and 65 transitions. [2024-11-09 00:43:09,620 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2024-11-09 00:43:09,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 00:43:09,621 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:09,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:09,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:09,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:09,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 59 states and 67 transitions. [2024-11-09 00:43:09,987 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2024-11-09 00:43:09,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 00:43:09,987 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:09,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:10,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:10,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:10,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 63 states and 73 transitions. [2024-11-09 00:43:10,880 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2024-11-09 00:43:10,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 00:43:10,881 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:10,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:10,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:11,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:11,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 67 states and 79 transitions. [2024-11-09 00:43:11,899 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2024-11-09 00:43:11,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 00:43:11,900 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:11,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:11,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:11,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:11,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 66 states and 78 transitions. [2024-11-09 00:43:11,946 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2024-11-09 00:43:11,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 00:43:11,947 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:11,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:11,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:12,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:12,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 68 states and 81 transitions. [2024-11-09 00:43:12,019 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2024-11-09 00:43:12,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 00:43:12,020 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:12,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:12,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:12,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:12,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 69 states and 83 transitions. [2024-11-09 00:43:12,068 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2024-11-09 00:43:12,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 00:43:12,069 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:12,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:12,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:12,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:12,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 72 states and 88 transitions. [2024-11-09 00:43:12,146 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 88 transitions. [2024-11-09 00:43:12,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 00:43:12,146 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:12,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:12,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:12,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:12,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:12,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 73 states and 90 transitions. [2024-11-09 00:43:12,196 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2024-11-09 00:43:12,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 00:43:12,197 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:12,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:12,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:12,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:12,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 75 states and 93 transitions. [2024-11-09 00:43:12,303 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2024-11-09 00:43:12,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 00:43:12,303 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:12,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:12,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:12,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:15,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:15,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 77 states and 98 transitions. [2024-11-09 00:43:15,421 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2024-11-09 00:43:15,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 00:43:15,422 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:15,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:15,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:18,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:18,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 85 states and 111 transitions. [2024-11-09 00:43:18,765 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2024-11-09 00:43:18,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 00:43:18,766 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:18,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:18,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:18,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:18,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 84 states and 110 transitions. [2024-11-09 00:43:18,823 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 110 transitions. [2024-11-09 00:43:18,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 00:43:18,824 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:18,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:18,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:18,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:18,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 86 states and 114 transitions. [2024-11-09 00:43:18,923 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 114 transitions. [2024-11-09 00:43:18,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 00:43:18,924 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:18,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:18,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:18,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:18,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 85 states and 113 transitions. [2024-11-09 00:43:18,972 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 113 transitions. [2024-11-09 00:43:18,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 00:43:18,972 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:18,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:19,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:19,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:19,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 86 states and 114 transitions. [2024-11-09 00:43:19,053 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 114 transitions. [2024-11-09 00:43:19,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 00:43:19,054 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:19,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43: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-09 00:43:19,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:19,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 85 states and 113 transitions. [2024-11-09 00:43:19,116 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 113 transitions. [2024-11-09 00:43:19,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 00:43:19,116 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:19,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:19,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:19,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:19,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 86 states and 118 transitions. [2024-11-09 00:43:19,206 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 118 transitions. [2024-11-09 00:43:19,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 00:43:19,207 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:19,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:19,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:19,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:19,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:19,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 85 states and 117 transitions. [2024-11-09 00:43:19,295 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2024-11-09 00:43:19,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 00:43:19,295 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:19,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:19,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:19,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:19,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 86 states and 120 transitions. [2024-11-09 00:43:19,414 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 120 transitions. [2024-11-09 00:43:19,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 00:43:19,415 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:19,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:19,468 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-09 00:43:19,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:19,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 88 states and 122 transitions. [2024-11-09 00:43:19,861 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 122 transitions. [2024-11-09 00:43:19,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 00:43:19,861 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:19,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:19,892 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-09 00:43:20,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:20,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 88 states and 121 transitions. [2024-11-09 00:43:20,068 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 121 transitions. [2024-11-09 00:43:20,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 00:43:20,069 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:20,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:20,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:25,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:25,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 95 states and 132 transitions. [2024-11-09 00:43:25,270 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2024-11-09 00:43:25,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 00:43:25,271 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:25,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:25,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:25,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:26,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:26,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 99 states and 137 transitions. [2024-11-09 00:43:26,218 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 137 transitions. [2024-11-09 00:43:26,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 00:43:26,219 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:26,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:26,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:27,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:27,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 103 states and 142 transitions. [2024-11-09 00:43:27,385 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 142 transitions. [2024-11-09 00:43:27,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 00:43:27,386 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:27,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:27,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 00:43:28,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:28,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 105 states and 145 transitions. [2024-11-09 00:43:28,181 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 145 transitions. [2024-11-09 00:43:28,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 00:43:28,181 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:28,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:28,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 00:43:29,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:29,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 108 states and 150 transitions. [2024-11-09 00:43:29,194 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 150 transitions. [2024-11-09 00:43:29,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 00:43:29,194 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:29,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:29,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:29,239 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 00:43:29,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:29,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 111 states and 155 transitions. [2024-11-09 00:43:29,783 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 155 transitions. [2024-11-09 00:43:29,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 00:43:29,783 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:29,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:29,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 00:43:30,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:30,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 113 states and 158 transitions. [2024-11-09 00:43:30,100 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 158 transitions. [2024-11-09 00:43:30,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 00:43:30,100 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:30,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:31,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:40,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:40,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 122 states and 172 transitions. [2024-11-09 00:43:40,030 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 172 transitions. [2024-11-09 00:43:40,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 00:43:40,030 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:40,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:40,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 00:43:41,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:41,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 124 states and 175 transitions. [2024-11-09 00:43:41,255 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 175 transitions. [2024-11-09 00:43:41,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 00:43:41,255 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:41,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:41,309 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 00:43:42,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:42,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 128 states and 179 transitions. [2024-11-09 00:43:42,391 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 179 transitions. [2024-11-09 00:43:42,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 00:43:42,392 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:42,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:43,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:51,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:51,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 142 states and 204 transitions. [2024-11-09 00:43:51,297 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 204 transitions. [2024-11-09 00:43:51,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 00:43:51,297 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:51,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:53,655 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:44:03,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:44:03,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 71 states and 95 transitions. [2024-11-09 00:44:03,128 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 95 transitions. [2024-11-09 00:44:03,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 00:44:03,129 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:44:03,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:44:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:44:04,139 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 00:44:09,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:44:09,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 79 states and 107 transitions. [2024-11-09 00:44:09,487 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 107 transitions. [2024-11-09 00:44:09,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 00:44:09,487 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:44:09,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:44:09,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:44:09,840 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 00:44:10,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:44:10,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 81 states and 109 transitions. [2024-11-09 00:44:10,997 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 109 transitions. [2024-11-09 00:44:10,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 00:44:10,998 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:44:10,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:44:11,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:44:13,766 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:44:29,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:44:29,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 90 states and 126 transitions. [2024-11-09 00:44:29,506 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 126 transitions. [2024-11-09 00:44:29,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 00:44:29,506 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:44:29,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:44:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:44:29,865 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 00:44:32,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:44:32,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 94 states and 130 transitions. [2024-11-09 00:44:32,992 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 130 transitions. [2024-11-09 00:44:32,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 00:44:32,993 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:44:32,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:44:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:44:37,536 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:44:51,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:44:51,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 98 states and 135 transitions. [2024-11-09 00:44:51,449 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 135 transitions. [2024-11-09 00:44:51,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 00:44:51,450 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:44:51,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:44:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:44:54,705 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:45:02,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:45:02,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 105 states and 146 transitions. [2024-11-09 00:45:02,777 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 146 transitions. [2024-11-09 00:45:02,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 00:45:02,778 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:45:02,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:45:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:45:03,297 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:45:04,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:45:04,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 107 states and 150 transitions. [2024-11-09 00:45:04,767 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 150 transitions. [2024-11-09 00:45:04,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 00:45:04,767 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:45:04,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:45:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:45:09,021 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:45:27,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:45:27,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 40 states and 44 transitions. [2024-11-09 00:45:27,117 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2024-11-09 00:45:27,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 00:45:27,117 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 59 iterations. [2024-11-09 00:45:27,126 INFO L729 CodeCheckObserver]: All specifications hold 35 specifications checked. All of them hold [2024-11-09 00:45:35,530 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:45:35,530 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:45:35,530 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:45:35,530 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:45:35,530 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:45:35,530 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:45:35,530 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:45:35,531 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) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (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) (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~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|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-09 00:45:35,531 INFO L77 FloydHoareUtils]: At program point L560-1(line 560) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (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) (= .cse0 |ULTIMATE.start_test_fun_#t~mem11#1|) (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~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 .cse0) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-11-09 00:45:35,531 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:45:35,532 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 571 573) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-09 00:45:35,532 INFO L77 FloydHoareUtils]: At program point L552(line 552) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (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) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~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) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-09 00:45:35,532 INFO L77 FloydHoareUtils]: At program point L552-1(line 552) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (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) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~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) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-09 00:45:35,533 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:45:35,533 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:45:35,533 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:45:35,533 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:45:35,533 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:45:35,533 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:45:35,534 INFO L77 FloydHoareUtils]: At program point L565(line 565) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (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) (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) .cse0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~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 .cse0) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-11-09 00:45:35,534 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:45:35,534 INFO L77 FloydHoareUtils]: At program point L565-1(line 565) 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|)) (.cse1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse0 |ULTIMATE.start_test_fun_#t~mem14#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) (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (<= .cse0 .cse1) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~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 .cse1) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-11-09 00:45:35,535 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:45:35,535 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:45:35,535 INFO L77 FloydHoareUtils]: At program point L553(line 553) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (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) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~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|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-09 00:45:35,535 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:45:35,535 INFO L77 FloydHoareUtils]: At program point test_fun_returnLabel#1(lines 547 570) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-09 00:45:35,535 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK(lines 571 573) no Hoare annotation was computed. [2024-11-09 00:45:35,536 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-09 00:45:35,536 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:45:35,536 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:45:35,536 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:45:35,536 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:45:35,536 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:45:35,537 INFO L77 FloydHoareUtils]: At program point L562(line 562) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 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)) (.cse6 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse3 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse4 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse5 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse7 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< .cse6 1) .cse7) (and .cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse1 .cse2 (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (<= .cse6 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) .cse3 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |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|)) .cse5 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) .cse7 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))))) [2024-11-09 00:45:35,537 INFO L77 FloydHoareUtils]: At program point L562-1(lines 562 564) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 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)) (.cse4 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse5 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse6 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse7 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|))) (or (let ((.cse3 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and .cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse1 .cse2 (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (<= .cse3 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) .cse4 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (= .cse3 |ULTIMATE.start_test_fun_#t~mem12#1|) .cse5 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) .cse6 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) .cse7 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (and .cse0 .cse1 (< |ULTIMATE.start_test_fun_#t~mem12#1| 1) .cse2 .cse4 .cse5 .cse6 .cse7))) [2024-11-09 00:45:35,538 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:45:35,538 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:45:35,538 INFO L77 FloydHoareUtils]: At program point L558-1(lines 558 568) the Hoare annotation is: (let ((.cse7 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse1 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse8 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse10 (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse11 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse12 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse9 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse13 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse14 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse4 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse15 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse5 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse6 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 (= |ULTIMATE.start_test_fun_#t~mem8#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse8 (not (= .cse9 0)) .cse10 .cse2 .cse3 .cse11 .cse12 .cse13 .cse14 (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) .cse9) .cse4 .cse15 .cse5 .cse6) (and .cse7 .cse0 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse1 .cse8 .cse10 .cse2 .cse3 .cse11 .cse12 (<= 1 .cse9) .cse13 .cse14 .cse4 .cse15 .cse5 .cse6))) [2024-11-09 00:45:35,538 INFO L77 FloydHoareUtils]: At program point L558-3(lines 558 568) the Hoare annotation is: (let ((.cse12 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 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)) (.cse5 (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse6 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse7 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse8 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse4 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse10 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse11 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse13 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse14 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse15 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse16 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= .cse4 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= (+ .cse12 1) .cse4) .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 (= .cse12 0) .cse2 .cse3 .cse6 .cse7 .cse9 .cse13 .cse15 .cse16) (and .cse0 .cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 1 .cse4) .cse10 .cse11 .cse13 .cse14 .cse15 .cse16))) [2024-11-09 00:45:35,539 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) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (or (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 0) (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (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) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~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|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-09 00:45:35,539 INFO L77 FloydHoareUtils]: At program point L558-4(lines 558 568) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-09 00:45:35,539 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-09 00:45:35,539 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:45:35,540 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:45:35,540 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:45:35,540 INFO L77 FloydHoareUtils]: At program point L567(line 567) the Hoare annotation is: (let ((.cse13 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (let ((.cse12 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse4 (not (= .cse13 0))) (.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 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)) (.cse5 (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse6 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse7 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse8 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse10 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse11 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse14 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse15 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse16 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse17 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= (+ .cse12 1) .cse13) .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 (= .cse12 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 1 .cse13) .cse10 .cse11 .cse14 .cse15 .cse16 .cse17)))) [2024-11-09 00:45:35,540 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:45:35,540 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:45:35,541 INFO L77 FloydHoareUtils]: At program point L563(line 563) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 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) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-09 00:45:35,541 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:45:35,541 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:45:35,541 INFO L77 FloydHoareUtils]: At program point L559(line 559) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 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)) (.cse5 (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse6 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse7 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse8 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse4 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse10 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse11 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse12 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse13 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse14 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse15 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= .cse4 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) .cse4) .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 1 .cse4) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2024-11-09 00:45:35,541 INFO L77 FloydHoareUtils]: At program point L559-1(line 559) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 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)) (.cse9 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse4 (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse5 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse6 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse7 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse8 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse10 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse12 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse13 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse11 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse14 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse15 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse16 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 1 .cse9) .cse10 (= |ULTIMATE.start_test_fun_#t~mem9#1| .cse11) .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 (<= (+ |ULTIMATE.start_test_fun_#t~mem9#1| 1) .cse9) (not (= .cse9 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse13 (< .cse11 1) .cse14 .cse15 .cse16))) [2024-11-09 00:45:35,542 INFO L77 FloydHoareUtils]: At program point L559-2(lines 559 566) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 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)) (.cse5 (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse6 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse7 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse8 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse4 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse10 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse13 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse11 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse12 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse14 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse15 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse16 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= .cse4 0)) .cse5 .cse6 (<= (+ |ULTIMATE.start_test_fun_#t~mem9#1| 1) |ULTIMATE.start_test_fun_#t~mem10#1|) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< .cse13 1) .cse14 .cse15 .cse16) (and .cse0 .cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse2 .cse3 (= .cse4 |ULTIMATE.start_test_fun_#t~mem10#1|) .cse5 .cse6 .cse7 .cse8 .cse9 (<= 1 .cse4) .cse10 (= |ULTIMATE.start_test_fun_#t~mem9#1| .cse13) .cse11 .cse12 .cse14 .cse15 .cse16))) [2024-11-09 00:45:35,542 INFO L77 FloydHoareUtils]: At program point L559-4(lines 559 566) the Hoare annotation is: (let ((.cse13 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (let ((.cse12 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse4 (not (= .cse13 0))) (.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 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)) (.cse5 (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse6 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse7 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse8 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse10 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse11 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse14 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse15 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse16 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse17 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= (+ .cse12 1) .cse13) .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 (= .cse12 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 1 .cse13) .cse10 .cse11 .cse14 .cse15 .cse16 .cse17)))) [2024-11-09 00:45:35,542 INFO L77 FloydHoareUtils]: At program point L555-1(line 555) 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) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (or (= .cse0 0) (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (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) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~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|)) (or |ULTIMATE.start_test_fun_#t~short7#1| (< 0 .cse0)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-11-09 00:45:35,543 INFO L77 FloydHoareUtils]: At program point L555-3(line 555) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (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) (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~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|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-09 00:45:35,543 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:45:35,544 INFO L77 FloydHoareUtils]: At program point L555-5(lines 555 557) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse1 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse3 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|))) (or (and |ULTIMATE.start_test_fun_#t~short7#1| .cse0 .cse1 .cse2 .cse3) (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse0 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) .cse1 (= |ULTIMATE.start_test_fun_~c~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|)) (<= 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|)) .cse2 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) .cse3 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))))) [2024-11-09 00:45:35,544 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:45:35,552 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-09 00:45:35,553 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 00:45:35,560 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-09 00:45:35,560 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 00:45:35,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.11 12:45:35 ImpRootNode [2024-11-09 00:45:35,562 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-09 00:45:35,563 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:45:35,563 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:45:35,563 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:45:35,564 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:42:58" (3/4) ... [2024-11-09 00:45:35,566 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 00:45:35,575 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2024-11-09 00:45:35,575 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 00:45:35,576 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-09 00:45:35,576 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 00:45:35,689 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a17bcbb-ad17-4521-ad60-dcda47d9df78/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-09 00:45:35,690 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a17bcbb-ad17-4521-ad60-dcda47d9df78/bin/ukojak-verify-ImItNfHLgk/witness.yml [2024-11-09 00:45:35,690 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:45:35,691 INFO L158 Benchmark]: Toolchain (without parser) took 158348.07ms. Allocated memory was 132.1MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 93.2MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 344.0MB. Max. memory is 16.1GB. [2024-11-09 00:45:35,691 INFO L158 Benchmark]: CDTParser took 0.85ms. Allocated memory is still 132.1MB. Free memory is still 79.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:45:35,691 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.83ms. Allocated memory is still 132.1MB. Free memory was 93.0MB in the beginning and 74.6MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 00:45:35,691 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.94ms. Allocated memory is still 132.1MB. Free memory was 74.6MB in the beginning and 72.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:45:35,692 INFO L158 Benchmark]: Boogie Preprocessor took 46.56ms. Allocated memory is still 132.1MB. Free memory was 72.6MB in the beginning and 71.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:45:35,696 INFO L158 Benchmark]: RCFGBuilder took 691.46ms. Allocated memory was 132.1MB in the beginning and 172.0MB in the end (delta: 39.8MB). Free memory was 71.1MB in the beginning and 129.6MB in the end (delta: -58.5MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2024-11-09 00:45:35,697 INFO L158 Benchmark]: CodeCheck took 156944.39ms. Allocated memory was 172.0MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 129.6MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 335.5MB. Max. memory is 16.1GB. [2024-11-09 00:45:35,697 INFO L158 Benchmark]: Witness Printer took 127.35ms. Allocated memory is still 1.6GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:45:35,699 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, 61 locations, 35 error locations. Started 1 CEGAR loops. OverallTime: 148.5s, OverallIterations: 59, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12295 SdHoareTripleChecker+Valid, 58.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11220 mSDsluCounter, 5083 SdHoareTripleChecker+Invalid, 51.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3985 mSDsCounter, 3729 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30206 IncrementalHoareTripleChecker+Invalid, 33935 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3729 mSolverCounterUnsat, 1098 mSDtfsCounter, 30206 mSolverCounterSat, 1.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7836 GetRequests, 6763 SyntacticMatches, 353 SemanticMatches, 720 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280580 ImplicationChecksByTransitivity, 136.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 25.8s InterpolantComputationTime, 944 NumberOfCodeBlocks, 944 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 886 ConstructedInterpolants, 0 QuantifiedInterpolants, 10643 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 58 InterpolantComputations, 51 PerfectInterpolantSequences, 63/121 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: -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: 571]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 35 specifications checked. All of them hold * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.85ms. Allocated memory is still 132.1MB. Free memory is still 79.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 481.83ms. Allocated memory is still 132.1MB. Free memory was 93.0MB in the beginning and 74.6MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.94ms. Allocated memory is still 132.1MB. Free memory was 74.6MB in the beginning and 72.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.56ms. Allocated memory is still 132.1MB. Free memory was 72.6MB in the beginning and 71.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 691.46ms. Allocated memory was 132.1MB in the beginning and 172.0MB in the end (delta: 39.8MB). Free memory was 71.1MB in the beginning and 129.6MB in the end (delta: -58.5MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * CodeCheck took 156944.39ms. Allocated memory was 172.0MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 129.6MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 335.5MB. Max. memory is 16.1GB. * Witness Printer took 127.35ms. Allocated memory is still 1.6GB. Free memory was 1.2GB in the beginning and 1.2GB 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 RESULT: Ultimate proved your program to be correct! [2024-11-09 00:45:35,730 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a17bcbb-ad17-4521-ad60-dcda47d9df78/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