./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label25.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa03bfd-df8f-4baa-bd55-d2f0616b7f07/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa03bfd-df8f-4baa-bd55-d2f0616b7f07/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa03bfd-df8f-4baa-bd55-d2f0616b7f07/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa03bfd-df8f-4baa-bd55-d2f0616b7f07/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label25.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa03bfd-df8f-4baa-bd55-d2f0616b7f07/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa03bfd-df8f-4baa-bd55-d2f0616b7f07/bin/ukojak-verify-ImItNfHLgk --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 9eecaebfc7fdff6c78546d77961205ec398f6828a79f10a4e7e47a08f024b3d8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 19:27:51,475 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:27:51,568 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa03bfd-df8f-4baa-bd55-d2f0616b7f07/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-08 19:27:51,578 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:27:51,579 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 19:27:51,613 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:27:51,616 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:27:51,617 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 19:27:51,617 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:27:51,619 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:27:51,620 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:27:51,620 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:27:51,620 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:27:51,621 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:27:51,621 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:27:51,621 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:27:51,624 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:27:51,625 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:27:51,625 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:27:51,625 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:27:51,625 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:27:51,629 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:27:51,629 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:27:51,630 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 19:27:51,630 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 19:27:51,630 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 19:27:51,630 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:27:51,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 19:27:51,631 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:27:51,631 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:27:51,631 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:27:51,631 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 19:27:51,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:27:51,632 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa03bfd-df8f-4baa-bd55-d2f0616b7f07/bin/ukojak-verify-ImItNfHLgk/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa03bfd-df8f-4baa-bd55-d2f0616b7f07/bin/ukojak-verify-ImItNfHLgk Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 9eecaebfc7fdff6c78546d77961205ec398f6828a79f10a4e7e47a08f024b3d8 [2024-11-08 19:27:51,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:27:51,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:27:51,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:27:51,949 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:27:51,950 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:27:51,951 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa03bfd-df8f-4baa-bd55-d2f0616b7f07/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/eca-rers2012/Problem01_label25.c Unable to find full path for "g++" [2024-11-08 19:27:54,051 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:27:54,447 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:27:54,447 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa03bfd-df8f-4baa-bd55-d2f0616b7f07/sv-benchmarks/c/eca-rers2012/Problem01_label25.c [2024-11-08 19:27:54,468 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa03bfd-df8f-4baa-bd55-d2f0616b7f07/bin/ukojak-verify-ImItNfHLgk/data/930f3bdd9/22cef955b09a43708f1e6d68050b706d/FLAGb28f4cb12 [2024-11-08 19:27:54,487 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa03bfd-df8f-4baa-bd55-d2f0616b7f07/bin/ukojak-verify-ImItNfHLgk/data/930f3bdd9/22cef955b09a43708f1e6d68050b706d [2024-11-08 19:27:54,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:27:54,493 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:27:54,494 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:27:54,494 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:27:54,499 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:27:54,500 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:27:54" (1/1) ... [2024-11-08 19:27:54,502 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49d7f41c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:27:54, skipping insertion in model container [2024-11-08 19:27:54,502 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:27:54" (1/1) ... [2024-11-08 19:27:54,556 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:27:55,017 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_daa03bfd-df8f-4baa-bd55-d2f0616b7f07/sv-benchmarks/c/eca-rers2012/Problem01_label25.c[20346,20359] [2024-11-08 19:27:55,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:27:55,074 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:27:55,210 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_daa03bfd-df8f-4baa-bd55-d2f0616b7f07/sv-benchmarks/c/eca-rers2012/Problem01_label25.c[20346,20359] [2024-11-08 19:27:55,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:27:55,253 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:27:55,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:27:55 WrapperNode [2024-11-08 19:27:55,254 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:27:55,257 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:27:55,257 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:27:55,258 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:27:55,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:27:55" (1/1) ... [2024-11-08 19:27:55,288 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:27:55" (1/1) ... [2024-11-08 19:27:55,344 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-08 19:27:55,345 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:27:55,345 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:27:55,346 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:27:55,346 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:27:55,359 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:27:55" (1/1) ... [2024-11-08 19:27:55,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:27:55" (1/1) ... [2024-11-08 19:27:55,370 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:27:55" (1/1) ... [2024-11-08 19:27:55,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:27:55" (1/1) ... [2024-11-08 19:27:55,391 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:27:55" (1/1) ... [2024-11-08 19:27:55,398 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:27:55" (1/1) ... [2024-11-08 19:27:55,402 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:27:55" (1/1) ... [2024-11-08 19:27:55,405 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:27:55" (1/1) ... [2024-11-08 19:27:55,412 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:27:55,413 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:27:55,413 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:27:55,413 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:27:55,414 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:27:55" (1/1) ... [2024-11-08 19:27:55,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 19:27:55,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa03bfd-df8f-4baa-bd55-d2f0616b7f07/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 19:27:55,467 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa03bfd-df8f-4baa-bd55-d2f0616b7f07/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 19:27:55,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa03bfd-df8f-4baa-bd55-d2f0616b7f07/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 19:27:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:27:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 19:27:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:27:55,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:27:55,598 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:27:55,601 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:27:56,783 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-08 19:27:56,783 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:27:57,052 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:27:57,053 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:27:57,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:27:57 BoogieIcfgContainer [2024-11-08 19:27:57,054 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:27:57,055 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 19:27:57,057 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 19:27:57,067 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 19:27:57,067 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:27:57" (1/1) ... [2024-11-08 19:27:57,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:27:57,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:27:57,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-08 19:27:57,147 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-08 19:27:57,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-08 19:27:57,151 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:27:57,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:27:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:27:58,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:27:58,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:27:58,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 145 states and 220 transitions. [2024-11-08 19:27:58,817 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 220 transitions. [2024-11-08 19:27:58,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-08 19:27:58,819 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:27:58,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:27:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:27:59,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:27:59,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:27:59,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 214 states and 297 transitions. [2024-11-08 19:27:59,982 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 297 transitions. [2024-11-08 19:27:59,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-08 19:27:59,985 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:27:59,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:00,469 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:01,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:01,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 283 states and 367 transitions. [2024-11-08 19:28:01,608 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 367 transitions. [2024-11-08 19:28:01,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-08 19:28:01,612 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:01,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:01,931 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:02,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:02,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 297 states and 386 transitions. [2024-11-08 19:28:02,733 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 386 transitions. [2024-11-08 19:28:02,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-08 19:28:02,739 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:02,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:02,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:02,919 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 19:28:03,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:03,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 306 states and 397 transitions. [2024-11-08 19:28:03,182 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 397 transitions. [2024-11-08 19:28:03,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 19:28:03,183 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:03,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:03,457 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 19:28:03,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:03,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 308 states and 399 transitions. [2024-11-08 19:28:03,558 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 399 transitions. [2024-11-08 19:28:03,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-08 19:28:03,559 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:03,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:03,835 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 19:28:04,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:04,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 334 states and 431 transitions. [2024-11-08 19:28:04,964 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 431 transitions. [2024-11-08 19:28:04,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-08 19:28:04,965 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:04,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:05,191 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 19:28:05,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:05,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 351 states and 451 transitions. [2024-11-08 19:28:05,953 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 451 transitions. [2024-11-08 19:28:05,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 19:28:05,954 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:05,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:05,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:06,245 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 19:28:07,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:07,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 380 states and 483 transitions. [2024-11-08 19:28:07,007 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 483 transitions. [2024-11-08 19:28:07,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-08 19:28:07,009 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:07,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:07,378 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 60 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 19:28:08,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:08,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 428 states and 537 transitions. [2024-11-08 19:28:08,737 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 537 transitions. [2024-11-08 19:28:08,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 19:28:08,741 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:08,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:09,092 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-08 19:28:09,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:09,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 431 states and 541 transitions. [2024-11-08 19:28:09,356 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 541 transitions. [2024-11-08 19:28:09,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 19:28:09,357 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:09,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:09,714 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:11,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:11,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 494 states and 612 transitions. [2024-11-08 19:28:11,736 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 612 transitions. [2024-11-08 19:28:11,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 19:28:11,737 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:11,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:11,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:12,012 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:12,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:12,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 496 states and 613 transitions. [2024-11-08 19:28:12,227 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 613 transitions. [2024-11-08 19:28:12,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 19:28:12,229 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:12,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:12,375 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-08 19:28:12,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:12,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 513 states and 633 transitions. [2024-11-08 19:28:12,960 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 633 transitions. [2024-11-08 19:28:12,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 19:28:12,962 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:12,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:13,300 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 19:28:13,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:13,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 514 states and 633 transitions. [2024-11-08 19:28:13,453 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 633 transitions. [2024-11-08 19:28:13,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-08 19:28:13,455 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:13,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:13,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:13,946 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:15,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:15,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 583 states and 718 transitions. [2024-11-08 19:28:15,810 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 718 transitions. [2024-11-08 19:28:15,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 19:28:15,812 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:15,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:16,188 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:17,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:17,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 602 states and 739 transitions. [2024-11-08 19:28:17,403 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 739 transitions. [2024-11-08 19:28:17,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 19:28:17,412 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:17,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:17,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:17,712 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:18,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:18,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 604 states and 740 transitions. [2024-11-08 19:28:18,020 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 740 transitions. [2024-11-08 19:28:18,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 19:28:18,023 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:18,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:18,227 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 19:28:18,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:18,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 606 states and 743 transitions. [2024-11-08 19:28:18,509 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 743 transitions. [2024-11-08 19:28:18,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 19:28:18,511 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:18,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:18,823 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 19:28:20,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:20,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 631 states and 770 transitions. [2024-11-08 19:28:20,011 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 770 transitions. [2024-11-08 19:28:20,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-08 19:28:20,013 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:20,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:20,162 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-08 19:28:20,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:20,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 656 states and 795 transitions. [2024-11-08 19:28:20,497 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 795 transitions. [2024-11-08 19:28:20,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 19:28:20,499 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:20,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:20,727 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 19:28:21,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:21,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 658 states and 796 transitions. [2024-11-08 19:28:21,095 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 796 transitions. [2024-11-08 19:28:21,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-08 19:28:21,096 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:21,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:21,229 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 19:28:22,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:22,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 705 states and 856 transitions. [2024-11-08 19:28:22,459 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 856 transitions. [2024-11-08 19:28:22,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-08 19:28:22,461 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:22,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:22,706 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 19:28:23,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:23,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 720 states and 876 transitions. [2024-11-08 19:28:23,373 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 876 transitions. [2024-11-08 19:28:23,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-08 19:28:23,375 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:23,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:23,953 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:27,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:27,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 804 states and 974 transitions. [2024-11-08 19:28:27,448 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 974 transitions. [2024-11-08 19:28:27,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 19:28:27,450 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:27,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:28,055 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:29,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:29,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 854 states and 1037 transitions. [2024-11-08 19:28:29,768 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1037 transitions. [2024-11-08 19:28:29,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 19:28:29,770 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:29,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:30,172 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:30,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:30,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 856 states and 1040 transitions. [2024-11-08 19:28:30,340 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1040 transitions. [2024-11-08 19:28:30,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-08 19:28:30,342 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:30,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:30,922 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 156 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 19:28:32,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:32,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 918 states and 1113 transitions. [2024-11-08 19:28:32,769 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1113 transitions. [2024-11-08 19:28:32,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-08 19:28:32,771 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:32,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:33,224 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 156 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 19:28:33,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:33,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 920 states and 1114 transitions. [2024-11-08 19:28:33,592 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1114 transitions. [2024-11-08 19:28:33,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 19:28:33,594 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:33,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:34,289 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:37,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:37,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1013 states and 1227 transitions. [2024-11-08 19:28:37,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1227 transitions. [2024-11-08 19:28:37,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 19:28:37,032 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:37,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:37,455 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:38,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:38,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1017 states and 1232 transitions. [2024-11-08 19:28:38,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1232 transitions. [2024-11-08 19:28:38,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 19:28:38,206 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:38,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:38,634 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 19:28:40,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:40,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1052 states and 1273 transitions. [2024-11-08 19:28:40,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1273 transitions. [2024-11-08 19:28:40,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-08 19:28:40,433 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:40,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:40,849 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 120 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-08 19:28:41,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:41,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1067 states and 1292 transitions. [2024-11-08 19:28:41,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1292 transitions. [2024-11-08 19:28:41,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-08 19:28:41,361 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:41,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:41,560 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-08 19:28:44,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:44,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1137 states and 1364 transitions. [2024-11-08 19:28:44,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1364 transitions. [2024-11-08 19:28:44,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-08 19:28:44,074 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:44,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:44,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:44,469 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:46,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:46,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1442 states to 1205 states and 1442 transitions. [2024-11-08 19:28:46,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1442 transitions. [2024-11-08 19:28:46,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-08 19:28:46,359 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:46,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:46,685 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:47,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:47,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1206 states and 1443 transitions. [2024-11-08 19:28:47,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1443 transitions. [2024-11-08 19:28:47,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-08 19:28:47,117 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:47,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:47,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:47,562 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-08 19:28:48,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:48,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1264 states and 1515 transitions. [2024-11-08 19:28:48,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 1515 transitions. [2024-11-08 19:28:48,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-08 19:28:48,679 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:48,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:49,268 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-08 19:28:49,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:49,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1266 states and 1516 transitions. [2024-11-08 19:28:49,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1516 transitions. [2024-11-08 19:28:49,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-08 19:28:49,603 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:49,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:49,745 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 19:28:51,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:51,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1304 states and 1559 transitions. [2024-11-08 19:28:51,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1559 transitions. [2024-11-08 19:28:51,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 19:28:51,095 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:51,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:51,296 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 136 proven. 65 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-08 19:28:52,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:52,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1339 states and 1596 transitions. [2024-11-08 19:28:52,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 1596 transitions. [2024-11-08 19:28:52,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 19:28:52,336 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:52,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:52,907 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-08 19:28:56,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:56,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1392 states and 1657 transitions. [2024-11-08 19:28:56,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1657 transitions. [2024-11-08 19:28:56,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 19:28:56,137 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:56,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:56,507 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-08 19:28:56,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:56,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1394 states and 1660 transitions. [2024-11-08 19:28:56,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1660 transitions. [2024-11-08 19:28:56,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-08 19:28:56,968 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:56,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:57,390 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:57,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:57,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1396 states and 1664 transitions. [2024-11-08 19:28:57,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 1664 transitions. [2024-11-08 19:28:57,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-08 19:28:57,869 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:57,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:58,332 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:00,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:00,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1419 states and 1690 transitions. [2024-11-08 19:29:00,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 1690 transitions. [2024-11-08 19:29:00,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-08 19:29:00,239 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:00,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:00,580 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:02,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:02,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1727 states to 1452 states and 1727 transitions. [2024-11-08 19:29:02,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 1727 transitions. [2024-11-08 19:29:02,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-08 19:29:02,803 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:02,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:02,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:03,088 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:03,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:03,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1727 states to 1453 states and 1727 transitions. [2024-11-08 19:29:03,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 1727 transitions. [2024-11-08 19:29:03,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 19:29:03,627 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:03,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:04,393 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-08 19:29:08,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:08,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1515 states and 1807 transitions. [2024-11-08 19:29:08,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1807 transitions. [2024-11-08 19:29:08,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 19:29:08,191 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:08,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:08,615 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-08 19:29:09,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:09,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1527 states and 1817 transitions. [2024-11-08 19:29:09,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 1817 transitions. [2024-11-08 19:29:09,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 19:29:09,909 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:09,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:09,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:10,215 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 140 proven. 71 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 19:29:10,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:10,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1530 states and 1820 transitions. [2024-11-08 19:29:10,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 1820 transitions. [2024-11-08 19:29:10,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-08 19:29:10,414 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:10,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:11,407 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 119 proven. 137 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 19:29:15,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:15,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1664 states and 1968 transitions. [2024-11-08 19:29:15,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 1968 transitions. [2024-11-08 19:29:15,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-08 19:29:15,695 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:15,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:16,020 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 58 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-08 19:29:17,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:17,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1692 states and 1997 transitions. [2024-11-08 19:29:17,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1692 states and 1997 transitions. [2024-11-08 19:29:17,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-08 19:29:17,049 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:17,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:17,384 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:18,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:18,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 1705 states and 2012 transitions. [2024-11-08 19:29:18,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2012 transitions. [2024-11-08 19:29:18,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-08 19:29:18,069 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:18,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:18,519 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:19,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:19,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2016 states to 1708 states and 2016 transitions. [2024-11-08 19:29:19,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2016 transitions. [2024-11-08 19:29:19,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-08 19:29:19,071 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:19,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:19,562 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 86 proven. 141 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-08 19:29:22,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:22,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2118 states to 1796 states and 2118 transitions. [2024-11-08 19:29:22,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2118 transitions. [2024-11-08 19:29:22,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-08 19:29:22,425 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:22,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:22,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:23,389 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 129 proven. 142 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 19:29:25,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:25,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2194 states to 1870 states and 2194 transitions. [2024-11-08 19:29:25,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2194 transitions. [2024-11-08 19:29:25,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-08 19:29:25,561 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:25,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:25,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:26,186 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 183 proven. 52 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-08 19:29:28,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:28,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 1891 states and 2216 transitions. [2024-11-08 19:29:28,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 2216 transitions. [2024-11-08 19:29:28,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-08 19:29:28,317 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:28,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:28,730 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 185 proven. 54 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-08 19:29:29,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:29,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 1893 states and 2218 transitions. [2024-11-08 19:29:29,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2218 transitions. [2024-11-08 19:29:29,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-08 19:29:29,043 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:29,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:29,520 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 152 proven. 83 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-08 19:29:30,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:30,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2235 states to 1908 states and 2235 transitions. [2024-11-08 19:29:30,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 2235 transitions. [2024-11-08 19:29:30,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-08 19:29:30,437 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:30,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:30,891 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 155 proven. 86 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-08 19:29:33,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:33,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 1945 states and 2280 transitions. [2024-11-08 19:29:33,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 2280 transitions. [2024-11-08 19:29:33,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-08 19:29:33,083 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:33,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:33,556 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 156 proven. 87 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-08 19:29:34,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:34,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2314 states to 1974 states and 2314 transitions. [2024-11-08 19:29:34,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 2314 transitions. [2024-11-08 19:29:34,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-08 19:29:34,780 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:34,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:35,207 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 159 proven. 90 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-08 19:29:36,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:36,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 1977 states and 2318 transitions. [2024-11-08 19:29:36,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2318 transitions. [2024-11-08 19:29:36,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-08 19:29:36,074 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:36,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:36,393 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 162 proven. 93 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 19:29:36,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:36,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 1980 states and 2321 transitions. [2024-11-08 19:29:36,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1980 states and 2321 transitions. [2024-11-08 19:29:36,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-08 19:29:36,630 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:36,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:37,022 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 166 proven. 97 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-08 19:29:37,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:37,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2324 states to 1983 states and 2324 transitions. [2024-11-08 19:29:37,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1983 states and 2324 transitions. [2024-11-08 19:29:37,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-08 19:29:37,245 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:37,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:37,670 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-08 19:29:39,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:39,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2372 states to 2024 states and 2372 transitions. [2024-11-08 19:29:39,549 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 2372 transitions. [2024-11-08 19:29:39,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-08 19:29:39,551 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:39,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:40,147 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 199 proven. 49 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-08 19:29:43,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:43,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2063 states and 2426 transitions. [2024-11-08 19:29:43,670 INFO L276 IsEmpty]: Start isEmpty. Operand 2063 states and 2426 transitions. [2024-11-08 19:29:43,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-08 19:29:43,672 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:43,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:44,092 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 169 proven. 100 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-08 19:29:45,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:45,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 2077 states and 2441 transitions. [2024-11-08 19:29:45,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2077 states and 2441 transitions. [2024-11-08 19:29:45,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-08 19:29:45,027 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:45,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:45,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:45,203 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-08 19:29:46,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:46,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2089 states and 2457 transitions. [2024-11-08 19:29:46,625 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2457 transitions. [2024-11-08 19:29:46,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-08 19:29:46,627 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:46,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:46,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:46,876 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-08 19:29:47,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:47,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2091 states and 2459 transitions. [2024-11-08 19:29:47,443 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 2459 transitions. [2024-11-08 19:29:47,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-08 19:29:47,444 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:47,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:47,814 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-08 19:29:48,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:48,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2103 states and 2473 transitions. [2024-11-08 19:29:48,557 INFO L276 IsEmpty]: Start isEmpty. Operand 2103 states and 2473 transitions. [2024-11-08 19:29:48,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-08 19:29:48,558 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:48,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:48,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:48,877 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-08 19:29:49,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:49,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2104 states and 2473 transitions. [2024-11-08 19:29:49,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2104 states and 2473 transitions. [2024-11-08 19:29:49,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-08 19:29:49,190 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:49,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:49,633 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 19:29:56,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:56,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2181 states and 2569 transitions. [2024-11-08 19:29:56,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 2569 transitions. [2024-11-08 19:29:56,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-08 19:29:56,844 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:56,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:57,141 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 19:29:59,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:59,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2587 states to 2198 states and 2587 transitions. [2024-11-08 19:29:59,401 INFO L276 IsEmpty]: Start isEmpty. Operand 2198 states and 2587 transitions. [2024-11-08 19:29:59,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-08 19:29:59,404 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:59,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:59,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:59,874 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 179 proven. 104 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 19:30:00,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:00,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2596 states to 2207 states and 2596 transitions. [2024-11-08 19:30:00,121 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 2596 transitions. [2024-11-08 19:30:00,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-08 19:30:00,124 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:00,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:00,592 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 173 proven. 104 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-11-08 19:30:01,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:01,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2622 states to 2231 states and 2622 transitions. [2024-11-08 19:30:01,409 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2622 transitions. [2024-11-08 19:30:01,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-08 19:30:01,411 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:01,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:01,909 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 19:30:05,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:05,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2678 states to 2273 states and 2678 transitions. [2024-11-08 19:30:05,908 INFO L276 IsEmpty]: Start isEmpty. Operand 2273 states and 2678 transitions. [2024-11-08 19:30:05,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-08 19:30:05,914 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:05,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:05,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:06,594 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 19:30:07,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:07,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2277 states and 2682 transitions. [2024-11-08 19:30:07,529 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 2682 transitions. [2024-11-08 19:30:07,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-08 19:30:07,532 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:07,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:07,813 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-08 19:30:08,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:08,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2685 states to 2280 states and 2685 transitions. [2024-11-08 19:30:08,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 2685 transitions. [2024-11-08 19:30:08,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-08 19:30:08,219 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:08,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:08,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:08,420 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-08 19:30:08,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:08,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2688 states to 2283 states and 2688 transitions. [2024-11-08 19:30:08,821 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 2688 transitions. [2024-11-08 19:30:08,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-08 19:30:08,824 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:08,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:08,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:09,336 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 175 proven. 106 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-08 19:30:10,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:10,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2694 states to 2286 states and 2694 transitions. [2024-11-08 19:30:10,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2286 states and 2694 transitions. [2024-11-08 19:30:10,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-08 19:30:10,190 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:10,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:10,493 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 228 proven. 38 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-08 19:30:12,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:12,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2707 states to 2297 states and 2707 transitions. [2024-11-08 19:30:12,230 INFO L276 IsEmpty]: Start isEmpty. Operand 2297 states and 2707 transitions. [2024-11-08 19:30:12,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-08 19:30:12,233 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:12,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:13,165 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:30:21,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:21,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2775 states to 2358 states and 2775 transitions. [2024-11-08 19:30:21,048 INFO L276 IsEmpty]: Start isEmpty. Operand 2358 states and 2775 transitions. [2024-11-08 19:30:21,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-08 19:30:21,050 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:21,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:21,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:21,482 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:30:27,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:27,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2407 states and 2828 transitions. [2024-11-08 19:30:27,874 INFO L276 IsEmpty]: Start isEmpty. Operand 2407 states and 2828 transitions. [2024-11-08 19:30:27,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-08 19:30:27,876 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:27,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:27,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:28,477 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:30:30,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:30,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2841 states to 2420 states and 2841 transitions. [2024-11-08 19:30:30,725 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 2841 transitions. [2024-11-08 19:30:30,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-08 19:30:30,732 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:30,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:31,530 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:30:32,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:32,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2841 states to 2421 states and 2841 transitions. [2024-11-08 19:30:32,407 INFO L276 IsEmpty]: Start isEmpty. Operand 2421 states and 2841 transitions. [2024-11-08 19:30:32,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-08 19:30:32,410 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:32,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:32,588 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-08 19:30:34,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:34,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2848 states to 2424 states and 2848 transitions. [2024-11-08 19:30:34,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2424 states and 2848 transitions. [2024-11-08 19:30:34,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-08 19:30:34,151 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:34,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:34,319 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-08 19:30:35,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:35,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2848 states to 2425 states and 2848 transitions. [2024-11-08 19:30:35,070 INFO L276 IsEmpty]: Start isEmpty. Operand 2425 states and 2848 transitions. [2024-11-08 19:30:35,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-08 19:30:35,072 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:35,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:35,338 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-08 19:30:35,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:35,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2426 states and 2851 transitions. [2024-11-08 19:30:35,859 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 2851 transitions. [2024-11-08 19:30:35,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-08 19:30:35,860 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:35,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:35,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:36,221 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 186 proven. 111 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 19:30:36,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:36,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2858 states to 2433 states and 2858 transitions. [2024-11-08 19:30:36,467 INFO L276 IsEmpty]: Start isEmpty. Operand 2433 states and 2858 transitions. [2024-11-08 19:30:36,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-08 19:30:36,469 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:36,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:37,019 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 224 proven. 65 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-08 19:30:39,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:39,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2456 states and 2889 transitions. [2024-11-08 19:30:39,921 INFO L276 IsEmpty]: Start isEmpty. Operand 2456 states and 2889 transitions. [2024-11-08 19:30:39,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-08 19:30:39,923 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:39,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:40,390 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 185 proven. 152 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 19:30:44,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:44,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2487 states and 2922 transitions. [2024-11-08 19:30:44,178 INFO L276 IsEmpty]: Start isEmpty. Operand 2487 states and 2922 transitions. [2024-11-08 19:30:44,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-08 19:30:44,180 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:44,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:44,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:44,525 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 189 proven. 114 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 19:30:44,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:44,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2490 states and 2926 transitions. [2024-11-08 19:30:44,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 2926 transitions. [2024-11-08 19:30:44,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-08 19:30:44,734 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:44,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:45,155 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 228 proven. 65 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-08 19:30:47,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:47,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2942 states to 2501 states and 2942 transitions. [2024-11-08 19:30:47,174 INFO L276 IsEmpty]: Start isEmpty. Operand 2501 states and 2942 transitions. [2024-11-08 19:30:47,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-08 19:30:47,176 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:47,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:47,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:47,486 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 228 proven. 65 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-08 19:30:48,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:48,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2942 states to 2502 states and 2942 transitions. [2024-11-08 19:30:48,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2502 states and 2942 transitions. [2024-11-08 19:30:48,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-08 19:30:48,283 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:48,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:48,598 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 228 proven. 65 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-08 19:30:49,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:49,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2943 states to 2503 states and 2943 transitions. [2024-11-08 19:30:49,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2503 states and 2943 transitions. [2024-11-08 19:30:49,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-08 19:30:49,365 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:49,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:49,765 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-08 19:30:51,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:51,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2958 states to 2515 states and 2958 transitions. [2024-11-08 19:30:51,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2515 states and 2958 transitions. [2024-11-08 19:30:51,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-08 19:30:51,678 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:51,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:52,223 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 125 proven. 170 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-08 19:30:59,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:59,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3084 states to 2623 states and 3084 transitions. [2024-11-08 19:30:59,175 INFO L276 IsEmpty]: Start isEmpty. Operand 2623 states and 3084 transitions. [2024-11-08 19:30:59,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-08 19:30:59,177 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:59,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:00,083 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 19:31:03,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:31:03,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3153 states to 2684 states and 3153 transitions. [2024-11-08 19:31:03,399 INFO L276 IsEmpty]: Start isEmpty. Operand 2684 states and 3153 transitions. [2024-11-08 19:31:03,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-08 19:31:03,400 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:31:03,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:31:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:03,762 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 19:31:04,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:31:04,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3159 states to 2689 states and 3159 transitions. [2024-11-08 19:31:04,340 INFO L276 IsEmpty]: Start isEmpty. Operand 2689 states and 3159 transitions. [2024-11-08 19:31:04,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-08 19:31:04,343 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:31:04,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:31:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:04,511 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2024-11-08 19:31:04,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:31:04,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3159 states to 2690 states and 3159 transitions. [2024-11-08 19:31:04,776 INFO L276 IsEmpty]: Start isEmpty. Operand 2690 states and 3159 transitions. [2024-11-08 19:31:04,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-08 19:31:04,778 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:31:04,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:31:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:05,586 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 279 proven. 206 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-08 19:31:09,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:31:09,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 2742 states and 3208 transitions. [2024-11-08 19:31:09,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2742 states and 3208 transitions. [2024-11-08 19:31:09,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 19:31:09,573 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 101 iterations. [2024-11-08 19:31:09,581 INFO L729 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-08 19:31:52,083 INFO L77 FloydHoareUtils]: At program point L102(lines 102 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-11-08 19:31:52,083 INFO L77 FloydHoareUtils]: At program point L598(line 598) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,083 INFO L77 FloydHoareUtils]: At program point L334(lines 334 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,084 INFO L77 FloydHoareUtils]: At program point L302(lines 302 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,084 INFO L77 FloydHoareUtils]: At program point L170(lines 170 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-08 19:31:52,084 INFO L77 FloydHoareUtils]: At program point L204(lines 204 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-08 19:31:52,085 INFO L77 FloydHoareUtils]: At program point L72(lines 72 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,085 INFO L77 FloydHoareUtils]: At program point L271(lines 271 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,085 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-11-08 19:31:52,085 INFO L77 FloydHoareUtils]: At program point L371(lines 371 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,086 INFO L77 FloydHoareUtils]: At program point L107(lines 107 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-11-08 19:31:52,086 INFO L77 FloydHoareUtils]: At program point L41(lines 41 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,087 INFO L77 FloydHoareUtils]: At program point L339(lines 339 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,087 INFO L77 FloydHoareUtils]: At program point L207(lines 207 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-08 19:31:52,087 INFO L77 FloydHoareUtils]: At program point L75(lines 75 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,088 INFO L77 FloydHoareUtils]: At program point L373(lines 373 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,088 INFO L77 FloydHoareUtils]: At program point L241(lines 241 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,088 INFO L77 FloydHoareUtils]: At program point L175(lines 175 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-08 19:31:52,089 INFO L77 FloydHoareUtils]: At program point L539-1(lines 40 585) the Hoare annotation is: (not (and (< 13 ~a8~0) (= ~a7~0 1))) [2024-11-08 19:31:52,089 INFO L77 FloydHoareUtils]: At program point L275(lines 275 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,089 INFO L77 FloydHoareUtils]: At program point L375(lines 375 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,090 INFO L77 FloydHoareUtils]: At program point L309(lines 309 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,090 INFO L77 FloydHoareUtils]: At program point L45(lines 45 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,090 INFO L77 FloydHoareUtils]: At program point L343(lines 343 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,090 INFO L77 FloydHoareUtils]: At program point L112(lines 112 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-11-08 19:31:52,091 INFO L77 FloydHoareUtils]: At program point L542-1(lines 40 585) the Hoare annotation is: (not (and (< 13 ~a8~0) (= ~a7~0 1))) [2024-11-08 19:31:52,091 INFO L77 FloydHoareUtils]: At program point L278(lines 278 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,091 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-11-08 19:31:52,091 INFO L75 FloydHoareUtils]: For program point L543(line 543) no Hoare annotation was computed. [2024-11-08 19:31:52,092 INFO L77 FloydHoareUtils]: At program point L213(lines 213 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-08 19:31:52,092 INFO L77 FloydHoareUtils]: At program point L82(lines 82 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,092 INFO L77 FloydHoareUtils]: At program point L347(lines 347 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,092 INFO L77 FloydHoareUtils]: At program point L248(lines 248 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,093 INFO L77 FloydHoareUtils]: At program point L183(lines 183 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-08 19:31:52,093 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-11-08 19:31:52,093 INFO L77 FloydHoareUtils]: At program point L382(lines 382 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,094 INFO L77 FloydHoareUtils]: At program point L316(lines 316 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,094 INFO L77 FloydHoareUtils]: At program point L283(lines 283 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,094 INFO L77 FloydHoareUtils]: At program point L118(lines 118 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-11-08 19:31:52,094 INFO L77 FloydHoareUtils]: At program point L218(lines 218 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-08 19:31:52,095 INFO L77 FloydHoareUtils]: At program point L53(lines 53 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,095 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-11-08 19:31:52,095 INFO L77 FloydHoareUtils]: At program point L188(lines 188 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-08 19:31:52,095 INFO L77 FloydHoareUtils]: At program point L387(lines 387 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,095 INFO L77 FloydHoareUtils]: At program point L288(lines 288 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,096 INFO L77 FloydHoareUtils]: At program point L255(lines 255 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,096 INFO L77 FloydHoareUtils]: At program point L90(lines 90 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,096 INFO L77 FloydHoareUtils]: At program point L355(lines 355 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,096 INFO L77 FloydHoareUtils]: At program point L322(lines 322 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,096 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-08 19:31:52,097 INFO L77 FloydHoareUtils]: At program point L124(lines 124 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-11-08 19:31:52,097 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-11-08 19:31:52,097 INFO L77 FloydHoareUtils]: At program point L224(lines 224 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,097 INFO L77 FloydHoareUtils]: At program point L158(lines 158 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-08 19:31:52,097 INFO L77 FloydHoareUtils]: At program point L59(lines 59 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,097 INFO L77 FloydHoareUtils]: At program point L94(lines 94 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-11-08 19:31:52,098 INFO L77 FloydHoareUtils]: At program point L392(lines 392 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,098 INFO L77 FloydHoareUtils]: At program point L326(lines 326 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,098 INFO L77 FloydHoareUtils]: At program point L260(lines 260 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,098 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-08 19:31:52,099 INFO L77 FloydHoareUtils]: At program point L228(lines 228 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,099 INFO L77 FloydHoareUtils]: At program point L162(lines 162 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-08 19:31:52,099 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-11-08 19:31:52,099 INFO L77 FloydHoareUtils]: At program point L328(lines 328 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,099 INFO L77 FloydHoareUtils]: At program point L196(lines 196 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-08 19:31:52,100 INFO L77 FloydHoareUtils]: At program point L64(lines 64 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,100 INFO L77 FloydHoareUtils]: At program point L593-2(lines 593 603) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,100 INFO L77 FloydHoareUtils]: At program point L296(lines 296 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,100 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 40 585) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-08 19:31:52,100 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 543) no Hoare annotation was computed. [2024-11-08 19:31:52,101 INFO L77 FloydHoareUtils]: At program point L363(lines 363 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,101 INFO L77 FloydHoareUtils]: At program point L199(lines 199 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-08 19:31:52,101 INFO L77 FloydHoareUtils]: At program point L365(lines 365 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,101 INFO L77 FloydHoareUtils]: At program point L266(lines 266 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,101 INFO L77 FloydHoareUtils]: At program point L233(lines 233 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:31:52,102 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-11-08 19:31:52,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 07:31:52 ImpRootNode [2024-11-08 19:31:52,119 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 19:31:52,120 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:31:52,120 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:31:52,120 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:31:52,121 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:27:57" (3/4) ... [2024-11-08 19:31:52,123 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 19:31:52,146 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 119 nodes and edges [2024-11-08 19:31:52,150 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-08 19:31:52,151 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-08 19:31:52,151 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 19:31:52,335 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa03bfd-df8f-4baa-bd55-d2f0616b7f07/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 19:31:52,335 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa03bfd-df8f-4baa-bd55-d2f0616b7f07/bin/ukojak-verify-ImItNfHLgk/witness.yml [2024-11-08 19:31:52,336 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:31:52,336 INFO L158 Benchmark]: Toolchain (without parser) took 237843.65ms. Allocated memory was 153.1MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 120.6MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 704.6MB. Max. memory is 16.1GB. [2024-11-08 19:31:52,336 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 113.2MB. Free memory was 68.3MB in the beginning and 68.1MB in the end (delta: 118.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:31:52,337 INFO L158 Benchmark]: CACSL2BoogieTranslator took 761.44ms. Allocated memory is still 153.1MB. Free memory was 120.6MB in the beginning and 91.0MB in the end (delta: 29.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-08 19:31:52,337 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.04ms. Allocated memory is still 153.1MB. Free memory was 90.4MB in the beginning and 84.7MB in the end (delta: 5.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 19:31:52,337 INFO L158 Benchmark]: Boogie Preprocessor took 66.38ms. Allocated memory is still 153.1MB. Free memory was 84.7MB in the beginning and 80.1MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 19:31:52,339 INFO L158 Benchmark]: RCFGBuilder took 1642.06ms. Allocated memory was 153.1MB in the beginning and 201.3MB in the end (delta: 48.2MB). Free memory was 80.1MB in the beginning and 103.3MB in the end (delta: -23.3MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. [2024-11-08 19:31:52,339 INFO L158 Benchmark]: CodeCheck took 235063.95ms. Allocated memory was 201.3MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 103.3MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 624.7MB. Max. memory is 16.1GB. [2024-11-08 19:31:52,339 INFO L158 Benchmark]: Witness Printer took 215.86ms. Allocated memory is still 2.7GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 19:31:52,341 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: 192.5s, OverallIterations: 101, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 311517 SdHoareTripleChecker+Valid, 937.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 310624 mSDsluCounter, 42614 SdHoareTripleChecker+Invalid, 807.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36182 mSDsCounter, 67039 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 674121 IncrementalHoareTripleChecker+Invalid, 741160 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67039 mSolverCounterUnsat, 6432 mSDtfsCounter, 674121 mSolverCounterSat, 7.9s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 137605 GetRequests, 128872 SyntacticMatches, 7785 SemanticMatches, 948 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648367 ImplicationChecksByTransitivity, 126.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.9s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 36.6s InterpolantComputationTime, 20456 NumberOfCodeBlocks, 20456 NumberOfCodeBlocksAsserted, 100 NumberOfCheckSat, 20356 ConstructedInterpolants, 0 QuantifiedInterpolants, 166427 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 100 InterpolantComputations, 26 PerfectInterpolantSequences, 18699/24088 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: 543]: 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)) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15)) && !((((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15)) && (a16 == 4))) && !(((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) && (13 < a8)) && (a7 == 1)) && !((((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: !((((((!((((((a12 == 8) && (5 == a16)) && (a21 == 1)) && (a17 == 1)) && (a20 == 1)) && (a8 == 15)) && !((((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15))) && !((((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15)) && (a16 == 4))) && !(((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) && (13 < a8)) && (a7 == 1)) && !((((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 113.2MB. Free memory was 68.3MB in the beginning and 68.1MB in the end (delta: 118.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 761.44ms. Allocated memory is still 153.1MB. Free memory was 120.6MB in the beginning and 91.0MB in the end (delta: 29.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.04ms. Allocated memory is still 153.1MB. Free memory was 90.4MB in the beginning and 84.7MB in the end (delta: 5.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.38ms. Allocated memory is still 153.1MB. Free memory was 84.7MB in the beginning and 80.1MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1642.06ms. Allocated memory was 153.1MB in the beginning and 201.3MB in the end (delta: 48.2MB). Free memory was 80.1MB in the beginning and 103.3MB in the end (delta: -23.3MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. * CodeCheck took 235063.95ms. Allocated memory was 201.3MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 103.3MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 624.7MB. Max. memory is 16.1GB. * Witness Printer took 215.86ms. Allocated memory is still 2.7GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-08 19:31:52,378 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa03bfd-df8f-4baa-bd55-d2f0616b7f07/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE