./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label00.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c47d470-01f9-4b53-b970-9df3cb5939c1/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c47d470-01f9-4b53-b970-9df3cb5939c1/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c47d470-01f9-4b53-b970-9df3cb5939c1/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c47d470-01f9-4b53-b970-9df3cb5939c1/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label00.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c47d470-01f9-4b53-b970-9df3cb5939c1/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c47d470-01f9-4b53-b970-9df3cb5939c1/bin/ukojak-verify-CZk0znPC7b --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ef0fc431edab04e2bc46b00be67c275761704e057ac7d10029420dfecba76e3a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-05 23:47:00,512 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-05 23:47:00,569 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c47d470-01f9-4b53-b970-9df3cb5939c1/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-05 23:47:00,573 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-05 23:47:00,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-05 23:47:00,593 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-05 23:47:00,593 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-05 23:47:00,594 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-05 23:47:00,594 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-05 23:47:00,594 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-05 23:47:00,594 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-05 23:47:00,594 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-05 23:47:00,594 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-05 23:47:00,595 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-05 23:47:00,595 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-05 23:47:00,595 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-05 23:47:00,595 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-05 23:47:00,595 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-05 23:47:00,595 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-05 23:47:00,595 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-05 23:47:00,595 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-05 23:47:00,595 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-05 23:47:00,595 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-05 23:47:00,595 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-05 23:47:00,596 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-05 23:47:00,596 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-05 23:47:00,596 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-05 23:47:00,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-05 23:47:00,596 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-05 23:47:00,596 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-05 23:47:00,596 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-05 23:47:00,596 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-05 23:47:00,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-05 23:47:00,596 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_0c47d470-01f9-4b53-b970-9df3cb5939c1/bin/ukojak-verify-CZk0znPC7b 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ef0fc431edab04e2bc46b00be67c275761704e057ac7d10029420dfecba76e3a [2024-12-05 23:47:00,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-05 23:47:00,840 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-05 23:47:00,843 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-05 23:47:00,844 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-05 23:47:00,844 INFO L274 PluginConnector]: CDTParser initialized [2024-12-05 23:47:00,845 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c47d470-01f9-4b53-b970-9df3cb5939c1/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/eca-rers2012/Problem01_label00.c [2024-12-05 23:47:03,502 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c47d470-01f9-4b53-b970-9df3cb5939c1/bin/ukojak-verify-CZk0znPC7b/data/dcce208b6/4e2671ec86c94807ac47eb8b9ef5858a/FLAGee88744e0 [2024-12-05 23:47:03,743 INFO L384 CDTParser]: Found 1 translation units. [2024-12-05 23:47:03,744 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c47d470-01f9-4b53-b970-9df3cb5939c1/sv-benchmarks/c/eca-rers2012/Problem01_label00.c [2024-12-05 23:47:03,754 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c47d470-01f9-4b53-b970-9df3cb5939c1/bin/ukojak-verify-CZk0znPC7b/data/dcce208b6/4e2671ec86c94807ac47eb8b9ef5858a/FLAGee88744e0 [2024-12-05 23:47:03,767 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c47d470-01f9-4b53-b970-9df3cb5939c1/bin/ukojak-verify-CZk0znPC7b/data/dcce208b6/4e2671ec86c94807ac47eb8b9ef5858a [2024-12-05 23:47:03,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-05 23:47:03,770 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-05 23:47:03,771 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-05 23:47:03,772 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-05 23:47:03,775 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-05 23:47:03,775 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:47:03" (1/1) ... [2024-12-05 23:47:03,776 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bfe1932 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:47:03, skipping insertion in model container [2024-12-05 23:47:03,776 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:47:03" (1/1) ... [2024-12-05 23:47:03,805 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-05 23:47:04,026 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c47d470-01f9-4b53-b970-9df3cb5939c1/sv-benchmarks/c/eca-rers2012/Problem01_label00.c[18976,18989] [2024-12-05 23:47:04,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 23:47:04,055 INFO L200 MainTranslator]: Completed pre-run [2024-12-05 23:47:04,122 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c47d470-01f9-4b53-b970-9df3cb5939c1/sv-benchmarks/c/eca-rers2012/Problem01_label00.c[18976,18989] [2024-12-05 23:47:04,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 23:47:04,144 INFO L204 MainTranslator]: Completed translation [2024-12-05 23:47:04,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:47:04 WrapperNode [2024-12-05 23:47:04,145 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-05 23:47:04,145 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-05 23:47:04,146 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-05 23:47:04,146 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-05 23:47:04,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:47:04" (1/1) ... [2024-12-05 23:47:04,163 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:47:04" (1/1) ... [2024-12-05 23:47:04,203 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-12-05 23:47:04,204 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-05 23:47:04,204 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-05 23:47:04,204 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-05 23:47:04,204 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-05 23:47:04,211 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:47:04" (1/1) ... [2024-12-05 23:47:04,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:47:04" (1/1) ... [2024-12-05 23:47:04,215 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:47:04" (1/1) ... [2024-12-05 23:47:04,215 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:47:04" (1/1) ... [2024-12-05 23:47:04,234 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:47:04" (1/1) ... [2024-12-05 23:47:04,237 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:47:04" (1/1) ... [2024-12-05 23:47:04,244 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:47:04" (1/1) ... [2024-12-05 23:47:04,249 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:47:04" (1/1) ... [2024-12-05 23:47:04,251 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:47:04" (1/1) ... [2024-12-05 23:47:04,257 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-05 23:47:04,258 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-05 23:47:04,258 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-05 23:47:04,258 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-05 23:47:04,259 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:47:04" (1/1) ... [2024-12-05 23:47:04,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-05 23:47:04,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c47d470-01f9-4b53-b970-9df3cb5939c1/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-05 23:47:04,284 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c47d470-01f9-4b53-b970-9df3cb5939c1/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-05 23:47:04,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c47d470-01f9-4b53-b970-9df3cb5939c1/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-05 23:47:04,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-05 23:47:04,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-05 23:47:04,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-05 23:47:04,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-05 23:47:04,356 INFO L234 CfgBuilder]: Building ICFG [2024-12-05 23:47:04,357 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-05 23:47:05,168 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-12-05 23:47:05,168 INFO L283 CfgBuilder]: Performing block encoding [2024-12-05 23:47:05,398 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-05 23:47:05,398 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-05 23:47:05,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:47:05 BoogieIcfgContainer [2024-12-05 23:47:05,398 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-05 23:47:05,399 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-05 23:47:05,399 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-05 23:47:05,409 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-05 23:47:05,409 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:47:05" (1/1) ... [2024-12-05 23:47:05,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 23:47:05,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:05,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-12-05 23:47:05,466 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-12-05 23:47:05,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-12-05 23:47:05,469 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:05,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:05,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:06,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:47:06,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:06,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 145 states and 220 transitions. [2024-12-05 23:47:06,763 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 220 transitions. [2024-12-05 23:47:06,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-05 23:47:06,765 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:06,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:06,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:47:07,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:07,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 214 states and 297 transitions. [2024-12-05 23:47:07,809 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 297 transitions. [2024-12-05 23:47:07,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-12-05 23:47:07,811 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:07,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:08,136 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:47:08,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:08,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 283 states and 367 transitions. [2024-12-05 23:47:08,810 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 367 transitions. [2024-12-05 23:47:08,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-12-05 23:47:08,811 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:08,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:09,034 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:47:09,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:09,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 297 states and 386 transitions. [2024-12-05 23:47:09,519 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 386 transitions. [2024-12-05 23:47:09,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-12-05 23:47:09,523 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:09,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:09,645 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-05 23:47:09,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:09,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 306 states and 397 transitions. [2024-12-05 23:47:09,836 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 397 transitions. [2024-12-05 23:47:09,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-05 23:47:09,838 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:09,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:10,008 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-05 23:47:10,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:10,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 308 states and 399 transitions. [2024-12-05 23:47:10,085 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 399 transitions. [2024-12-05 23:47:10,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-12-05 23:47:10,087 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:10,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:10,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:10,258 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 23:47:11,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:11,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 334 states and 431 transitions. [2024-12-05 23:47:11,059 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 431 transitions. [2024-12-05 23:47:11,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-05 23:47:11,059 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:11,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:11,227 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 23:47:11,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:11,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 351 states and 451 transitions. [2024-12-05 23:47:11,769 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 451 transitions. [2024-12-05 23:47:11,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-12-05 23:47:11,770 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:11,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:11,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:11,935 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-05 23:47:12,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:12,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 380 states and 483 transitions. [2024-12-05 23:47:12,500 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 483 transitions. [2024-12-05 23:47:12,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-12-05 23:47:12,501 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:12,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:12,755 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 60 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-05 23:47:13,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:13,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 428 states and 537 transitions. [2024-12-05 23:47:13,826 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 537 transitions. [2024-12-05 23:47:13,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-05 23:47:13,827 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:13,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:14,065 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-05 23:47:14,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:14,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 431 states and 541 transitions. [2024-12-05 23:47:14,267 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 541 transitions. [2024-12-05 23:47:14,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-05 23:47:14,269 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:14,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:14,452 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:47:15,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:15,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 494 states and 612 transitions. [2024-12-05 23:47:15,763 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 612 transitions. [2024-12-05 23:47:15,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-05 23:47:15,764 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:15,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:15,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:15,938 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:47:16,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:16,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 496 states and 613 transitions. [2024-12-05 23:47:16,119 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 613 transitions. [2024-12-05 23:47:16,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-05 23:47:16,121 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:16,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:16,202 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-12-05 23:47:16,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:16,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 513 states and 633 transitions. [2024-12-05 23:47:16,576 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 633 transitions. [2024-12-05 23:47:16,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-05 23:47:16,578 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:16,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:16,772 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-05 23:47:16,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:16,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 514 states and 633 transitions. [2024-12-05 23:47:16,853 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 633 transitions. [2024-12-05 23:47:16,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-12-05 23:47:16,855 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:16,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:16,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:17,206 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:47:18,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:18,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 583 states and 718 transitions. [2024-12-05 23:47:18,449 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 718 transitions. [2024-12-05 23:47:18,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-12-05 23:47:18,450 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:18,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:18,634 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:47:19,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:19,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 602 states and 739 transitions. [2024-12-05 23:47:19,399 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 739 transitions. [2024-12-05 23:47:19,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-12-05 23:47:19,400 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:19,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:19,531 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:47:19,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:19,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 604 states and 740 transitions. [2024-12-05 23:47:19,717 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 740 transitions. [2024-12-05 23:47:19,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-05 23:47:19,718 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:19,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:19,806 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-05 23:47:19,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:19,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 606 states and 743 transitions. [2024-12-05 23:47:19,969 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 743 transitions. [2024-12-05 23:47:19,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-12-05 23:47:19,970 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:19,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:20,104 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-05 23:47:20,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:20,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 631 states and 770 transitions. [2024-12-05 23:47:20,998 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 770 transitions. [2024-12-05 23:47:20,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-12-05 23:47:20,999 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:20,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:21,104 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-12-05 23:47:21,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:21,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 656 states and 795 transitions. [2024-12-05 23:47:21,352 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 795 transitions. [2024-12-05 23:47:21,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-12-05 23:47:21,353 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:21,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:21,471 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 23:47:21,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:21,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 658 states and 796 transitions. [2024-12-05 23:47:21,735 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 796 transitions. [2024-12-05 23:47:21,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-12-05 23:47:21,736 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:21,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:21,853 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 23:47:22,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:22,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 705 states and 857 transitions. [2024-12-05 23:47:22,667 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 857 transitions. [2024-12-05 23:47:22,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-12-05 23:47:22,668 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:22,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:22,792 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 23:47:23,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:23,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 720 states and 876 transitions. [2024-12-05 23:47:23,336 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 876 transitions. [2024-12-05 23:47:23,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-12-05 23:47:23,337 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:23,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:23,700 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:47:26,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:26,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 804 states and 972 transitions. [2024-12-05 23:47:26,129 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 972 transitions. [2024-12-05 23:47:26,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-12-05 23:47:26,129 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:26,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:26,461 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:47:27,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:27,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 855 states and 1037 transitions. [2024-12-05 23:47:27,631 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1037 transitions. [2024-12-05 23:47:27,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-12-05 23:47:27,632 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:27,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:27,918 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:47:28,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:28,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 856 states and 1038 transitions. [2024-12-05 23:47:28,109 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1038 transitions. [2024-12-05 23:47:28,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-12-05 23:47:28,109 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:28,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:28,457 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 156 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 23:47:29,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:29,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 918 states and 1111 transitions. [2024-12-05 23:47:29,747 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1111 transitions. [2024-12-05 23:47:29,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-12-05 23:47:29,747 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:29,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 156 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 23:47:30,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:30,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 920 states and 1112 transitions. [2024-12-05 23:47:30,244 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1112 transitions. [2024-12-05 23:47:30,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-05 23:47:30,245 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:30,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:30,732 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:47:32,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:32,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1013 states and 1225 transitions. [2024-12-05 23:47:32,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1225 transitions. [2024-12-05 23:47:32,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-05 23:47:32,732 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:32,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:32,983 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:47:33,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:33,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1017 states and 1230 transitions. [2024-12-05 23:47:33,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1230 transitions. [2024-12-05 23:47:33,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-05 23:47:33,519 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:33,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:33,766 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-05 23:47:34,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:34,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1052 states and 1271 transitions. [2024-12-05 23:47:34,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1271 transitions. [2024-12-05 23:47:34,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-12-05 23:47:34,992 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:34,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:35,250 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 120 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-05 23:47:35,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:35,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1067 states and 1290 transitions. [2024-12-05 23:47:35,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1290 transitions. [2024-12-05 23:47:35,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-12-05 23:47:35,651 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:35,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:35,792 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 67 proven. 122 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 23:47:37,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:37,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1159 states and 1386 transitions. [2024-12-05 23:47:37,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1386 transitions. [2024-12-05 23:47:37,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-05 23:47:37,545 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:37,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:37,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:37,852 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:47:39,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:39,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1201 states and 1434 transitions. [2024-12-05 23:47:39,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1434 transitions. [2024-12-05 23:47:39,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-05 23:47:39,207 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:39,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:39,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:39,426 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:47:40,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:40,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1235 states and 1473 transitions. [2024-12-05 23:47:40,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1473 transitions. [2024-12-05 23:47:40,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-05 23:47:40,315 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:40,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:40,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:40,650 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-05 23:47:41,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:41,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1279 states and 1530 transitions. [2024-12-05 23:47:41,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1530 transitions. [2024-12-05 23:47:41,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-05 23:47:41,227 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:41,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:41,484 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-05 23:47:42,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:42,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1295 states and 1546 transitions. [2024-12-05 23:47:42,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1546 transitions. [2024-12-05 23:47:42,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-12-05 23:47:42,006 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:42,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:42,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:42,120 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-05 23:47:43,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:43,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1333 states and 1589 transitions. [2024-12-05 23:47:43,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1589 transitions. [2024-12-05 23:47:43,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-05 23:47:43,144 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:43,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:43,327 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 136 proven. 65 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-05 23:47:44,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:44,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1368 states and 1626 transitions. [2024-12-05 23:47:44,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 1626 transitions. [2024-12-05 23:47:44,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-05 23:47:44,027 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:44,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:44,451 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-05 23:47:45,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:45,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1389 states and 1654 transitions. [2024-12-05 23:47:45,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1654 transitions. [2024-12-05 23:47:45,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-05 23:47:45,469 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:45,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:45,756 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-05 23:47:47,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:47,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1423 states and 1690 transitions. [2024-12-05 23:47:47,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1690 transitions. [2024-12-05 23:47:47,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-12-05 23:47:47,326 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:47,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:47,628 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:47:49,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:49,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1448 states and 1720 transitions. [2024-12-05 23:47:49,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 1720 transitions. [2024-12-05 23:47:49,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-12-05 23:47:49,173 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:49,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:49,421 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:47:50,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:50,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1464 states and 1736 transitions. [2024-12-05 23:47:50,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 1736 transitions. [2024-12-05 23:47:50,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-05 23:47:50,264 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:50,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:50,684 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-05 23:47:52,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:52,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1509 states and 1797 transitions. [2024-12-05 23:47:52,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1797 transitions. [2024-12-05 23:47:52,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-05 23:47:52,540 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:52,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:52,786 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-05 23:47:53,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:53,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1520 states and 1806 transitions. [2024-12-05 23:47:53,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 1806 transitions. [2024-12-05 23:47:53,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-05 23:47:53,549 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:53,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:53,850 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-05 23:47:54,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:54,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1522 states and 1811 transitions. [2024-12-05 23:47:54,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 1811 transitions. [2024-12-05 23:47:54,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-05 23:47:54,148 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:54,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:54,414 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-05 23:47:55,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:55,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1825 states to 1537 states and 1825 transitions. [2024-12-05 23:47:55,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 1825 transitions. [2024-12-05 23:47:55,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-05 23:47:55,233 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:55,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:55,473 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 140 proven. 71 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-12-05 23:47:55,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:55,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1540 states and 1828 transitions. [2024-12-05 23:47:55,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 1828 transitions. [2024-12-05 23:47:55,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-12-05 23:47:55,628 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:55,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:56,261 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 119 proven. 137 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 23:47:59,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:59,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1674 states and 1976 transitions. [2024-12-05 23:47:59,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 1976 transitions. [2024-12-05 23:47:59,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-05 23:47:59,230 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:59,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:59,467 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 58 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-05 23:48:00,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:00,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 1699 states and 2002 transitions. [2024-12-05 23:48:00,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2002 transitions. [2024-12-05 23:48:00,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-05 23:48:00,224 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:00,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:00,494 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:48:00,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:00,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 1712 states and 2017 transitions. [2024-12-05 23:48:00,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2017 transitions. [2024-12-05 23:48:01,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-05 23:48:01,000 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:01,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:01,294 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:48:01,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:01,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2021 states to 1715 states and 2021 transitions. [2024-12-05 23:48:01,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2021 transitions. [2024-12-05 23:48:01,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-12-05 23:48:01,678 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:01,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:02,037 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 86 proven. 141 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-12-05 23:48:04,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:04,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2123 states to 1803 states and 2123 transitions. [2024-12-05 23:48:04,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2123 transitions. [2024-12-05 23:48:04,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-12-05 23:48:04,232 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:04,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:04,688 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 129 proven. 142 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 23:48:05,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:05,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2199 states to 1877 states and 2199 transitions. [2024-12-05 23:48:05,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2199 transitions. [2024-12-05 23:48:05,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-12-05 23:48:05,958 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:05,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:06,318 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 183 proven. 52 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-05 23:48:07,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:07,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2221 states to 1898 states and 2221 transitions. [2024-12-05 23:48:07,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2221 transitions. [2024-12-05 23:48:07,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-12-05 23:48:07,738 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:07,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:07,984 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 185 proven. 54 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-12-05 23:48:08,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:08,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 1900 states and 2223 transitions. [2024-12-05 23:48:08,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 2223 transitions. [2024-12-05 23:48:08,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-12-05 23:48:08,185 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:08,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:08,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:08,464 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 152 proven. 83 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-12-05 23:48:08,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:08,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2240 states to 1915 states and 2240 transitions. [2024-12-05 23:48:08,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 2240 transitions. [2024-12-05 23:48:08,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-12-05 23:48:08,966 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:08,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:08,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:09,224 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 155 proven. 86 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-12-05 23:48:10,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:10,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2285 states to 1952 states and 2285 transitions. [2024-12-05 23:48:10,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2285 transitions. [2024-12-05 23:48:10,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-12-05 23:48:10,468 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:10,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:11,329 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 174 proven. 28 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-05 23:48:12,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:12,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2298 states to 1963 states and 2298 transitions. [2024-12-05 23:48:12,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 2298 transitions. [2024-12-05 23:48:12,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-12-05 23:48:12,249 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:12,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:12,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:12,540 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 159 proven. 90 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-05 23:48:14,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:14,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2337 states to 1995 states and 2337 transitions. [2024-12-05 23:48:14,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2337 transitions. [2024-12-05 23:48:14,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-12-05 23:48:14,207 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:14,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:14,675 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 186 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-05 23:48:16,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:16,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 2012 states and 2356 transitions. [2024-12-05 23:48:16,499 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 2356 transitions. [2024-12-05 23:48:16,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-05 23:48:16,501 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:16,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:16,789 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 166 proven. 97 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-12-05 23:48:17,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:17,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2026 states and 2371 transitions. [2024-12-05 23:48:17,421 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 2371 transitions. [2024-12-05 23:48:17,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-05 23:48:17,423 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:17,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:17,683 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-12-05 23:48:18,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:18,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2419 states to 2067 states and 2419 transitions. [2024-12-05 23:48:18,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 2419 transitions. [2024-12-05 23:48:18,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-12-05 23:48:18,813 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:18,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:19,264 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 199 proven. 49 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-05 23:48:21,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:21,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2106 states and 2473 transitions. [2024-12-05 23:48:21,827 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 2473 transitions. [2024-12-05 23:48:21,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-05 23:48:21,828 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:21,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:21,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:22,101 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 169 proven. 100 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-12-05 23:48:22,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:22,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2120 states and 2488 transitions. [2024-12-05 23:48:22,630 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 2488 transitions. [2024-12-05 23:48:22,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-12-05 23:48:22,631 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:22,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:22,803 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-12-05 23:48:23,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:23,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2501 states to 2132 states and 2501 transitions. [2024-12-05 23:48:23,934 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2501 transitions. [2024-12-05 23:48:23,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-12-05 23:48:23,936 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:23,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:24,077 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-12-05 23:48:24,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:24,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2134 states and 2506 transitions. [2024-12-05 23:48:24,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2134 states and 2506 transitions. [2024-12-05 23:48:24,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-05 23:48:24,494 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:24,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:24,800 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-12-05 23:48:25,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:25,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2519 states to 2146 states and 2519 transitions. [2024-12-05 23:48:25,348 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 2519 transitions. [2024-12-05 23:48:25,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-05 23:48:25,349 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:25,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:25,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:25,708 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-05 23:48:30,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:30,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2615 states to 2223 states and 2615 transitions. [2024-12-05 23:48:30,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 2615 transitions. [2024-12-05 23:48:30,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-05 23:48:30,681 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:30,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:30,876 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-05 23:48:32,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:32,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2240 states and 2633 transitions. [2024-12-05 23:48:32,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2240 states and 2633 transitions. [2024-12-05 23:48:32,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-05 23:48:32,333 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:32,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:32,603 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-12-05 23:48:33,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:33,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2243 states and 2636 transitions. [2024-12-05 23:48:33,172 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 2636 transitions. [2024-12-05 23:48:33,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-12-05 23:48:33,173 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:33,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:33,524 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 179 proven. 104 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-05 23:48:33,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:33,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2252 states and 2645 transitions. [2024-12-05 23:48:33,690 INFO L276 IsEmpty]: Start isEmpty. Operand 2252 states and 2645 transitions. [2024-12-05 23:48:33,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-12-05 23:48:33,692 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:33,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:33,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:33,967 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 173 proven. 104 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-12-05 23:48:34,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:34,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2671 states to 2276 states and 2671 transitions. [2024-12-05 23:48:34,581 INFO L276 IsEmpty]: Start isEmpty. Operand 2276 states and 2671 transitions. [2024-12-05 23:48:34,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-05 23:48:34,582 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:34,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:34,999 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-05 23:48:37,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:37,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2730 states to 2321 states and 2730 transitions. [2024-12-05 23:48:37,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 2730 transitions. [2024-12-05 23:48:37,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-05 23:48:37,747 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:37,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:38,000 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-05 23:48:38,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:38,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2734 states to 2325 states and 2734 transitions. [2024-12-05 23:48:38,593 INFO L276 IsEmpty]: Start isEmpty. Operand 2325 states and 2734 transitions. [2024-12-05 23:48:38,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-05 23:48:38,594 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:38,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:38,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:38,835 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-05 23:48:41,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:41,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2755 states to 2340 states and 2755 transitions. [2024-12-05 23:48:41,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2340 states and 2755 transitions. [2024-12-05 23:48:41,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-05 23:48:41,271 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:41,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:41,509 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-05 23:48:42,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:42,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2764 states to 2345 states and 2764 transitions. [2024-12-05 23:48:42,568 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 2764 transitions. [2024-12-05 23:48:42,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-12-05 23:48:42,569 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:42,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:42,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:42,842 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 175 proven. 106 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-12-05 23:48:43,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:43,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2770 states to 2348 states and 2770 transitions. [2024-12-05 23:48:43,481 INFO L276 IsEmpty]: Start isEmpty. Operand 2348 states and 2770 transitions. [2024-12-05 23:48:43,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-05 23:48:43,482 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:43,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:43,733 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 228 proven. 38 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-05 23:48:45,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:45,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2783 states to 2359 states and 2783 transitions. [2024-12-05 23:48:45,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2359 states and 2783 transitions. [2024-12-05 23:48:45,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-05 23:48:45,032 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:45,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:45,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:45,756 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:48:50,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:50,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2850 states to 2418 states and 2850 transitions. [2024-12-05 23:48:50,724 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 2850 transitions. [2024-12-05 23:48:50,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-05 23:48:50,725 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:50,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:50,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:51,039 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:48:53,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:53,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2872 states to 2437 states and 2872 transitions. [2024-12-05 23:48:53,385 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 2872 transitions. [2024-12-05 23:48:53,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-05 23:48:53,387 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:53,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:53,775 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:48:55,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:55,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2887 states to 2453 states and 2887 transitions. [2024-12-05 23:48:55,317 INFO L276 IsEmpty]: Start isEmpty. Operand 2453 states and 2887 transitions. [2024-12-05 23:48:55,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-05 23:48:55,318 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:55,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:55,636 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:48:57,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:57,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2918 states to 2483 states and 2918 transitions. [2024-12-05 23:48:57,984 INFO L276 IsEmpty]: Start isEmpty. Operand 2483 states and 2918 transitions. [2024-12-05 23:48:57,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-05 23:48:57,985 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:57,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:58,104 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-12-05 23:48:59,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:59,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2925 states to 2486 states and 2925 transitions. [2024-12-05 23:48:59,250 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 2925 transitions. [2024-12-05 23:48:59,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-05 23:48:59,252 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:59,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:59,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:59,372 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-12-05 23:48:59,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:59,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2487 states and 2928 transitions. [2024-12-05 23:48:59,738 INFO L276 IsEmpty]: Start isEmpty. Operand 2487 states and 2928 transitions. [2024-12-05 23:48:59,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-05 23:48:59,740 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:59,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:59,928 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-12-05 23:49:00,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:49:00,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2488 states and 2928 transitions. [2024-12-05 23:49:00,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2488 states and 2928 transitions. [2024-12-05 23:49:00,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-12-05 23:49:00,493 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:49:00,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:49:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:49:00,779 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 186 proven. 111 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-05 23:49:00,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:49:00,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2935 states to 2495 states and 2935 transitions. [2024-12-05 23:49:00,938 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 2935 transitions. [2024-12-05 23:49:00,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-12-05 23:49:00,939 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:49:00,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:49:00,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:49:01,434 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 224 proven. 65 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-12-05 23:49:03,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:49:03,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2966 states to 2518 states and 2966 transitions. [2024-12-05 23:49:03,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 2966 transitions. [2024-12-05 23:49:03,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-12-05 23:49:03,620 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:49:03,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:49:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:49:03,910 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 185 proven. 152 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-05 23:49:06,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:49:06,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2549 states and 2999 transitions. [2024-12-05 23:49:06,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2549 states and 2999 transitions. [2024-12-05 23:49:06,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-05 23:49:06,669 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:49:06,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:49:06,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:49:06,957 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 189 proven. 114 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-05 23:49:07,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:49:07,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3003 states to 2552 states and 3003 transitions. [2024-12-05 23:49:07,114 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 3003 transitions. [2024-12-05 23:49:07,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-05 23:49:07,115 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:49:07,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:49:07,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:49:07,444 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-12-05 23:49:08,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:49:08,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 2564 states and 3018 transitions. [2024-12-05 23:49:08,910 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 3018 transitions. [2024-12-05 23:49:08,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-05 23:49:08,912 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:49:08,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:49:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:49:09,342 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 125 proven. 170 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-12-05 23:49:14,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:49:14,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3170 states to 2689 states and 3170 transitions. [2024-12-05 23:49:14,970 INFO L276 IsEmpty]: Start isEmpty. Operand 2689 states and 3170 transitions. [2024-12-05 23:49:14,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-05 23:49:14,971 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:49:14,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:49:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:49:15,607 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 23:49:17,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:49:17,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3239 states to 2750 states and 3239 transitions. [2024-12-05 23:49:17,956 INFO L276 IsEmpty]: Start isEmpty. Operand 2750 states and 3239 transitions. [2024-12-05 23:49:17,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-05 23:49:17,957 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:49:17,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:49:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:49:18,269 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 23:49:18,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:49:18,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3245 states to 2755 states and 3245 transitions. [2024-12-05 23:49:18,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2755 states and 3245 transitions. [2024-12-05 23:49:18,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-12-05 23:49:18,635 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:49:18,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:49:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:49:18,782 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 134 proven. 180 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-12-05 23:49:18,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:49:18,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3245 states to 2756 states and 3245 transitions. [2024-12-05 23:49:18,884 INFO L276 IsEmpty]: Start isEmpty. Operand 2756 states and 3245 transitions. [2024-12-05 23:49:18,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-12-05 23:49:18,885 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:49:18,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:49:18,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:49:19,431 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 279 proven. 206 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-12-05 23:49:22,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:49:22,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3293 states to 2808 states and 3293 transitions. [2024-12-05 23:49:22,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2808 states and 3293 transitions. [2024-12-05 23:49:22,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-05 23:49:22,093 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 98 iterations. [2024-12-05 23:49:22,100 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-12-05 23:49:55,102 INFO L77 FloydHoareUtils]: At program point L102(lines 102 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-12-05 23:49:55,103 INFO L77 FloydHoareUtils]: At program point L598(line 598) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,103 INFO L77 FloydHoareUtils]: At program point L334(lines 334 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,103 INFO L77 FloydHoareUtils]: At program point L302(lines 302 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,103 INFO L77 FloydHoareUtils]: At program point L170(lines 170 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,103 INFO L77 FloydHoareUtils]: At program point L204(lines 204 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,104 INFO L77 FloydHoareUtils]: At program point L72(lines 72 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse1 (not .cse8)) (.cse2 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse5 (= ~a16~0 4)) (.cse3 (not .cse7)) (.cse0 (not (= ~a7~0 1)))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse8 .cse4) (and .cse0 (not (and .cse2 (= ~a16~0 6) .cse4))) (and .cse2 .cse9 .cse6 .cse3) (and .cse2 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse1 .cse0) (and .cse1 .cse2 .cse9 .cse3 .cse5) (and .cse3 .cse0)))) [2024-12-05 23:49:55,104 INFO L77 FloydHoareUtils]: At program point L271(lines 271 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,104 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse8 (= 5 ~a16~0)) (.cse2 (not .cse10)) (.cse11 (= 14 ~a8~0)) (.cse4 (not .cse9)) (.cse7 (= ~a16~0 4)) (.cse3 (= ~a12~0 8)) (.cse0 (not .cse5)) (.cse6 (= ~a8~0 15))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (not (= ~a21~0 1)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 .cse8 .cse9 .cse10 .cse6) (and .cse3 .cse11 .cse8 .cse4) (and .cse3 (= ~a8~0 13) .cse9 .cse10 .cse7) (and .cse2 .cse3 .cse8 .cse4 .cse6) (and .cse0 (not .cse7)) (and .cse2 .cse3 .cse11 .cse4 .cse7) (and .cse0 (not .cse3)) (and .cse0 (not (and .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))))))) [2024-12-05 23:49:55,104 INFO L77 FloydHoareUtils]: At program point L371(lines 371 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,105 INFO L77 FloydHoareUtils]: At program point L107(lines 107 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-12-05 23:49:55,105 INFO L77 FloydHoareUtils]: At program point L41(lines 41 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,105 INFO L77 FloydHoareUtils]: At program point L339(lines 339 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,105 INFO L77 FloydHoareUtils]: At program point L207(lines 207 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,105 INFO L77 FloydHoareUtils]: At program point L75(lines 75 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse1 (not .cse8)) (.cse2 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse5 (= ~a16~0 4)) (.cse3 (not .cse7)) (.cse0 (not (= ~a7~0 1)))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse8 .cse4) (and .cse0 (not (and .cse2 (= ~a16~0 6) .cse4))) (and .cse2 .cse9 .cse6 .cse3) (and .cse2 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse1 .cse0) (and .cse1 .cse2 .cse9 .cse3 .cse5) (and .cse3 .cse0)))) [2024-12-05 23:49:55,105 INFO L77 FloydHoareUtils]: At program point L373(lines 373 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,106 INFO L77 FloydHoareUtils]: At program point L241(lines 241 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,106 INFO L77 FloydHoareUtils]: At program point L175(lines 175 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,106 INFO L77 FloydHoareUtils]: At program point L506-1(lines 40 585) the Hoare annotation is: (not (and (= ~a21~0 1) (= ~a7~0 1))) [2024-12-05 23:49:55,106 INFO L77 FloydHoareUtils]: At program point L275(lines 275 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,106 INFO L77 FloydHoareUtils]: At program point L375(lines 375 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,107 INFO L77 FloydHoareUtils]: At program point L309(lines 309 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,107 INFO L77 FloydHoareUtils]: At program point L45(lines 45 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,107 INFO L77 FloydHoareUtils]: At program point L343(lines 343 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,107 INFO L77 FloydHoareUtils]: At program point L112(lines 112 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-12-05 23:49:55,107 INFO L77 FloydHoareUtils]: At program point L509-1(lines 40 585) the Hoare annotation is: (not (and (= ~a21~0 1) (= ~a7~0 1))) [2024-12-05 23:49:55,107 INFO L77 FloydHoareUtils]: At program point L278(lines 278 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,108 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse8 (= 5 ~a16~0)) (.cse2 (not .cse10)) (.cse11 (= 14 ~a8~0)) (.cse4 (not .cse9)) (.cse7 (= ~a16~0 4)) (.cse3 (= ~a12~0 8)) (.cse0 (not .cse5)) (.cse6 (= ~a8~0 15))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (not (= ~a21~0 1)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 .cse8 .cse9 .cse10 .cse6) (and .cse3 .cse11 .cse8 .cse4) (and .cse3 (= ~a8~0 13) .cse9 .cse10 .cse7) (and .cse2 .cse3 .cse8 .cse4 .cse6) (and .cse0 (not .cse7)) (and .cse2 .cse3 .cse11 .cse4 .cse7) (and .cse0 (not .cse3)) (and .cse0 (not (and .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))))))) [2024-12-05 23:49:55,108 INFO L75 FloydHoareUtils]: For program point L510(line 510) no Hoare annotation was computed. [2024-12-05 23:49:55,108 INFO L77 FloydHoareUtils]: At program point L213(lines 213 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,108 INFO L77 FloydHoareUtils]: At program point L82(lines 82 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse1 (not .cse8)) (.cse2 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse5 (= ~a16~0 4)) (.cse3 (not .cse7)) (.cse0 (not (= ~a7~0 1)))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse8 .cse4) (and .cse0 (not (and .cse2 (= ~a16~0 6) .cse4))) (and .cse2 .cse9 .cse6 .cse3) (and .cse2 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse1 .cse0) (and .cse1 .cse2 .cse9 .cse3 .cse5) (and .cse3 .cse0)))) [2024-12-05 23:49:55,108 INFO L77 FloydHoareUtils]: At program point L347(lines 347 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,108 INFO L77 FloydHoareUtils]: At program point L248(lines 248 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,108 INFO L77 FloydHoareUtils]: At program point L183(lines 183 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,109 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse8 (= 5 ~a16~0)) (.cse2 (not .cse10)) (.cse11 (= 14 ~a8~0)) (.cse4 (not .cse9)) (.cse7 (= ~a16~0 4)) (.cse3 (= ~a12~0 8)) (.cse0 (not .cse5)) (.cse6 (= ~a8~0 15))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (not (= ~a21~0 1)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 .cse8 .cse9 .cse10 .cse6) (and .cse3 .cse11 .cse8 .cse4) (and .cse3 (= ~a8~0 13) .cse9 .cse10 .cse7) (and .cse2 .cse3 .cse8 .cse4 .cse6) (and .cse0 (not .cse7)) (and .cse2 .cse3 .cse11 .cse4 .cse7) (and .cse0 (not .cse3)) (and .cse0 (not (and .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))))))) [2024-12-05 23:49:55,109 INFO L77 FloydHoareUtils]: At program point L382(lines 382 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,109 INFO L77 FloydHoareUtils]: At program point L316(lines 316 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,109 INFO L77 FloydHoareUtils]: At program point L283(lines 283 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,109 INFO L77 FloydHoareUtils]: At program point L118(lines 118 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-12-05 23:49:55,109 INFO L77 FloydHoareUtils]: At program point L218(lines 218 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,110 INFO L77 FloydHoareUtils]: At program point L53(lines 53 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,110 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse8 (= 5 ~a16~0)) (.cse2 (not .cse10)) (.cse11 (= 14 ~a8~0)) (.cse4 (not .cse9)) (.cse7 (= ~a16~0 4)) (.cse3 (= ~a12~0 8)) (.cse0 (not .cse5)) (.cse6 (= ~a8~0 15))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (not (= ~a21~0 1)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 .cse8 .cse9 .cse10 .cse6) (and .cse3 .cse11 .cse8 .cse4) (and .cse3 (= ~a8~0 13) .cse9 .cse10 .cse7) (and .cse2 .cse3 .cse8 .cse4 .cse6) (and .cse0 (not .cse7)) (and .cse2 .cse3 .cse11 .cse4 .cse7) (and .cse0 (not .cse3)) (and .cse0 (not (and .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))))))) [2024-12-05 23:49:55,110 INFO L77 FloydHoareUtils]: At program point L188(lines 188 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,110 INFO L77 FloydHoareUtils]: At program point L387(lines 387 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,110 INFO L77 FloydHoareUtils]: At program point L288(lines 288 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,110 INFO L77 FloydHoareUtils]: At program point L255(lines 255 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,110 INFO L77 FloydHoareUtils]: At program point L90(lines 90 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse1 (not .cse8)) (.cse2 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse5 (= ~a16~0 4)) (.cse3 (not .cse7)) (.cse0 (not (= ~a7~0 1)))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse8 .cse4) (and .cse0 (not (and .cse2 (= ~a16~0 6) .cse4))) (and .cse2 .cse9 .cse6 .cse3) (and .cse2 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse1 .cse0) (and .cse1 .cse2 .cse9 .cse3 .cse5) (and .cse3 .cse0)))) [2024-12-05 23:49:55,111 INFO L77 FloydHoareUtils]: At program point L355(lines 355 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,111 INFO L77 FloydHoareUtils]: At program point L322(lines 322 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,111 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-05 23:49:55,111 INFO L77 FloydHoareUtils]: At program point L124(lines 124 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-12-05 23:49:55,111 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-12-05 23:49:55,111 INFO L77 FloydHoareUtils]: At program point L224(lines 224 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,111 INFO L77 FloydHoareUtils]: At program point L158(lines 158 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,112 INFO L77 FloydHoareUtils]: At program point L59(lines 59 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,112 INFO L77 FloydHoareUtils]: At program point L94(lines 94 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-12-05 23:49:55,112 INFO L77 FloydHoareUtils]: At program point L392(lines 392 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,112 INFO L77 FloydHoareUtils]: At program point L326(lines 326 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,112 INFO L77 FloydHoareUtils]: At program point L260(lines 260 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,112 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-05 23:49:55,113 INFO L77 FloydHoareUtils]: At program point L228(lines 228 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,113 INFO L77 FloydHoareUtils]: At program point L162(lines 162 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,113 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-12-05 23:49:55,113 INFO L77 FloydHoareUtils]: At program point L328(lines 328 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,113 INFO L77 FloydHoareUtils]: At program point L196(lines 196 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,113 INFO L77 FloydHoareUtils]: At program point L64(lines 64 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse1 (not .cse8)) (.cse2 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse5 (= ~a16~0 4)) (.cse3 (not .cse7)) (.cse0 (not (= ~a7~0 1)))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse8 .cse4) (and .cse0 (not (and .cse2 (= ~a16~0 6) .cse4))) (and .cse2 .cse9 .cse6 .cse3) (and .cse2 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse1 .cse0) (and .cse1 .cse2 .cse9 .cse3 .cse5) (and .cse3 .cse0)))) [2024-12-05 23:49:55,114 INFO L77 FloydHoareUtils]: At program point L593-2(lines 593 603) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,114 INFO L77 FloydHoareUtils]: At program point L296(lines 296 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,114 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 40 585) the Hoare annotation is: (not (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse6 (= 14 ~a8~0)) (.cse5 (= 5 ~a16~0)) (.cse2 (not .cse7)) (.cse1 (= ~a12~0 8)) (.cse4 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse0 .cse1 .cse5 .cse2 .cse3)) (not (and .cse0 .cse1 .cse6 .cse2 .cse4)) (not (and .cse1 .cse6 .cse5 .cse2)) (= ~a21~0 1) (not (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4)) (= ~a7~0 1))))) [2024-12-05 23:49:55,114 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 510) no Hoare annotation was computed. [2024-12-05 23:49:55,114 INFO L77 FloydHoareUtils]: At program point L363(lines 363 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,115 INFO L77 FloydHoareUtils]: At program point L199(lines 199 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,115 INFO L77 FloydHoareUtils]: At program point L365(lines 365 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,115 INFO L77 FloydHoareUtils]: At program point L266(lines 266 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,115 INFO L77 FloydHoareUtils]: At program point L233(lines 233 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-05 23:49:55,115 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-12-05 23:49:55,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 05.12 11:49:55 ImpRootNode [2024-12-05 23:49:55,130 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-05 23:49:55,130 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-05 23:49:55,130 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-05 23:49:55,130 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-05 23:49:55,131 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:47:05" (3/4) ... [2024-12-05 23:49:55,133 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-05 23:49:55,146 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 119 nodes and edges [2024-12-05 23:49:55,147 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-12-05 23:49:55,147 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-12-05 23:49:55,148 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-12-05 23:49:55,263 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c47d470-01f9-4b53-b970-9df3cb5939c1/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-05 23:49:55,263 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c47d470-01f9-4b53-b970-9df3cb5939c1/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-05 23:49:55,264 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-05 23:49:55,264 INFO L158 Benchmark]: Toolchain (without parser) took 171494.16ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 114.0MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 552.5MB. Max. memory is 16.1GB. [2024-12-05 23:49:55,265 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 142.6MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-05 23:49:55,265 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.60ms. Allocated memory is still 142.6MB. Free memory was 114.0MB in the beginning and 87.2MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-05 23:49:55,265 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.14ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 81.8MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-05 23:49:55,265 INFO L158 Benchmark]: Boogie Preprocessor took 53.39ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 77.7MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-05 23:49:55,266 INFO L158 Benchmark]: RCFGBuilder took 1140.51ms. Allocated memory is still 142.6MB. Free memory was 77.7MB in the beginning and 64.3MB in the end (delta: 13.4MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. [2024-12-05 23:49:55,266 INFO L158 Benchmark]: CodeCheck took 169730.48ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 64.3MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 493.2MB. Max. memory is 16.1GB. [2024-12-05 23:49:55,266 INFO L158 Benchmark]: Witness Printer took 133.52ms. Allocated memory is still 1.7GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-05 23:49:55,268 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, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 136.7s, OverallIterations: 98, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 301465 SdHoareTripleChecker+Valid, 663.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 300599 mSDsluCounter, 40653 SdHoareTripleChecker+Invalid, 569.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 34510 mSDsCounter, 64236 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 652467 IncrementalHoareTripleChecker+Invalid, 716703 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64236 mSolverCounterUnsat, 6143 mSDtfsCounter, 652467 mSolverCounterSat, 4.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 132993 GetRequests, 124824 SyntacticMatches, 7181 SemanticMatches, 988 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682575 ImplicationChecksByTransitivity, 93.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.5s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 24.8s InterpolantComputationTime, 19693 NumberOfCodeBlocks, 19693 NumberOfCodeBlocksAsserted, 97 NumberOfCheckSat, 19596 ConstructedInterpolants, 0 QuantifiedInterpolants, 162169 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 97 InterpolantComputations, 22 PerfectInterpolantSequences, 17668/22996 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: 510]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Location Invariant Derived location invariant: !((((((!(((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a8 == 15)) && (a16 == 4)) && !(((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a8 == 15))) && !(((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a16 == 4))) && !((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1))) && (a21 == 1)) && !(((((a12 == 8) && (a8 == 13)) && (a17 == 1)) && (a20 == 1)) && (a16 == 4))) && (a7 == 1)) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: !(((((((!(((((a12 == 8) && (5 == a16)) && (a17 == 1)) && (a20 == 1)) && (a8 == 15)) && !(((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a8 == 15)) && (a16 == 4))) && !(((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a8 == 15))) && !(((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a16 == 4))) && !((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1))) && (a21 == 1)) && !(((((a12 == 8) && (a8 == 13)) && (a17 == 1)) && (a20 == 1)) && (a16 == 4))) && (a7 == 1)) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 142.6MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 373.60ms. Allocated memory is still 142.6MB. Free memory was 114.0MB in the beginning and 87.2MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.14ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 81.8MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.39ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 77.7MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1140.51ms. Allocated memory is still 142.6MB. Free memory was 77.7MB in the beginning and 64.3MB in the end (delta: 13.4MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. * CodeCheck took 169730.48ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 64.3MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 493.2MB. Max. memory is 16.1GB. * Witness Printer took 133.52ms. Allocated memory is still 1.7GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-12-05 23:49:55,285 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c47d470-01f9-4b53-b970-9df3cb5939c1/bin/ukojak-verify-CZk0znPC7b/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