./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac1eb81b-f0f6-498b-83aa-00406e02f0fb/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac1eb81b-f0f6-498b-83aa-00406e02f0fb/bin/ukojak-verify-ENZ3QT5qd3/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac1eb81b-f0f6-498b-83aa-00406e02f0fb/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac1eb81b-f0f6-498b-83aa-00406e02f0fb/bin/ukojak-verify-ENZ3QT5qd3/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac1eb81b-f0f6-498b-83aa-00406e02f0fb/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac1eb81b-f0f6-498b-83aa-00406e02f0fb/bin/ukojak-verify-ENZ3QT5qd3 --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 0301294b5b50ee43814efe2bd49b834b2b8f0455334e679e746f10ee76ed616a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-25 04:12:32,975 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-25 04:12:33,047 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac1eb81b-f0f6-498b-83aa-00406e02f0fb/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf [2024-11-25 04:12:33,052 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-25 04:12:33,052 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-25 04:12:33,085 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-25 04:12:33,089 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-25 04:12:33,089 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-25 04:12:33,089 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-25 04:12:33,089 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-25 04:12:33,089 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-25 04:12:33,090 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-25 04:12:33,090 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-25 04:12:33,090 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-25 04:12:33,090 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-25 04:12:33,090 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-25 04:12:33,090 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-25 04:12:33,090 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-25 04:12:33,090 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-25 04:12:33,090 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-25 04:12:33,091 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-25 04:12:33,091 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-25 04:12:33,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 04:12:33,091 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-25 04:12:33,091 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-25 04:12:33,091 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-25 04:12:33,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-25 04:12:33,091 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_ac1eb81b-f0f6-498b-83aa-00406e02f0fb/bin/ukojak-verify-ENZ3QT5qd3 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 -> 0301294b5b50ee43814efe2bd49b834b2b8f0455334e679e746f10ee76ed616a [2024-11-25 04:12:33,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-25 04:12:33,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-25 04:12:33,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-25 04:12:33,380 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-25 04:12:33,381 INFO L274 PluginConnector]: CDTParser initialized [2024-11-25 04:12:33,382 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac1eb81b-f0f6-498b-83aa-00406e02f0fb/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca.i [2024-11-25 04:12:36,293 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac1eb81b-f0f6-498b-83aa-00406e02f0fb/bin/ukojak-verify-ENZ3QT5qd3/data/41923acd4/870fc68c361a4be081e1c0a4e20b2f09/FLAG4b2588377 [2024-11-25 04:12:36,647 INFO L384 CDTParser]: Found 1 translation units. [2024-11-25 04:12:36,648 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac1eb81b-f0f6-498b-83aa-00406e02f0fb/sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca.i [2024-11-25 04:12:36,666 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac1eb81b-f0f6-498b-83aa-00406e02f0fb/bin/ukojak-verify-ENZ3QT5qd3/data/41923acd4/870fc68c361a4be081e1c0a4e20b2f09/FLAG4b2588377 [2024-11-25 04:12:36,851 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac1eb81b-f0f6-498b-83aa-00406e02f0fb/bin/ukojak-verify-ENZ3QT5qd3/data/41923acd4/870fc68c361a4be081e1c0a4e20b2f09 [2024-11-25 04:12:36,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-25 04:12:36,854 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-25 04:12:36,855 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-25 04:12:36,855 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-25 04:12:36,859 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-25 04:12:36,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:12:36" (1/1) ... [2024-11-25 04:12:36,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20ccf772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:12:36, skipping insertion in model container [2024-11-25 04:12:36,861 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:12:36" (1/1) ... [2024-11-25 04:12:36,886 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-25 04:12:37,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 04:12:37,137 INFO L200 MainTranslator]: Completed pre-run [2024-11-25 04:12:37,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 04:12:37,199 INFO L204 MainTranslator]: Completed translation [2024-11-25 04:12:37,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:12:37 WrapperNode [2024-11-25 04:12:37,200 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-25 04:12:37,200 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-25 04:12:37,200 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-25 04:12:37,201 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-25 04:12:37,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:12:37" (1/1) ... [2024-11-25 04:12:37,217 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:12:37" (1/1) ... [2024-11-25 04:12:37,232 INFO L138 Inliner]: procedures = 110, calls = 15, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 44 [2024-11-25 04:12:37,232 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-25 04:12:37,233 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-25 04:12:37,233 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-25 04:12:37,233 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-25 04:12:37,239 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:12:37" (1/1) ... [2024-11-25 04:12:37,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:12:37" (1/1) ... [2024-11-25 04:12:37,242 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:12:37" (1/1) ... [2024-11-25 04:12:37,242 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:12:37" (1/1) ... [2024-11-25 04:12:37,245 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:12:37" (1/1) ... [2024-11-25 04:12:37,246 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:12:37" (1/1) ... [2024-11-25 04:12:37,249 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:12:37" (1/1) ... [2024-11-25 04:12:37,250 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:12:37" (1/1) ... [2024-11-25 04:12:37,250 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:12:37" (1/1) ... [2024-11-25 04:12:37,252 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-25 04:12:37,252 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-25 04:12:37,252 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-25 04:12:37,252 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-25 04:12:37,253 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:12:37" (1/1) ... [2024-11-25 04:12:37,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 04:12:37,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac1eb81b-f0f6-498b-83aa-00406e02f0fb/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-25 04:12:37,283 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac1eb81b-f0f6-498b-83aa-00406e02f0fb/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-25 04:12:37,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac1eb81b-f0f6-498b-83aa-00406e02f0fb/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-25 04:12:37,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-25 04:12:37,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-25 04:12:37,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-25 04:12:37,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-25 04:12:37,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-25 04:12:37,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-25 04:12:37,419 INFO L234 CfgBuilder]: Building ICFG [2024-11-25 04:12:37,421 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-25 04:12:37,671 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-25 04:12:37,672 INFO L283 CfgBuilder]: Performing block encoding [2024-11-25 04:12:37,715 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-25 04:12:37,715 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-25 04:12:37,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:12:37 BoogieIcfgContainer [2024-11-25 04:12:37,717 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-25 04:12:37,717 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-25 04:12:37,717 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-25 04:12:37,727 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-25 04:12:37,727 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:12:37" (1/1) ... [2024-11-25 04:12:37,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-25 04:12:37,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:12:37,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 43 states and 48 transitions. [2024-11-25 04:12:37,791 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2024-11-25 04:12:37,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-25 04:12:37,793 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:12:37,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:12:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:12:38,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:12:38,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:12:38,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 42 states and 47 transitions. [2024-11-25 04:12:38,081 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2024-11-25 04:12:38,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-25 04:12:38,085 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:12:38,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:12:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:12:38,225 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-25 04:12:38,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:12:38,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 41 states and 46 transitions. [2024-11-25 04:12:38,368 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2024-11-25 04:12:38,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-25 04:12:38,369 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:12:38,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:12:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:12:38,397 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-25 04:12:38,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:12:38,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 40 states and 44 transitions. [2024-11-25 04:12:38,424 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2024-11-25 04:12:38,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-25 04:12:38,424 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:12:38,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:12:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:12:38,520 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-25 04:12:38,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:12:38,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 41 states and 49 transitions. [2024-11-25 04:12:38,713 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2024-11-25 04:12:38,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-25 04:12:38,714 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:12:38,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:12:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:12:38,772 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-25 04:12:38,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:12:38,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 40 states and 48 transitions. [2024-11-25 04:12:38,819 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2024-11-25 04:12:38,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-25 04:12:38,819 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:12:38,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:12:38,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:12:38,909 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-25 04:12:38,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:12:38,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 42 states and 51 transitions. [2024-11-25 04:12:38,941 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2024-11-25 04:12:38,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-25 04:12:38,942 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:12:38,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:12:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:12:39,120 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-25 04:12:39,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:12:39,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 46 states and 60 transitions. [2024-11-25 04:12:39,461 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2024-11-25 04:12:39,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-25 04:12:39,461 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:12:39,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:12:39,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:12:39,504 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-25 04:12:39,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:12:39,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 45 states and 59 transitions. [2024-11-25 04:12:39,528 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2024-11-25 04:12:39,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-25 04:12:39,528 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:12:39,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:12:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:12:39,601 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-25 04:12:39,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:12:39,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 47 states and 62 transitions. [2024-11-25 04:12:39,631 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2024-11-25 04:12:39,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-25 04:12:39,631 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:12:39,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:12:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:12:39,697 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-25 04:12:39,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:12:39,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 48 states and 64 transitions. [2024-11-25 04:12:39,751 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2024-11-25 04:12:39,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-25 04:12:39,751 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:12:39,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:12:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:12:39,790 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-25 04:12:39,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:12:39,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 47 states and 63 transitions. [2024-11-25 04:12:39,929 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 63 transitions. [2024-11-25 04:12:39,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-25 04:12:39,929 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:12:39,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:12:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:12:39,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:12:40,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:12:40,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 49 states and 64 transitions. [2024-11-25 04:12:40,156 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2024-11-25 04:12:40,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-25 04:12:40,156 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:12:40,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:12:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:12:40,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-25 04:12:40,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:12:40,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 48 states and 63 transitions. [2024-11-25 04:12:40,283 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2024-11-25 04:12:40,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-25 04:12:40,284 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:12:40,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:12:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:12:40,319 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-25 04:12:40,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:12:40,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 50 states and 65 transitions. [2024-11-25 04:12:40,472 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2024-11-25 04:12:40,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-25 04:12:40,472 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:12:40,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:12:40,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:12:40,499 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-25 04:12:40,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:12:40,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 49 states and 64 transitions. [2024-11-25 04:12:40,523 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2024-11-25 04:12:40,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-25 04:12:40,523 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:12:40,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:12:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:12:40,563 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-25 04:12:40,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:12:40,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 51 states and 66 transitions. [2024-11-25 04:12:40,590 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2024-11-25 04:12:40,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-25 04:12:40,590 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:12:40,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:12:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:12:40,611 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-25 04:12:40,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:12:40,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 50 states and 65 transitions. [2024-11-25 04:12:40,626 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2024-11-25 04:12:40,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-25 04:12:40,626 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:12:40,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:12:40,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:12:40,663 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-25 04:12:40,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:12:40,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 51 states and 66 transitions. [2024-11-25 04:12:40,685 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2024-11-25 04:12:40,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-25 04:12:40,686 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:12:40,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:12:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:12:40,820 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-25 04:12:41,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:12:41,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 55 states and 71 transitions. [2024-11-25 04:12:41,001 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 71 transitions. [2024-11-25 04:12:41,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-25 04:12:41,002 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:12:41,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:12:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:12:41,025 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-25 04:12:41,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:12:41,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 54 states and 70 transitions. [2024-11-25 04:12:41,048 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2024-11-25 04:12:41,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-25 04:12:41,049 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:12:41,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:12:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:12:41,132 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-25 04:12:41,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:12:41,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 55 states and 71 transitions. [2024-11-25 04:12:41,152 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 71 transitions. [2024-11-25 04:12:41,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-25 04:12:41,153 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:12:41,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:12:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:12:41,210 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-25 04:12:41,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:12:41,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 57 states and 73 transitions. [2024-11-25 04:12:41,248 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 73 transitions. [2024-11-25 04:12:41,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-25 04:12:41,248 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:12:41,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:12:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:12:41,277 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-25 04:12:41,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:12:41,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 56 states and 72 transitions. [2024-11-25 04:12:41,296 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2024-11-25 04:12:41,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-25 04:12:41,297 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:12:41,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:12:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:12:41,350 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-25 04:12:41,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:12:41,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 57 states and 73 transitions. [2024-11-25 04:12:41,375 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 73 transitions. [2024-11-25 04:12:41,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-25 04:12:41,378 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:12:41,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:12:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:12:41,417 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-25 04:12:41,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:12:41,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 56 states and 72 transitions. [2024-11-25 04:12:41,445 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2024-11-25 04:12:41,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-25 04:12:41,446 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:12:41,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:12:41,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:12:41,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:12:41,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:12:41,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 31 states and 40 transitions. [2024-11-25 04:12:41,565 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2024-11-25 04:12:41,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-25 04:12:41,566 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:12:41,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:12:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:12:41,740 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-25 04:12:42,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:12:42,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 33 states and 42 transitions. [2024-11-25 04:12:42,258 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2024-11-25 04:12:42,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 04:12:42,258 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:12:42,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:12:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:12:42,338 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-25 04:12:42,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:12:42,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 40 states and 50 transitions. [2024-11-25 04:12:42,584 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2024-11-25 04:12:42,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-25 04:12:42,585 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:12:42,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:12:42,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:12:42,737 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:12:43,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:12:43,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 44 states and 54 transitions. [2024-11-25 04:12:43,488 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2024-11-25 04:12:43,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-25 04:12:43,488 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:12:43,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:12:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:12:43,673 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:12:44,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:12:44,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 49 states and 60 transitions. [2024-11-25 04:12:44,844 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2024-11-25 04:12:44,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-25 04:12:44,845 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:12:44,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:12:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:12:44,986 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:12:46,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:12:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 54 states and 66 transitions. [2024-11-25 04:12:46,213 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2024-11-25 04:12:46,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-25 04:12:46,214 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:12:46,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:12:46,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:12:46,399 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:12:46,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:12:46,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 57 states and 69 transitions. [2024-11-25 04:12:46,821 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2024-11-25 04:12:46,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-25 04:12:46,822 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:12:46,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:12:46,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:12:46,978 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:12:47,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:12:47,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 39 states and 46 transitions. [2024-11-25 04:12:47,909 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2024-11-25 04:12:47,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-25 04:12:47,910 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 34 iterations. [2024-11-25 04:12:47,917 INFO L726 CodeCheckObserver]: All specifications hold 23 specifications checked. All of them hold [2024-11-25 04:12:49,345 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:12:49,346 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:12:49,346 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:12:49,346 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:12:49,346 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:12:49,348 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:12:49,349 INFO L77 FloydHoareUtils]: At program point L556(line 556) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~x~0#1.offset| 0)) (.cse1 (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)) (.cse2 (<= 4 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)))) (or (and .cse0 (= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_#t~malloc2#1.base| 0)) .cse1 .cse2) (and .cse0 .cse1 .cse2 (= 35 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))) [2024-11-25 04:12:49,351 INFO L77 FloydHoareUtils]: At program point L556-1(lines 556 560) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~x~0#1.offset| 0)) (.cse1 (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)) (.cse2 (<= 4 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_#t~mem9#1| 35)) (and .cse0 (= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_#t~malloc2#1.base| 0)) .cse1 .cse2))) [2024-11-25 04:12:49,351 INFO L77 FloydHoareUtils]: At program point L552-1(line 552) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~x~0#1.offset| 0)) (.cse1 (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)) (.cse2 (<= 4 (select |#length| |ULTIMATE.start_main_~x~0#1.base|))) (.cse3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (or (and .cse0 (= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_#t~malloc2#1.base| 0)) .cse1 .cse2) (and .cse0 .cse1 .cse2 |ULTIMATE.start_main_#t~short7#1| (<= (+ 5 .cse3) 0)) (and .cse0 .cse1 .cse2 (= 35 .cse3) |ULTIMATE.start_main_#t~short7#1|))) [2024-11-25 04:12:49,352 INFO L77 FloydHoareUtils]: At program point L552-2(line 552) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~x~0#1.offset| 0)) (.cse1 (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)) (.cse2 (<= 4 (select |#length| |ULTIMATE.start_main_~x~0#1.base|))) (.cse3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (or (and .cse0 (= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_#t~malloc2#1.base| 0)) .cse1 .cse2) (and .cse0 .cse1 .cse2 (= 35 .cse3)) (and .cse0 .cse1 .cse2 (<= (+ 5 .cse3) 0)))) [2024-11-25 04:12:49,352 INFO L77 FloydHoareUtils]: At program point L548(lines 548 566) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-25 04:12:49,352 INFO L77 FloydHoareUtils]: At program point L552-5(lines 552 564) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~x~0#1.offset| 0)) (.cse1 (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)) (.cse2 (<= 4 (select |#length| |ULTIMATE.start_main_~x~0#1.base|))) (.cse3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (or (and .cse0 (= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_#t~malloc2#1.base| 0)) .cse1 .cse2) (and .cse0 .cse1 .cse2 |ULTIMATE.start_main_#t~short7#1| (<= (+ 5 .cse3) 0)) (and .cse0 .cse1 .cse2 (= 35 .cse3) |ULTIMATE.start_main_#t~short7#1|))) [2024-11-25 04:12:49,352 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:12:49,352 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:12:49,352 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:12:49,353 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:12:49,353 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:12:49,353 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:12:49,353 INFO L77 FloydHoareUtils]: At program point L557(line 557) the Hoare annotation is: (and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_main_~x~0#1.base|))) [2024-11-25 04:12:49,357 INFO L77 FloydHoareUtils]: At program point L553(line 553) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~x~0#1.offset| 0)) (.cse1 (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)) (.cse2 (<= 4 (select |#length| |ULTIMATE.start_main_~x~0#1.base|))) (.cse3 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (or (and .cse0 (= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_#t~malloc2#1.base| 0)) .cse1 .cse2) (and .cse0 .cse1 .cse2 (= 35 .cse3)) (and .cse0 .cse1 .cse2 (<= (+ 5 .cse3) 0)))) [2024-11-25 04:12:49,357 INFO L77 FloydHoareUtils]: At program point L553-1(lines 553 561) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~x~0#1.offset| 0)) (.cse1 (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)) (.cse2 (<= 4 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)))) (or (and .cse0 (= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_#t~malloc2#1.base| 0)) .cse1 .cse2) (and .cse0 .cse1 .cse2 (= 35 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (and (<= (+ |ULTIMATE.start_main_#t~mem8#1| 5) 0) .cse0 .cse1 .cse2))) [2024-11-25 04:12:49,357 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-25 04:12:49,357 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:12:49,358 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:12:49,358 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:12:49,358 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:12:49,358 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:12:49,358 INFO L77 FloydHoareUtils]: At program point L554(line 554) the Hoare annotation is: (and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_main_~x~0#1.base|))) [2024-11-25 04:12:49,358 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-25 04:12:49,358 INFO L77 FloydHoareUtils]: At program point L550(line 550) the Hoare annotation is: (and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_#t~malloc2#1.base| 0)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#length| |ULTIMATE.start_main_~x~0#1.base|) 4)) [2024-11-25 04:12:49,358 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:12:49,358 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:12:49,358 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:12:49,358 INFO L77 FloydHoareUtils]: At program point L563(line 563) the Hoare annotation is: (and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_#t~malloc2#1.base| 0)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_main_~x~0#1.base|))) [2024-11-25 04:12:49,358 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:12:49,359 INFO L77 FloydHoareUtils]: At program point L563-1(lines 551 565) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~x~0#1.offset| 0)) (.cse2 (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)) (.cse3 (<= 4 (select |#length| |ULTIMATE.start_main_~x~0#1.base|))) (.cse4 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (or (let ((.cse1 (+ 5 .cse4))) (and .cse0 (<= 0 .cse1) .cse2 .cse3 (<= .cse1 0))) (and .cse0 (= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_#t~malloc2#1.base| 0)) .cse2 .cse3) (and .cse0 .cse2 .cse3 (= 35 .cse4)))) [2024-11-25 04:12:49,359 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:12:49,359 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK(lines 548 566) no Hoare annotation was computed. [2024-11-25 04:12:49,359 INFO L77 FloydHoareUtils]: At program point L559(line 559) the Hoare annotation is: (and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_#t~malloc2#1.base| 0)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_main_~x~0#1.base|))) [2024-11-25 04:12:49,359 INFO L77 FloydHoareUtils]: At program point L559-1(line 559) the Hoare annotation is: (and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_#t~malloc2#1.base| 0)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_main_~x~0#1.base|))) [2024-11-25 04:12:49,359 INFO L77 FloydHoareUtils]: At program point L551-1(lines 551 565) the Hoare annotation is: (let ((.cse3 (not (= |ULTIMATE.start_main_#t~mem4#1| 0))) (.cse0 (= |ULTIMATE.start_main_~x~0#1.offset| 0)) (.cse1 (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)) (.cse2 (<= 4 (select |#length| |ULTIMATE.start_main_~x~0#1.base|))) (.cse5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (or (and .cse0 (= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_#t~malloc2#1.base| 0)) .cse1 .cse2) (let ((.cse4 (+ 5 .cse5))) (and .cse3 .cse0 (<= 0 .cse4) .cse1 .cse2 (<= .cse4 0))) (and .cse3 .cse0 .cse1 .cse2 (= 35 .cse5)))) [2024-11-25 04:12:49,359 INFO L77 FloydHoareUtils]: At program point L551-2(lines 551 565) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~x~0#1.offset| 0)) (.cse2 (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)) (.cse3 (<= 4 (select |#length| |ULTIMATE.start_main_~x~0#1.base|))) (.cse4 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (or (let ((.cse1 (+ 5 .cse4))) (and .cse0 (<= 0 .cse1) .cse2 .cse3 (<= .cse1 0))) (and .cse0 (= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_#t~malloc2#1.base| 0)) .cse2 .cse3) (and .cse0 .cse2 .cse3 (= 35 .cse4)))) [2024-11-25 04:12:49,359 INFO L77 FloydHoareUtils]: At program point L551-4(lines 551 565) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_#t~malloc2#1.base| 0)) [2024-11-25 04:12:49,371 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x~0!offset [2024-11-25 04:12:49,374 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-25 04:12:49,374 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-25 04:12:49,374 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x~0!base,]]] [2024-11-25 04:12:49,374 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-25 04:12:49,375 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-25 04:12:49,375 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-25 04:12:49,375 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-25 04:12:49,375 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-25 04:12:49,375 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-25 04:12:49,375 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x~0!base,]]] [2024-11-25 04:12:49,375 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x~0!offset [2024-11-25 04:12:49,376 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-25 04:12:49,376 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-25 04:12:49,376 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-25 04:12:49,376 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-25 04:12:49,376 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-25 04:12:49,376 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-25 04:12:49,376 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x~0!offset [2024-11-25 04:12:49,376 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-25 04:12:49,377 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-25 04:12:49,377 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-25 04:12:49,377 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-25 04:12:49,377 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-25 04:12:49,377 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-25 04:12:49,377 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x~0!base,]]] [2024-11-25 04:12:49,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 25.11 04:12:49 ImpRootNode [2024-11-25 04:12:49,379 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-25 04:12:49,379 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-25 04:12:49,380 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-25 04:12:49,380 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-25 04:12:49,380 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:12:37" (3/4) ... [2024-11-25 04:12:49,383 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-25 04:12:49,388 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-25 04:12:49,389 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-25 04:12:49,389 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-25 04:12:49,389 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-25 04:12:49,462 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac1eb81b-f0f6-498b-83aa-00406e02f0fb/bin/ukojak-verify-ENZ3QT5qd3/witness.graphml [2024-11-25 04:12:49,462 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac1eb81b-f0f6-498b-83aa-00406e02f0fb/bin/ukojak-verify-ENZ3QT5qd3/witness.yml [2024-11-25 04:12:49,462 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-25 04:12:49,463 INFO L158 Benchmark]: Toolchain (without parser) took 12608.61ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 106.9MB in the beginning and 288.4MB in the end (delta: -181.6MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2024-11-25 04:12:49,463 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 167.8MB. Free memory is still 105.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 04:12:49,463 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.49ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 90.7MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-25 04:12:49,464 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.10ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 89.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 04:12:49,464 INFO L158 Benchmark]: Boogie Preprocessor took 18.73ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 88.4MB in the end (delta: 983.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 04:12:49,464 INFO L158 Benchmark]: RCFGBuilder took 464.39ms. Allocated memory is still 142.6MB. Free memory was 88.4MB in the beginning and 73.1MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-25 04:12:49,464 INFO L158 Benchmark]: CodeCheck took 11661.68ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 73.1MB in the beginning and 292.4MB in the end (delta: -219.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 04:12:49,466 INFO L158 Benchmark]: Witness Printer took 82.70ms. Allocated memory is still 352.3MB. Free memory was 292.4MB in the beginning and 288.4MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 04:12:49,470 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, 43 locations, 23 error locations. Started 1 CEGAR loops. OverallTime: 10.2s, OverallIterations: 34, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2583 SdHoareTripleChecker+Valid, 10.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2343 mSDsluCounter, 1662 SdHoareTripleChecker+Invalid, 8.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1018 mSDsCounter, 1167 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5132 IncrementalHoareTripleChecker+Invalid, 6299 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1167 mSolverCounterUnsat, 644 mSDtfsCounter, 5132 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3160 GetRequests, 2964 SyntacticMatches, 66 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6601 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 387 NumberOfCodeBlocks, 387 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 354 ConstructedInterpolants, 0 QuantifiedInterpolants, 1708 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 63/63 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, ConComCheckerStatistics: 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: 548]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 23 specifications checked. All of them hold * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 167.8MB. Free memory is still 105.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.49ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 90.7MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.10ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 89.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.73ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 88.4MB in the end (delta: 983.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 464.39ms. Allocated memory is still 142.6MB. Free memory was 88.4MB in the beginning and 73.1MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * CodeCheck took 11661.68ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 73.1MB in the beginning and 292.4MB in the end (delta: -219.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 82.70ms. Allocated memory is still 352.3MB. Free memory was 292.4MB in the beginning and 288.4MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x~0!base,]]] RESULT: Ultimate proved your program to be correct! [2024-11-25 04:12:49,494 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac1eb81b-f0f6-498b-83aa-00406e02f0fb/bin/ukojak-verify-ENZ3QT5qd3/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