./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label18.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e818af30-32cc-42ec-a81d-079530d771cb/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e818af30-32cc-42ec-a81d-079530d771cb/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_e818af30-32cc-42ec-a81d-079530d771cb/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e818af30-32cc-42ec-a81d-079530d771cb/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label18.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e818af30-32cc-42ec-a81d-079530d771cb/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_e818af30-32cc-42ec-a81d-079530d771cb/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 8fcc4bb7cd8f204722096b247511c17cd0d430fd3f99523a22a5bf87d5e044f6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 00:31:45,928 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:31:46,004 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e818af30-32cc-42ec-a81d-079530d771cb/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-09 00:31:46,009 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:31:46,009 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-09 00:31:46,042 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:31:46,045 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:31:46,046 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-09 00:31:46,047 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:31:46,048 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:31:46,050 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:31:46,050 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:31:46,051 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:31:46,051 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:31:46,053 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:31:46,054 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:31:46,054 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:31:46,054 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:31:46,055 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:31:46,055 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:31:46,056 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:31:46,060 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:31:46,061 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:31:46,061 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-09 00:31:46,061 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-09 00:31:46,062 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-09 00:31:46,062 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:31:46,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:31:46,063 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:31:46,063 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:31:46,065 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:31:46,066 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-09 00:31:46,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:31:46,066 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_e818af30-32cc-42ec-a81d-079530d771cb/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_e818af30-32cc-42ec-a81d-079530d771cb/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 -> 8fcc4bb7cd8f204722096b247511c17cd0d430fd3f99523a22a5bf87d5e044f6 [2024-11-09 00:31:46,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:31:46,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:31:46,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:31:46,421 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:31:46,422 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:31:46,423 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e818af30-32cc-42ec-a81d-079530d771cb/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/eca-rers2012/Problem01_label18.c Unable to find full path for "g++" [2024-11-09 00:31:48,507 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:31:48,797 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:31:48,797 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e818af30-32cc-42ec-a81d-079530d771cb/sv-benchmarks/c/eca-rers2012/Problem01_label18.c [2024-11-09 00:31:48,822 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e818af30-32cc-42ec-a81d-079530d771cb/bin/ukojak-verify-ImItNfHLgk/data/0149320e7/b40be2ec02cf44b89621543524f6c9b4/FLAG4505b2dae [2024-11-09 00:31:49,089 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e818af30-32cc-42ec-a81d-079530d771cb/bin/ukojak-verify-ImItNfHLgk/data/0149320e7/b40be2ec02cf44b89621543524f6c9b4 [2024-11-09 00:31:49,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:31:49,094 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:31:49,096 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:31:49,096 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:31:49,102 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:31:49,103 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:31:49" (1/1) ... [2024-11-09 00:31:49,104 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66c46f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:49, skipping insertion in model container [2024-11-09 00:31:49,104 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:31:49" (1/1) ... [2024-11-09 00:31:49,153 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:31:49,571 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_e818af30-32cc-42ec-a81d-079530d771cb/sv-benchmarks/c/eca-rers2012/Problem01_label18.c[17985,17998] [2024-11-09 00:31:49,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:31:49,647 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:31:49,744 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_e818af30-32cc-42ec-a81d-079530d771cb/sv-benchmarks/c/eca-rers2012/Problem01_label18.c[17985,17998] [2024-11-09 00:31:49,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:31:49,781 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:31:49,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:49 WrapperNode [2024-11-09 00:31:49,782 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:31:49,783 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:31:49,784 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:31:49,784 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:31:49,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:49" (1/1) ... [2024-11-09 00:31:49,808 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:49" (1/1) ... [2024-11-09 00:31:49,865 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-09 00:31:49,865 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:31:49,866 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:31:49,866 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:31:49,866 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:31:49,877 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:49" (1/1) ... [2024-11-09 00:31:49,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:49" (1/1) ... [2024-11-09 00:31:49,882 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:49" (1/1) ... [2024-11-09 00:31:49,883 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:49" (1/1) ... [2024-11-09 00:31:49,902 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:49" (1/1) ... [2024-11-09 00:31:49,909 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:49" (1/1) ... [2024-11-09 00:31:49,913 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:49" (1/1) ... [2024-11-09 00:31:49,918 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:49" (1/1) ... [2024-11-09 00:31:49,924 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:31:49,925 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:31:49,925 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:31:49,925 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:31:49,926 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:49" (1/1) ... [2024-11-09 00:31:49,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:31:49,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e818af30-32cc-42ec-a81d-079530d771cb/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-09 00:31:50,001 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e818af30-32cc-42ec-a81d-079530d771cb/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-09 00:31:50,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e818af30-32cc-42ec-a81d-079530d771cb/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-09 00:31:50,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:31:50,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 00:31:50,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:31:50,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:31:50,162 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:31:50,165 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:31:51,346 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-09 00:31:51,349 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:31:51,634 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:31:51,634 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:31:51,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:31:51 BoogieIcfgContainer [2024-11-09 00:31:51,635 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:31:51,636 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-09 00:31:51,636 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-09 00:31:51,647 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-09 00:31:51,648 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:31:51" (1/1) ... [2024-11-09 00:31:51,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:31:51,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:51,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-09 00:31:51,729 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-09 00:31:51,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 00:31:51,736 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:51,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:52,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:31:53,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:53,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 145 states and 219 transitions. [2024-11-09 00:31:53,063 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 219 transitions. [2024-11-09 00:31:53,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 00:31:53,065 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:53,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:53,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:53,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 00:31:53,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:53,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 146 states and 220 transitions. [2024-11-09 00:31:53,795 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2024-11-09 00:31:53,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-09 00:31:53,798 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:53,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:53,934 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:31:54,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:54,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 151 states and 227 transitions. [2024-11-09 00:31:54,044 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 227 transitions. [2024-11-09 00:31:54,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 00:31:54,052 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:54,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:54,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:54,620 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-09 00:31:55,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:55,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 226 states and 305 transitions. [2024-11-09 00:31:55,619 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 305 transitions. [2024-11-09 00:31:55,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-09 00:31:55,621 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:55,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:55,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:55,776 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:31:55,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:55,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 227 states and 307 transitions. [2024-11-09 00:31:55,926 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 307 transitions. [2024-11-09 00:31:55,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-09 00:31:55,927 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:55,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:56,117 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:31:56,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:56,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 230 states and 310 transitions. [2024-11-09 00:31:56,202 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 310 transitions. [2024-11-09 00:31:56,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-09 00:31:56,206 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:56,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:56,373 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 00:31:56,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:56,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 238 states and 323 transitions. [2024-11-09 00:31:56,907 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 323 transitions. [2024-11-09 00:31:56,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-09 00:31:56,910 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:56,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:56,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:57,052 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 00:31:57,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:57,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 243 states and 328 transitions. [2024-11-09 00:31:57,250 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 328 transitions. [2024-11-09 00:31:57,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 00:31:57,251 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:57,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:57,389 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:31:57,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:57,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 249 states and 335 transitions. [2024-11-09 00:31:57,582 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 335 transitions. [2024-11-09 00:31:57,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 00:31:57,583 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:57,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:57,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:57,820 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-09 00:31:58,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:58,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 257 states and 346 transitions. [2024-11-09 00:31:58,317 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 346 transitions. [2024-11-09 00:31:58,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-09 00:31:58,318 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:58,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:58,484 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:31:58,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:58,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 259 states and 348 transitions. [2024-11-09 00:31:58,670 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 348 transitions. [2024-11-09 00:31:58,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 00:31:58,672 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:58,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:58,835 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 00:31:59,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:59,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 268 states and 360 transitions. [2024-11-09 00:31:59,227 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 360 transitions. [2024-11-09 00:31:59,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 00:31:59,229 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:59,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:59,412 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 00:31:59,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:59,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 272 states and 365 transitions. [2024-11-09 00:31:59,696 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 365 transitions. [2024-11-09 00:31:59,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 00:31:59,697 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:59,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:59,935 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 00:32:00,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:00,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 275 states and 371 transitions. [2024-11-09 00:32:00,406 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 371 transitions. [2024-11-09 00:32:00,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 00:32:00,407 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:00,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:00,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:00,566 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 00:32:01,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:01,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 287 states and 387 transitions. [2024-11-09 00:32:01,230 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 387 transitions. [2024-11-09 00:32:01,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 00:32:01,231 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:01,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:01,367 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-09 00:32:01,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:01,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 288 states and 387 transitions. [2024-11-09 00:32:01,428 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 387 transitions. [2024-11-09 00:32:01,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 00:32:01,430 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:01,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:01,588 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:32:01,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:01,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 305 states and 406 transitions. [2024-11-09 00:32:01,843 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 406 transitions. [2024-11-09 00:32:01,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 00:32:01,845 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:01,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:02,085 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 00:32:02,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:02,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 320 states and 423 transitions. [2024-11-09 00:32:02,749 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 423 transitions. [2024-11-09 00:32:02,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 00:32:02,750 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:02,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:02,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:02,880 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-09 00:32:03,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:03,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 335 states and 439 transitions. [2024-11-09 00:32:03,195 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 439 transitions. [2024-11-09 00:32:03,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 00:32:03,196 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:03,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:03,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:03,397 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 00:32:03,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:03,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 349 states and 453 transitions. [2024-11-09 00:32:03,836 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 453 transitions. [2024-11-09 00:32:03,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-09 00:32:03,839 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:03,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:04,039 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 00:32:04,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:04,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 352 states and 457 transitions. [2024-11-09 00:32:04,139 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 457 transitions. [2024-11-09 00:32:04,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-09 00:32:04,141 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:04,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:04,353 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 00:32:05,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:05,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 360 states and 468 transitions. [2024-11-09 00:32:05,082 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 468 transitions. [2024-11-09 00:32:05,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 00:32:05,084 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:05,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:05,226 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 00:32:05,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:05,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 363 states and 472 transitions. [2024-11-09 00:32:05,414 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 472 transitions. [2024-11-09 00:32:05,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 00:32:05,416 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:05,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:05,755 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:32:06,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:06,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 367 states and 477 transitions. [2024-11-09 00:32:06,269 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 477 transitions. [2024-11-09 00:32:06,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 00:32:06,270 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:06,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:06,442 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 00:32:06,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:06,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 381 states and 491 transitions. [2024-11-09 00:32:06,767 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 491 transitions. [2024-11-09 00:32:06,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-09 00:32:06,769 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:06,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:07,038 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 61 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:32:07,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:07,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 383 states and 495 transitions. [2024-11-09 00:32:07,382 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 495 transitions. [2024-11-09 00:32:07,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-09 00:32:07,383 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:07,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:07,551 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:32:07,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:07,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 402 states and 516 transitions. [2024-11-09 00:32:07,838 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 516 transitions. [2024-11-09 00:32:07,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 00:32:07,840 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:07,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:08,071 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 00:32:08,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:08,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 404 states and 518 transitions. [2024-11-09 00:32:08,317 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 518 transitions. [2024-11-09 00:32:08,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 00:32:08,319 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:08,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:08,416 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 00:32:08,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:08,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 418 states and 532 transitions. [2024-11-09 00:32:08,554 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 532 transitions. [2024-11-09 00:32:08,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 00:32:08,556 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:08,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:08,645 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:32:08,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:08,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 426 states and 543 transitions. [2024-11-09 00:32:08,744 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 543 transitions. [2024-11-09 00:32:08,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 00:32:08,745 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:08,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:08,994 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 00:32:09,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:09,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 466 states and 585 transitions. [2024-11-09 00:32:09,953 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 585 transitions. [2024-11-09 00:32:09,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 00:32:09,955 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:09,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:10,142 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 00:32:10,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:10,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 471 states and 590 transitions. [2024-11-09 00:32:10,473 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 590 transitions. [2024-11-09 00:32:10,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 00:32:10,474 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:10,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:10,575 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 00:32:10,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:10,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 476 states and 596 transitions. [2024-11-09 00:32:10,747 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 596 transitions. [2024-11-09 00:32:10,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-09 00:32:10,748 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:10,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:11,014 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-09 00:32:11,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:11,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 479 states and 600 transitions. [2024-11-09 00:32:11,388 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 600 transitions. [2024-11-09 00:32:11,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 00:32:11,389 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:11,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:11,621 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 62 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 00:32:11,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:11,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 481 states and 603 transitions. [2024-11-09 00:32:11,932 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 603 transitions. [2024-11-09 00:32:11,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 00:32:11,933 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:11,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:12,211 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-09 00:32:12,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:12,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 484 states and 606 transitions. [2024-11-09 00:32:12,383 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 606 transitions. [2024-11-09 00:32:12,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 00:32:12,384 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:12,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:12,739 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-09 00:32:13,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:13,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 534 states and 661 transitions. [2024-11-09 00:32:13,829 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 661 transitions. [2024-11-09 00:32:13,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 00:32:13,830 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:13,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:14,053 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-09 00:32:14,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:14,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 536 states and 662 transitions. [2024-11-09 00:32:14,293 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 662 transitions. [2024-11-09 00:32:14,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-09 00:32:14,294 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:14,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:14,528 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 00:32:14,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:14,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 539 states and 665 transitions. [2024-11-09 00:32:14,658 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 665 transitions. [2024-11-09 00:32:14,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-09 00:32:14,659 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:14,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:14,790 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:32:15,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:15,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 559 states and 686 transitions. [2024-11-09 00:32:15,105 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 686 transitions. [2024-11-09 00:32:15,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-09 00:32:15,106 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:15,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:15,470 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:32:17,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:17,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 699 states and 841 transitions. [2024-11-09 00:32:17,229 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 841 transitions. [2024-11-09 00:32:17,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-09 00:32:17,231 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:17,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:17,727 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-09 00:32:19,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:19,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 768 states and 926 transitions. [2024-11-09 00:32:19,325 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 926 transitions. [2024-11-09 00:32:19,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-09 00:32:19,327 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:19,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:19,792 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:32:22,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:22,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 822 states and 987 transitions. [2024-11-09 00:32:22,275 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 987 transitions. [2024-11-09 00:32:22,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 00:32:22,277 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:22,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:22,605 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-09 00:32:23,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:23,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 839 states and 1006 transitions. [2024-11-09 00:32:23,635 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1006 transitions. [2024-11-09 00:32:23,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 00:32:23,636 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:23,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:23,846 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-09 00:32:24,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:24,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 841 states and 1007 transitions. [2024-11-09 00:32:24,216 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1007 transitions. [2024-11-09 00:32:24,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 00:32:24,218 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:24,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:24,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:24,641 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 82 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:32:25,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:25,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 854 states and 1022 transitions. [2024-11-09 00:32:25,141 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1022 transitions. [2024-11-09 00:32:25,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-09 00:32:25,143 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:25,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:25,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:25,261 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-09 00:32:25,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:25,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 868 states and 1039 transitions. [2024-11-09 00:32:25,786 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1039 transitions. [2024-11-09 00:32:25,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-09 00:32:25,787 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:25,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:25,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:25,973 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-09 00:32:26,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:26,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 889 states and 1058 transitions. [2024-11-09 00:32:26,370 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1058 transitions. [2024-11-09 00:32:26,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-09 00:32:26,371 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:26,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:26,777 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:32:27,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:27,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 919 states and 1092 transitions. [2024-11-09 00:32:27,839 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1092 transitions. [2024-11-09 00:32:27,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-09 00:32:27,840 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:27,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:27,984 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 00:32:28,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:28,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 933 states and 1105 transitions. [2024-11-09 00:32:28,463 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1105 transitions. [2024-11-09 00:32:28,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-09 00:32:28,464 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:28,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:28,936 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-09 00:32:29,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:29,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 950 states and 1123 transitions. [2024-11-09 00:32:29,706 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1123 transitions. [2024-11-09 00:32:29,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-09 00:32:29,707 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:29,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:29,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:29,934 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-09 00:32:30,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:30,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 996 states and 1176 transitions. [2024-11-09 00:32:30,574 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1176 transitions. [2024-11-09 00:32:30,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-09 00:32:30,576 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:30,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:30,714 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-09 00:32:30,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:30,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 997 states and 1176 transitions. [2024-11-09 00:32:30,764 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1176 transitions. [2024-11-09 00:32:30,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-09 00:32:30,766 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:30,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:31,176 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:32:33,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:33,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1068 states and 1263 transitions. [2024-11-09 00:32:33,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1263 transitions. [2024-11-09 00:32:33,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-09 00:32:33,378 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:33,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:33,748 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 108 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:32:34,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:34,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1077 states and 1273 transitions. [2024-11-09 00:32:34,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1273 transitions. [2024-11-09 00:32:34,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-09 00:32:34,227 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:34,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:34,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:34,509 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 109 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:32:36,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:36,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1117 states and 1320 transitions. [2024-11-09 00:32:36,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1320 transitions. [2024-11-09 00:32:36,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-09 00:32:36,026 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:36,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:36,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:36,692 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 130 proven. 49 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 00:32:39,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:39,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1210 states and 1435 transitions. [2024-11-09 00:32:39,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1435 transitions. [2024-11-09 00:32:39,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-09 00:32:39,297 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:39,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:39,790 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 130 proven. 49 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 00:32:40,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:40,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1212 states and 1438 transitions. [2024-11-09 00:32:40,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1438 transitions. [2024-11-09 00:32:40,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-09 00:32:40,168 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:40,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:40,258 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 00:32:41,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:41,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1239 states and 1469 transitions. [2024-11-09 00:32:41,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1469 transitions. [2024-11-09 00:32:41,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-09 00:32:41,034 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:41,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:41,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:41,153 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 00:32:41,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:41,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1269 states and 1501 transitions. [2024-11-09 00:32:41,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 1501 transitions. [2024-11-09 00:32:41,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-09 00:32:41,896 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:41,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:41,998 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-09 00:32:42,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:42,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1285 states and 1516 transitions. [2024-11-09 00:32:42,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1516 transitions. [2024-11-09 00:32:42,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-09 00:32:42,275 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:42,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:42,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:42,585 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 142 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-09 00:32:43,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:43,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1314 states and 1548 transitions. [2024-11-09 00:32:43,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1548 transitions. [2024-11-09 00:32:43,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-09 00:32:43,658 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:43,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:43,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:44,004 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-09 00:32:44,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:44,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1330 states and 1565 transitions. [2024-11-09 00:32:44,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1565 transitions. [2024-11-09 00:32:44,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-09 00:32:44,896 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:44,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:44,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:45,259 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-09 00:32:45,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:45,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1335 states and 1569 transitions. [2024-11-09 00:32:45,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 1569 transitions. [2024-11-09 00:32:45,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-09 00:32:45,667 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:45,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:46,350 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 3 proven. 167 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 00:32:48,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:48,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1367 states and 1602 transitions. [2024-11-09 00:32:48,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1602 transitions. [2024-11-09 00:32:48,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-09 00:32:48,495 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:48,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:48,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:48,889 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 119 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:32:49,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:49,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1619 states to 1381 states and 1619 transitions. [2024-11-09 00:32:49,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1619 transitions. [2024-11-09 00:32:49,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-09 00:32:49,816 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:49,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:50,337 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 152 proven. 65 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-09 00:32:53,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:53,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1432 states and 1690 transitions. [2024-11-09 00:32:53,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1690 transitions. [2024-11-09 00:32:53,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-09 00:32:53,291 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:53,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:53,605 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 152 proven. 65 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-09 00:32:54,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:54,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1445 states and 1704 transitions. [2024-11-09 00:32:54,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1704 transitions. [2024-11-09 00:32:54,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-09 00:32:54,509 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:54,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:55,379 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 69 proven. 124 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-09 00:33:00,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:00,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1605 states and 1886 transitions. [2024-11-09 00:33:00,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 1886 transitions. [2024-11-09 00:33:00,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-09 00:33:00,370 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:00,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:00,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:00,795 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 239 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:33:02,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:02,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1635 states and 1929 transitions. [2024-11-09 00:33:02,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 1929 transitions. [2024-11-09 00:33:02,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-09 00:33:02,205 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:02,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:02,538 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 239 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:33:03,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:03,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1947 states to 1649 states and 1947 transitions. [2024-11-09 00:33:03,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 1947 transitions. [2024-11-09 00:33:03,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-09 00:33:03,703 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:03,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:03,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:04,076 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-09 00:33:05,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:05,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1659 states and 1959 transitions. [2024-11-09 00:33:05,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 1959 transitions. [2024-11-09 00:33:05,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-09 00:33:05,610 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:05,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:06,133 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-09 00:33:06,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:06,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1661 states and 1960 transitions. [2024-11-09 00:33:06,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 1960 transitions. [2024-11-09 00:33:06,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-09 00:33:06,708 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:06,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:07,072 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-09 00:33:07,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:07,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1662 states and 1960 transitions. [2024-11-09 00:33:07,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 1960 transitions. [2024-11-09 00:33:07,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-09 00:33:07,403 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:07,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:07,958 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 135 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:33:11,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:11,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 1710 states and 2014 transitions. [2024-11-09 00:33:11,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2014 transitions. [2024-11-09 00:33:11,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-09 00:33:11,111 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:11,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:11,868 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-09 00:33:13,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:13,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 1762 states and 2081 transitions. [2024-11-09 00:33:13,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 2081 transitions. [2024-11-09 00:33:13,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-09 00:33:13,731 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:13,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:14,056 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 139 proven. 55 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 00:33:15,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:15,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 1800 states and 2120 transitions. [2024-11-09 00:33:15,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2120 transitions. [2024-11-09 00:33:15,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-09 00:33:15,551 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:15,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:15,908 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-09 00:33:16,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:16,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 1806 states and 2127 transitions. [2024-11-09 00:33:16,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 2127 transitions. [2024-11-09 00:33:16,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-09 00:33:16,129 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:16,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:16,364 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 227 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-09 00:33:16,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:17,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 1815 states and 2139 transitions. [2024-11-09 00:33:17,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2139 transitions. [2024-11-09 00:33:17,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-09 00:33:17,003 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:17,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:17,088 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-09 00:33:19,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:19,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 1850 states and 2182 transitions. [2024-11-09 00:33:19,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 2182 transitions. [2024-11-09 00:33:19,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-09 00:33:19,044 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:19,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:19,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:19,130 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-09 00:33:20,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:20,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2193 states to 1860 states and 2193 transitions. [2024-11-09 00:33:20,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 2193 transitions. [2024-11-09 00:33:20,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-09 00:33:20,092 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:20,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:20,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:20,449 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-09 00:33:21,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:21,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2207 states to 1873 states and 2207 transitions. [2024-11-09 00:33:21,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 2207 transitions. [2024-11-09 00:33:21,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-09 00:33:21,380 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:21,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:21,480 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-09 00:33:23,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:23,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 1907 states and 2244 transitions. [2024-11-09 00:33:23,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 2244 transitions. [2024-11-09 00:33:23,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-09 00:33:23,100 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:23,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:23,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:23,193 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-09 00:33:23,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:23,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2252 states to 1916 states and 2252 transitions. [2024-11-09 00:33:23,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2252 transitions. [2024-11-09 00:33:23,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-09 00:33:23,780 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:23,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:24,598 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-09 00:33:27,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:27,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2355 states to 2009 states and 2355 transitions. [2024-11-09 00:33:27,120 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 2355 transitions. [2024-11-09 00:33:27,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-09 00:33:27,122 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:27,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:27,219 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 00:33:27,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:27,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2369 states to 2022 states and 2369 transitions. [2024-11-09 00:33:27,747 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 2369 transitions. [2024-11-09 00:33:27,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-09 00:33:27,749 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:27,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:27,890 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-09 00:33:28,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:28,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2383 states to 2035 states and 2383 transitions. [2024-11-09 00:33:28,438 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 2383 transitions. [2024-11-09 00:33:28,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-09 00:33:28,440 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:28,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:30,163 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 174 proven. 28 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 00:33:33,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:33,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2419 states to 2063 states and 2419 transitions. [2024-11-09 00:33:33,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2063 states and 2419 transitions. [2024-11-09 00:33:33,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-09 00:33:33,404 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:33,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:33,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:33,815 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 174 proven. 28 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 00:33:35,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:35,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2086 states and 2444 transitions. [2024-11-09 00:33:35,309 INFO L276 IsEmpty]: Start isEmpty. Operand 2086 states and 2444 transitions. [2024-11-09 00:33:35,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-09 00:33:35,311 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:35,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:35,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:35,507 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 243 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-09 00:33:37,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:37,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2454 states to 2089 states and 2454 transitions. [2024-11-09 00:33:37,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2454 transitions. [2024-11-09 00:33:37,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-09 00:33:37,566 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:37,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:37,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:37,730 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 243 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-09 00:33:39,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:39,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2483 states to 2117 states and 2483 transitions. [2024-11-09 00:33:39,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 2483 transitions. [2024-11-09 00:33:39,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-09 00:33:39,114 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:39,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:39,216 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-09 00:33:40,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:40,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2119 states and 2500 transitions. [2024-11-09 00:33:40,776 INFO L276 IsEmpty]: Start isEmpty. Operand 2119 states and 2500 transitions. [2024-11-09 00:33:40,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-09 00:33:40,778 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:40,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:40,875 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-09 00:33:42,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:42,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2529 states to 2147 states and 2529 transitions. [2024-11-09 00:33:42,185 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 2529 transitions. [2024-11-09 00:33:42,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-09 00:33:42,187 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:42,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:42,289 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-09 00:33:43,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:43,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2530 states to 2148 states and 2530 transitions. [2024-11-09 00:33:43,001 INFO L276 IsEmpty]: Start isEmpty. Operand 2148 states and 2530 transitions. [2024-11-09 00:33:43,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-09 00:33:43,003 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:43,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:43,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:43,100 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-09 00:33:43,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:43,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2543 states to 2161 states and 2543 transitions. [2024-11-09 00:33:43,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 2543 transitions. [2024-11-09 00:33:43,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-09 00:33:43,738 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:43,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:43,843 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-09 00:33:45,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:45,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2163 states and 2551 transitions. [2024-11-09 00:33:45,181 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 2551 transitions. [2024-11-09 00:33:45,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-09 00:33:45,183 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:45,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:45,386 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-09 00:33:46,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:46,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2191 states and 2578 transitions. [2024-11-09 00:33:46,658 INFO L276 IsEmpty]: Start isEmpty. Operand 2191 states and 2578 transitions. [2024-11-09 00:33:46,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-09 00:33:46,660 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:46,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:46,772 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-09 00:33:47,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:47,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2591 states to 2204 states and 2591 transitions. [2024-11-09 00:33:47,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2204 states and 2591 transitions. [2024-11-09 00:33:47,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-09 00:33:47,369 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:47,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:47,887 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-09 00:33:49,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:49,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2638 states to 2243 states and 2638 transitions. [2024-11-09 00:33:49,814 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 2638 transitions. [2024-11-09 00:33:49,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-09 00:33:49,817 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:49,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:49,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:50,436 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 188 proven. 145 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 00:33:51,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:51,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2649 states to 2249 states and 2649 transitions. [2024-11-09 00:33:51,580 INFO L276 IsEmpty]: Start isEmpty. Operand 2249 states and 2649 transitions. [2024-11-09 00:33:51,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-09 00:33:51,582 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:51,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:51,934 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-09 00:33:54,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:54,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2284 states and 2692 transitions. [2024-11-09 00:33:54,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 2692 transitions. [2024-11-09 00:33:54,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-09 00:33:54,569 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:54,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:54,785 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 219 proven. 100 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 00:33:56,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:56,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2735 states to 2323 states and 2735 transitions. [2024-11-09 00:33:56,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 2735 transitions. [2024-11-09 00:33:56,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-09 00:33:56,814 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:56,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:57,159 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 219 proven. 100 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 00:33:57,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:57,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2737 states to 2324 states and 2737 transitions. [2024-11-09 00:33:57,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2324 states and 2737 transitions. [2024-11-09 00:33:57,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-09 00:33:57,777 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:57,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:57,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:57,871 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-09 00:33:58,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:58,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2775 states to 2362 states and 2775 transitions. [2024-11-09 00:33:58,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 2775 transitions. [2024-11-09 00:33:58,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-09 00:33:58,817 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:58,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:58,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:59,384 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 106 proven. 160 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-09 00:34:02,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:34:02,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2892 states to 2470 states and 2892 transitions. [2024-11-09 00:34:02,052 INFO L276 IsEmpty]: Start isEmpty. Operand 2470 states and 2892 transitions. [2024-11-09 00:34:02,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-09 00:34:02,055 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:34:02,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:34:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:02,955 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-09 00:34:05,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:34:05,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2940 states to 2508 states and 2940 transitions. [2024-11-09 00:34:05,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2508 states and 2940 transitions. [2024-11-09 00:34:05,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-09 00:34:05,928 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:34:05,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:34:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:06,236 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-09 00:34:07,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:34:07,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2967 states to 2533 states and 2967 transitions. [2024-11-09 00:34:07,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2533 states and 2967 transitions. [2024-11-09 00:34:07,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-09 00:34:07,284 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:34:07,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:34:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:07,785 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-09 00:34:12,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:34:12,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3006 states to 2566 states and 3006 transitions. [2024-11-09 00:34:12,928 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3006 transitions. [2024-11-09 00:34:12,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-09 00:34:12,930 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:34:12,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:34:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:13,392 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-09 00:34:15,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:34:15,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3015 states to 2572 states and 3015 transitions. [2024-11-09 00:34:15,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2572 states and 3015 transitions. [2024-11-09 00:34:15,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-09 00:34:15,688 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:34:15,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:34:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:15,840 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-09 00:34:17,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:34:17,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3051 states to 2597 states and 3051 transitions. [2024-11-09 00:34:17,766 INFO L276 IsEmpty]: Start isEmpty. Operand 2597 states and 3051 transitions. [2024-11-09 00:34:17,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-09 00:34:17,767 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:34:17,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:34:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:17,960 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-09 00:34:18,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:34:18,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3056 states to 2598 states and 3056 transitions. [2024-11-09 00:34:18,705 INFO L276 IsEmpty]: Start isEmpty. Operand 2598 states and 3056 transitions. [2024-11-09 00:34:18,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-09 00:34:18,707 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:34:18,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:34:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:19,102 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-09 00:34:22,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:34:22,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 2662 states and 3128 transitions. [2024-11-09 00:34:22,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2662 states and 3128 transitions. [2024-11-09 00:34:22,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-09 00:34:22,127 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:34:22,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:34:22,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:22,425 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 261 proven. 9 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-09 00:34:25,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:34:25,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3167 states to 2698 states and 3167 transitions. [2024-11-09 00:34:25,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2698 states and 3167 transitions. [2024-11-09 00:34:25,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-09 00:34:25,356 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:34:25,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:34:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:25,456 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 00:34:27,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:34:27,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3205 states to 2732 states and 3205 transitions. [2024-11-09 00:34:27,570 INFO L276 IsEmpty]: Start isEmpty. Operand 2732 states and 3205 transitions. [2024-11-09 00:34:27,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-09 00:34:27,573 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:34:27,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:34:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:27,674 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 00:34:29,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:34:29,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 2747 states and 3234 transitions. [2024-11-09 00:34:29,991 INFO L276 IsEmpty]: Start isEmpty. Operand 2747 states and 3234 transitions. [2024-11-09 00:34:29,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-09 00:34:29,993 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:34:29,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:34:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:30,105 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 00:34:33,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:34:33,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3280 states to 2786 states and 3280 transitions. [2024-11-09 00:34:33,309 INFO L276 IsEmpty]: Start isEmpty. Operand 2786 states and 3280 transitions. [2024-11-09 00:34:33,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-09 00:34:33,310 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:34:33,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:34:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:33,474 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 00:34:34,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:34:34,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3281 states to 2787 states and 3281 transitions. [2024-11-09 00:34:34,199 INFO L276 IsEmpty]: Start isEmpty. Operand 2787 states and 3281 transitions. [2024-11-09 00:34:34,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-09 00:34:34,201 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:34:34,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:34:34,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:34,299 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 00:34:35,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:34:35,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3307 states to 2813 states and 3307 transitions. [2024-11-09 00:34:35,702 INFO L276 IsEmpty]: Start isEmpty. Operand 2813 states and 3307 transitions. [2024-11-09 00:34:35,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-09 00:34:35,704 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:34:35,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:34:35,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:35,835 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 00:34:36,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:34:36,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3306 states to 2813 states and 3306 transitions. [2024-11-09 00:34:36,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2813 states and 3306 transitions. [2024-11-09 00:34:36,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-09 00:34:36,590 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:34:36,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:34:36,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:36,683 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 00:34:37,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:34:37,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3319 states to 2826 states and 3319 transitions. [2024-11-09 00:34:37,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 3319 transitions. [2024-11-09 00:34:37,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-09 00:34:37,704 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:34:37,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:34:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:37,905 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-09 00:34:40,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:34:40,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3338 states to 2841 states and 3338 transitions. [2024-11-09 00:34:40,320 INFO L276 IsEmpty]: Start isEmpty. Operand 2841 states and 3338 transitions. [2024-11-09 00:34:40,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-09 00:34:40,323 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:34:40,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:34:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:40,459 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-09 00:34:41,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:34:41,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3351 states to 2854 states and 3351 transitions. [2024-11-09 00:34:41,407 INFO L276 IsEmpty]: Start isEmpty. Operand 2854 states and 3351 transitions. [2024-11-09 00:34:41,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-09 00:34:41,408 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:34:41,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:34:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:41,532 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-09 00:34:42,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:34:42,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3375 states to 2879 states and 3375 transitions. [2024-11-09 00:34:42,070 INFO L276 IsEmpty]: Start isEmpty. Operand 2879 states and 3375 transitions. [2024-11-09 00:34:42,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-09 00:34:42,072 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:34:42,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:34:42,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:42,171 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-09 00:34:43,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:34:43,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3403 states to 2904 states and 3403 transitions. [2024-11-09 00:34:43,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2904 states and 3403 transitions. [2024-11-09 00:34:43,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-09 00:34:43,433 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:34:43,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:34:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:43,723 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-09 00:34:44,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:34:44,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3425 states to 2927 states and 3425 transitions. [2024-11-09 00:34:44,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2927 states and 3425 transitions. [2024-11-09 00:34:44,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-09 00:34:44,599 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:34:44,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:34:44,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:44,713 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-09 00:34:45,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:34:45,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3429 states to 2928 states and 3429 transitions. [2024-11-09 00:34:45,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 3429 transitions. [2024-11-09 00:34:45,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-09 00:34:45,506 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:34:45,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:34:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:46,008 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-09 00:34:52,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:34:52,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3496 states to 2984 states and 3496 transitions. [2024-11-09 00:34:52,219 INFO L276 IsEmpty]: Start isEmpty. Operand 2984 states and 3496 transitions. [2024-11-09 00:34:52,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-09 00:34:52,222 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:34:52,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:34:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:52,501 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-09 00:34:57,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:34:57,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3554 states to 3036 states and 3554 transitions. [2024-11-09 00:34:57,604 INFO L276 IsEmpty]: Start isEmpty. Operand 3036 states and 3554 transitions. [2024-11-09 00:34:57,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-09 00:34:57,606 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:34:57,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:34:57,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:58,007 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-09 00:35:01,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:01,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3072 states and 3592 transitions. [2024-11-09 00:35:01,875 INFO L276 IsEmpty]: Start isEmpty. Operand 3072 states and 3592 transitions. [2024-11-09 00:35:01,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-09 00:35:01,877 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:01,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:02,468 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-09 00:35:04,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:04,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3605 states to 3084 states and 3605 transitions. [2024-11-09 00:35:04,884 INFO L276 IsEmpty]: Start isEmpty. Operand 3084 states and 3605 transitions. [2024-11-09 00:35:04,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-09 00:35:04,887 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:04,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:05,419 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-09 00:35:06,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:06,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3615 states to 3095 states and 3615 transitions. [2024-11-09 00:35:06,651 INFO L276 IsEmpty]: Start isEmpty. Operand 3095 states and 3615 transitions. [2024-11-09 00:35:06,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-09 00:35:06,653 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:06,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:07,233 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-09 00:35:14,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:14,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3658 states to 3130 states and 3658 transitions. [2024-11-09 00:35:14,338 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 3658 transitions. [2024-11-09 00:35:14,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-09 00:35:14,343 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:14,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:14,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:15,733 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 172 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:35:19,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:19,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3695 states to 3166 states and 3695 transitions. [2024-11-09 00:35:19,471 INFO L276 IsEmpty]: Start isEmpty. Operand 3166 states and 3695 transitions. [2024-11-09 00:35:19,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-09 00:35:19,474 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:19,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:20,576 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-09 00:35:24,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:24,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3761 states to 3224 states and 3761 transitions. [2024-11-09 00:35:24,172 INFO L276 IsEmpty]: Start isEmpty. Operand 3224 states and 3761 transitions. [2024-11-09 00:35:24,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-09 00:35:24,175 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:24,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:24,785 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-09 00:35:25,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:25,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3768 states to 3230 states and 3768 transitions. [2024-11-09 00:35:25,129 INFO L276 IsEmpty]: Start isEmpty. Operand 3230 states and 3768 transitions. [2024-11-09 00:35:25,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-09 00:35:25,134 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:25,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:25,384 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-09 00:35:28,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:28,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3807 states to 3266 states and 3807 transitions. [2024-11-09 00:35:28,308 INFO L276 IsEmpty]: Start isEmpty. Operand 3266 states and 3807 transitions. [2024-11-09 00:35:28,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-11-09 00:35:28,310 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:28,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:28,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:28,414 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2024-11-09 00:35:29,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:29,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3823 states to 3282 states and 3823 transitions. [2024-11-09 00:35:29,510 INFO L276 IsEmpty]: Start isEmpty. Operand 3282 states and 3823 transitions. [2024-11-09 00:35:29,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-09 00:35:29,513 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:29,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:30,161 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-09 00:35:31,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:31,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3833 states to 3291 states and 3833 transitions. [2024-11-09 00:35:31,614 INFO L276 IsEmpty]: Start isEmpty. Operand 3291 states and 3833 transitions. [2024-11-09 00:35:31,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-09 00:35:31,617 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:31,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:32,185 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 179 proven. 107 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-09 00:35:33,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:33,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3845 states to 3303 states and 3845 transitions. [2024-11-09 00:35:33,219 INFO L276 IsEmpty]: Start isEmpty. Operand 3303 states and 3845 transitions. [2024-11-09 00:35:33,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-09 00:35:33,223 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:33,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:33,384 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-09 00:35:35,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:35,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3861 states to 3317 states and 3861 transitions. [2024-11-09 00:35:35,327 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 3861 transitions. [2024-11-09 00:35:35,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-09 00:35:35,330 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:35,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:35,771 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-09 00:35:37,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:37,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3884 states to 3338 states and 3884 transitions. [2024-11-09 00:35:37,745 INFO L276 IsEmpty]: Start isEmpty. Operand 3338 states and 3884 transitions. [2024-11-09 00:35:37,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-09 00:35:37,748 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:37,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:37,885 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-11-09 00:35:39,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:39,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3903 states to 3358 states and 3903 transitions. [2024-11-09 00:35:39,767 INFO L276 IsEmpty]: Start isEmpty. Operand 3358 states and 3903 transitions. [2024-11-09 00:35:39,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-09 00:35:39,771 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:39,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:40,196 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-09 00:35:40,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:40,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3907 states to 3361 states and 3907 transitions. [2024-11-09 00:35:40,531 INFO L276 IsEmpty]: Start isEmpty. Operand 3361 states and 3907 transitions. [2024-11-09 00:35:40,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-09 00:35:40,533 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:40,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:41,311 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-09 00:35:46,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:46,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4048 states to 3488 states and 4048 transitions. [2024-11-09 00:35:46,896 INFO L276 IsEmpty]: Start isEmpty. Operand 3488 states and 4048 transitions. [2024-11-09 00:35:46,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-09 00:35:46,898 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:46,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:46,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:47,616 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 188 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 00:35:51,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:51,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4076 states to 3515 states and 4076 transitions. [2024-11-09 00:35:51,010 INFO L276 IsEmpty]: Start isEmpty. Operand 3515 states and 4076 transitions. [2024-11-09 00:35:51,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-11-09 00:35:51,012 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:51,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:51,588 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 223 proven. 165 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 00:35:55,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:55,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4120 states to 3553 states and 4120 transitions. [2024-11-09 00:35:55,404 INFO L276 IsEmpty]: Start isEmpty. Operand 3553 states and 4120 transitions. [2024-11-09 00:35:55,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-11-09 00:35:55,406 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:55,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:55,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:56,516 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 237 proven. 185 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-09 00:36:03,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:03,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4243 states to 3662 states and 4243 transitions. [2024-11-09 00:36:03,663 INFO L276 IsEmpty]: Start isEmpty. Operand 3662 states and 4243 transitions. [2024-11-09 00:36:03,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-09 00:36:03,669 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:03,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:05,005 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-09 00:36:10,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:10,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4306 states to 3711 states and 4306 transitions. [2024-11-09 00:36:10,273 INFO L276 IsEmpty]: Start isEmpty. Operand 3711 states and 4306 transitions. [2024-11-09 00:36:10,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-09 00:36:10,278 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:10,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:10,953 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-09 00:36:13,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:13,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4329 states to 3730 states and 4329 transitions. [2024-11-09 00:36:13,596 INFO L276 IsEmpty]: Start isEmpty. Operand 3730 states and 4329 transitions. [2024-11-09 00:36:13,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-09 00:36:13,599 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:13,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:14,844 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 200 proven. 180 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-09 00:36:20,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:20,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4436 states to 3826 states and 4436 transitions. [2024-11-09 00:36:20,112 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 4436 transitions. [2024-11-09 00:36:20,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-11-09 00:36:20,115 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:20,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:20,467 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 417 proven. 9 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-09 00:36:25,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:25,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4458 states to 3844 states and 4458 transitions. [2024-11-09 00:36:25,118 INFO L276 IsEmpty]: Start isEmpty. Operand 3844 states and 4458 transitions. [2024-11-09 00:36:25,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-11-09 00:36:25,121 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:25,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:25,300 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 368 proven. 105 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-09 00:36:27,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:27,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4467 states to 3849 states and 4467 transitions. [2024-11-09 00:36:27,184 INFO L276 IsEmpty]: Start isEmpty. Operand 3849 states and 4467 transitions. [2024-11-09 00:36:27,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-09 00:36:27,187 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:27,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:27,357 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-09 00:36:28,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:28,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4493 states to 3875 states and 4493 transitions. [2024-11-09 00:36:28,007 INFO L276 IsEmpty]: Start isEmpty. Operand 3875 states and 4493 transitions. [2024-11-09 00:36:28,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-09 00:36:28,009 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:28,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:29,304 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-09 00:36:39,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:39,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4556 states to 3931 states and 4556 transitions. [2024-11-09 00:36:39,709 INFO L276 IsEmpty]: Start isEmpty. Operand 3931 states and 4556 transitions. [2024-11-09 00:36:39,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 00:36:39,712 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 155 iterations. [2024-11-09 00:36:39,722 INFO L729 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-09 00:37:36,045 INFO L77 FloydHoareUtils]: At program point L102(lines 102 400) the Hoare annotation is: (let ((.cse10 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse6 (= ~a7~0 1)) (.cse8 (= ~a16~0 4)) (.cse0 (<= 15 ~a8~0)) (.cse7 (not .cse9)) (.cse1 (= ~a12~0 8)) (.cse11 (= 14 ~a8~0)) (.cse2 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse5 (= ~a21~0 1)) (.cse3 (= ~a8~0 15))) (or (and .cse0 (not (and .cse1 .cse2 .cse3 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse4 .cse5 .cse8) (and .cse1 (not .cse6) .cse5 .cse9 .cse8) (and .cse10 .cse0) (and (not .cse5) .cse0) (and (not .cse11) (< ~a8~0 15)) (and .cse7 .cse1 .cse11 .cse2 .cse4 .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse3)))) [2024-11-09 00:37:36,046 INFO L77 FloydHoareUtils]: At program point L598(line 598) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse7 (not .cse9)) (.cse4 (not (= ~a17~0 1))) (.cse2 (= ~a12~0 8)) (.cse1 (not .cse6)) (.cse8 (= ~a16~0 4)) (.cse5 (= ~a21~0 1)) (.cse3 (= 5 ~a16~0)) (.cse0 (= ~a8~0 13))) (or (and (not (= 14 ~a8~0)) (not .cse0)) (and .cse1 .cse0) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not .cse2)) (and .cse7 .cse0) (and .cse7 .cse2 .cse4 .cse5 .cse8) (and .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse1 .cse5 .cse9 .cse8) (and (not .cse5) .cse0) (and (not .cse3) .cse0)))) [2024-11-09 00:37:36,046 INFO L77 FloydHoareUtils]: At program point L334(lines 334 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-09 00:37:36,046 INFO L77 FloydHoareUtils]: At program point L302(lines 302 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-09 00:37:36,047 INFO L77 FloydHoareUtils]: At program point L170(lines 170 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse9 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse10 (<= 15 ~a8~0)) (.cse14 (not .cse8)) (.cse2 (= ~a12~0 8)) (.cse11 (= 14 ~a8~0)) (.cse4 (not .cse9)) (.cse7 (not .cse6)) (.cse5 (= ~a21~0 1)) (.cse1 (= ~a16~0 4)) (.cse3 (= 5 ~a16~0)) (.cse0 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse5 .cse8 .cse1) (and .cse9 .cse10) (and (not .cse11) (< ~a8~0 15)) (let ((.cse12 (= ~a20~0 ~a7~0)) (.cse13 (= ~a17~0 ~a7~0))) (and (not (and .cse2 .cse3 .cse5 .cse0 .cse12 .cse13)) (not (and .cse2 .cse5 .cse0 .cse12 .cse13 .cse1)) .cse10)) (and .cse14 .cse2 .cse11 .cse3 .cse4 .cse5) (and .cse14 .cse2 .cse4 .cse5 .cse6 .cse1) (and .cse2 .cse11 .cse4 .cse7 .cse5 .cse1) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse3 .cse0)))) [2024-11-09 00:37:36,047 INFO L77 FloydHoareUtils]: At program point L204(lines 204 400) the Hoare annotation is: (let ((.cse10 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse6 (= ~a7~0 1)) (.cse8 (= ~a16~0 4)) (.cse0 (<= 15 ~a8~0)) (.cse7 (not .cse9)) (.cse1 (= ~a12~0 8)) (.cse11 (= 14 ~a8~0)) (.cse2 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse5 (= ~a21~0 1)) (.cse3 (= ~a8~0 15))) (or (and .cse0 (not (and .cse1 .cse2 .cse3 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse4 .cse5 .cse8) (and .cse1 (not .cse6) .cse5 .cse9 .cse8) (and .cse10 .cse0) (and (not .cse5) .cse0) (and (not .cse11) (< ~a8~0 15)) (and .cse7 .cse1 .cse11 .cse2 .cse4 .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse3)))) [2024-11-09 00:37:36,047 INFO L77 FloydHoareUtils]: At program point L72(lines 72 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse7 (not .cse9)) (.cse4 (not (= ~a17~0 1))) (.cse2 (= ~a12~0 8)) (.cse1 (not .cse6)) (.cse8 (= ~a16~0 4)) (.cse5 (= ~a21~0 1)) (.cse3 (= 5 ~a16~0)) (.cse0 (= ~a8~0 13))) (or (and (not (= 14 ~a8~0)) (not .cse0)) (and .cse1 .cse0) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not .cse2)) (and .cse7 .cse0) (and .cse7 .cse2 .cse4 .cse5 .cse8) (and .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse1 .cse5 .cse9 .cse8) (and (not .cse5) .cse0) (and (not .cse3) .cse0)))) [2024-11-09 00:37:36,048 INFO L77 FloydHoareUtils]: At program point L271(lines 271 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-09 00:37:36,048 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (let ((.cse10 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse6 (= ~a7~0 1)) (.cse8 (= ~a16~0 4)) (.cse0 (<= 15 ~a8~0)) (.cse7 (not .cse9)) (.cse1 (= ~a12~0 8)) (.cse11 (= 14 ~a8~0)) (.cse2 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse5 (= ~a21~0 1)) (.cse3 (= ~a8~0 15))) (or (and .cse0 (not (and .cse1 .cse2 .cse3 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse4 .cse5 .cse8) (and .cse1 (not .cse6) .cse5 .cse9 .cse8) (and .cse10 .cse0) (and (not .cse5) .cse0) (and (not .cse11) (< ~a8~0 15)) (and .cse7 .cse1 .cse11 .cse2 .cse4 .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse3)))) [2024-11-09 00:37:36,048 INFO L77 FloydHoareUtils]: At program point L371(lines 371 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-09 00:37:36,048 INFO L77 FloydHoareUtils]: At program point L107(lines 107 400) the Hoare annotation is: (let ((.cse10 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse6 (= ~a7~0 1)) (.cse8 (= ~a16~0 4)) (.cse0 (<= 15 ~a8~0)) (.cse7 (not .cse9)) (.cse1 (= ~a12~0 8)) (.cse11 (= 14 ~a8~0)) (.cse2 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse5 (= ~a21~0 1)) (.cse3 (= ~a8~0 15))) (or (and .cse0 (not (and .cse1 .cse2 .cse3 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse4 .cse5 .cse8) (and .cse1 (not .cse6) .cse5 .cse9 .cse8) (and .cse10 .cse0) (and (not .cse5) .cse0) (and (not .cse11) (< ~a8~0 15)) (and .cse7 .cse1 .cse11 .cse2 .cse4 .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse3)))) [2024-11-09 00:37:36,049 INFO L77 FloydHoareUtils]: At program point L41(lines 41 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse7 (not .cse9)) (.cse4 (not (= ~a17~0 1))) (.cse2 (= ~a12~0 8)) (.cse1 (not .cse6)) (.cse8 (= ~a16~0 4)) (.cse5 (= ~a21~0 1)) (.cse3 (= 5 ~a16~0)) (.cse0 (= ~a8~0 13))) (or (and (not (= 14 ~a8~0)) (not .cse0)) (and .cse1 .cse0) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not .cse2)) (and .cse7 .cse0) (and .cse7 .cse2 .cse4 .cse5 .cse8) (and .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse1 .cse5 .cse9 .cse8) (and (not .cse5) .cse0) (and (not .cse3) .cse0)))) [2024-11-09 00:37:36,049 INFO L77 FloydHoareUtils]: At program point L339(lines 339 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-09 00:37:36,049 INFO L77 FloydHoareUtils]: At program point L207(lines 207 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-09 00:37:36,050 INFO L77 FloydHoareUtils]: At program point L75(lines 75 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse7 (not .cse9)) (.cse4 (not (= ~a17~0 1))) (.cse2 (= ~a12~0 8)) (.cse1 (not .cse6)) (.cse8 (= ~a16~0 4)) (.cse5 (= ~a21~0 1)) (.cse3 (= 5 ~a16~0)) (.cse0 (= ~a8~0 13))) (or (and (not (= 14 ~a8~0)) (not .cse0)) (and .cse1 .cse0) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not .cse2)) (and .cse7 .cse0) (and .cse7 .cse2 .cse4 .cse5 .cse8) (and .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse1 .cse5 .cse9 .cse8) (and (not .cse5) .cse0) (and (not .cse3) .cse0)))) [2024-11-09 00:37:36,050 INFO L77 FloydHoareUtils]: At program point L373(lines 373 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-09 00:37:36,050 INFO L77 FloydHoareUtils]: At program point L241(lines 241 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-09 00:37:36,050 INFO L77 FloydHoareUtils]: At program point L175(lines 175 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse9 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse10 (<= 15 ~a8~0)) (.cse14 (not .cse8)) (.cse2 (= ~a12~0 8)) (.cse11 (= 14 ~a8~0)) (.cse4 (not .cse9)) (.cse7 (not .cse6)) (.cse5 (= ~a21~0 1)) (.cse1 (= ~a16~0 4)) (.cse3 (= 5 ~a16~0)) (.cse0 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse5 .cse8 .cse1) (and .cse9 .cse10) (and (not .cse11) (< ~a8~0 15)) (let ((.cse12 (= ~a20~0 ~a7~0)) (.cse13 (= ~a17~0 ~a7~0))) (and (not (and .cse2 .cse3 .cse5 .cse0 .cse12 .cse13)) (not (and .cse2 .cse5 .cse0 .cse12 .cse13 .cse1)) .cse10)) (and .cse14 .cse2 .cse11 .cse3 .cse4 .cse5) (and .cse14 .cse2 .cse4 .cse5 .cse6 .cse1) (and .cse2 .cse11 .cse4 .cse7 .cse5 .cse1) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse3 .cse0)))) [2024-11-09 00:37:36,050 INFO L77 FloydHoareUtils]: At program point L275(lines 275 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-09 00:37:36,050 INFO L77 FloydHoareUtils]: At program point L375(lines 375 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-09 00:37:36,051 INFO L77 FloydHoareUtils]: At program point L309(lines 309 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-09 00:37:36,051 INFO L77 FloydHoareUtils]: At program point L45(lines 45 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse7 (not .cse9)) (.cse4 (not (= ~a17~0 1))) (.cse2 (= ~a12~0 8)) (.cse1 (not .cse6)) (.cse8 (= ~a16~0 4)) (.cse5 (= ~a21~0 1)) (.cse3 (= 5 ~a16~0)) (.cse0 (= ~a8~0 13))) (or (and (not (= 14 ~a8~0)) (not .cse0)) (and .cse1 .cse0) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not .cse2)) (and .cse7 .cse0) (and .cse7 .cse2 .cse4 .cse5 .cse8) (and .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse1 .cse5 .cse9 .cse8) (and (not .cse5) .cse0) (and (not .cse3) .cse0)))) [2024-11-09 00:37:36,051 INFO L77 FloydHoareUtils]: At program point L343(lines 343 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-09 00:37:36,051 INFO L77 FloydHoareUtils]: At program point L112(lines 112 400) the Hoare annotation is: (let ((.cse10 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse6 (= ~a7~0 1)) (.cse8 (= ~a16~0 4)) (.cse0 (<= 15 ~a8~0)) (.cse7 (not .cse9)) (.cse1 (= ~a12~0 8)) (.cse11 (= 14 ~a8~0)) (.cse2 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse5 (= ~a21~0 1)) (.cse3 (= ~a8~0 15))) (or (and .cse0 (not (and .cse1 .cse2 .cse3 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse4 .cse5 .cse8) (and .cse1 (not .cse6) .cse5 .cse9 .cse8) (and .cse10 .cse0) (and (not .cse5) .cse0) (and (not .cse11) (< ~a8~0 15)) (and .cse7 .cse1 .cse11 .cse2 .cse4 .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse3)))) [2024-11-09 00:37:36,051 INFO L77 FloydHoareUtils]: At program point L278(lines 278 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-09 00:37:36,051 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (let ((.cse10 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse6 (= ~a7~0 1)) (.cse8 (= ~a16~0 4)) (.cse0 (<= 15 ~a8~0)) (.cse7 (not .cse9)) (.cse1 (= ~a12~0 8)) (.cse11 (= 14 ~a8~0)) (.cse2 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse5 (= ~a21~0 1)) (.cse3 (= ~a8~0 15))) (or (and .cse0 (not (and .cse1 .cse2 .cse3 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse4 .cse5 .cse8) (and .cse1 (not .cse6) .cse5 .cse9 .cse8) (and .cse10 .cse0) (and (not .cse5) .cse0) (and (not .cse11) (< ~a8~0 15)) (and .cse7 .cse1 .cse11 .cse2 .cse4 .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse3)))) [2024-11-09 00:37:36,052 INFO L77 FloydHoareUtils]: At program point L213(lines 213 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-09 00:37:36,052 INFO L77 FloydHoareUtils]: At program point L82(lines 82 400) the Hoare annotation is: (let ((.cse5 (= ~a21~0 1)) (.cse9 (= ~a20~0 1)) (.cse6 (= ~a7~0 1))) (let ((.cse0 (not .cse6)) (.cse8 (= ~a16~0 4)) (.cse11 (<= 15 ~a8~0)) (.cse7 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse4 (not (= ~a17~0 1))) (.cse13 (= 14 ~a8~0)) (.cse10 (= ~a8~0 15)) (.cse12 (not .cse5)) (.cse3 (= 5 ~a16~0)) (.cse1 (= ~a8~0 13))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (not .cse2)) (and .cse7 .cse1) (and .cse7 .cse2 .cse4 .cse5 .cse8) (and .cse2 .cse0 .cse5 .cse9 .cse8) (and (not (and .cse2 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse11) (and .cse12 .cse11) (and (<= ~a16~0 4) .cse11) (and (not (and .cse7 (<= ~a16~0 5))) .cse11) (and .cse7 .cse2 .cse13 .cse3 .cse4 .cse5) (and (not .cse13) (not .cse1) (< ~a8~0 15)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and .cse12 .cse1) (and (not .cse3) .cse1)))) [2024-11-09 00:37:36,052 INFO L77 FloydHoareUtils]: At program point L347(lines 347 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-09 00:37:36,053 INFO L77 FloydHoareUtils]: At program point L248(lines 248 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-09 00:37:36,053 INFO L77 FloydHoareUtils]: At program point L183(lines 183 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse9 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse10 (<= 15 ~a8~0)) (.cse14 (not .cse8)) (.cse2 (= ~a12~0 8)) (.cse11 (= 14 ~a8~0)) (.cse4 (not .cse9)) (.cse7 (not .cse6)) (.cse5 (= ~a21~0 1)) (.cse1 (= ~a16~0 4)) (.cse3 (= 5 ~a16~0)) (.cse0 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse5 .cse8 .cse1) (and .cse9 .cse10) (and (not .cse11) (< ~a8~0 15)) (let ((.cse12 (= ~a20~0 ~a7~0)) (.cse13 (= ~a17~0 ~a7~0))) (and (not (and .cse2 .cse3 .cse5 .cse0 .cse12 .cse13)) (not (and .cse2 .cse5 .cse0 .cse12 .cse13 .cse1)) .cse10)) (and .cse14 .cse2 .cse11 .cse3 .cse4 .cse5) (and .cse14 .cse2 .cse4 .cse5 .cse6 .cse1) (and .cse2 .cse11 .cse4 .cse7 .cse5 .cse1) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse3 .cse0)))) [2024-11-09 00:37:36,053 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (let ((.cse10 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse6 (= ~a7~0 1)) (.cse8 (= ~a16~0 4)) (.cse0 (<= 15 ~a8~0)) (.cse7 (not .cse9)) (.cse1 (= ~a12~0 8)) (.cse11 (= 14 ~a8~0)) (.cse2 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse5 (= ~a21~0 1)) (.cse3 (= ~a8~0 15))) (or (and .cse0 (not (and .cse1 .cse2 .cse3 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse4 .cse5 .cse8) (and .cse1 (not .cse6) .cse5 .cse9 .cse8) (and .cse10 .cse0) (and (not .cse5) .cse0) (and (not .cse11) (< ~a8~0 15)) (and .cse7 .cse1 .cse11 .cse2 .cse4 .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse3)))) [2024-11-09 00:37:36,054 INFO L77 FloydHoareUtils]: At program point L382(lines 382 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-09 00:37:36,056 INFO L77 FloydHoareUtils]: At program point L316(lines 316 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-09 00:37:36,056 INFO L77 FloydHoareUtils]: At program point L283(lines 283 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-09 00:37:36,057 INFO L77 FloydHoareUtils]: At program point L118(lines 118 400) the Hoare annotation is: (let ((.cse10 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse6 (= ~a7~0 1)) (.cse8 (= ~a16~0 4)) (.cse0 (<= 15 ~a8~0)) (.cse7 (not .cse9)) (.cse1 (= ~a12~0 8)) (.cse11 (= 14 ~a8~0)) (.cse2 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse5 (= ~a21~0 1)) (.cse3 (= ~a8~0 15))) (or (and .cse0 (not (and .cse1 .cse2 .cse3 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse4 .cse5 .cse8) (and .cse1 (not .cse6) .cse5 .cse9 .cse8) (and .cse10 .cse0) (and (not .cse5) .cse0) (and (not .cse11) (< ~a8~0 15)) (and .cse7 .cse1 .cse11 .cse2 .cse4 .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse3)))) [2024-11-09 00:37:36,057 INFO L77 FloydHoareUtils]: At program point L482-1(lines 40 585) the Hoare annotation is: (not (= 14 ~a8~0)) [2024-11-09 00:37:36,057 INFO L77 FloydHoareUtils]: At program point L218(lines 218 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-09 00:37:36,057 INFO L77 FloydHoareUtils]: At program point L53(lines 53 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse7 (not .cse9)) (.cse4 (not (= ~a17~0 1))) (.cse2 (= ~a12~0 8)) (.cse1 (not .cse6)) (.cse8 (= ~a16~0 4)) (.cse5 (= ~a21~0 1)) (.cse3 (= 5 ~a16~0)) (.cse0 (= ~a8~0 13))) (or (and (not (= 14 ~a8~0)) (not .cse0)) (and .cse1 .cse0) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not .cse2)) (and .cse7 .cse0) (and .cse7 .cse2 .cse4 .cse5 .cse8) (and .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse1 .cse5 .cse9 .cse8) (and (not .cse5) .cse0) (and (not .cse3) .cse0)))) [2024-11-09 00:37:36,057 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (let ((.cse10 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse6 (= ~a7~0 1)) (.cse8 (= ~a16~0 4)) (.cse0 (<= 15 ~a8~0)) (.cse7 (not .cse9)) (.cse1 (= ~a12~0 8)) (.cse11 (= 14 ~a8~0)) (.cse2 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse5 (= ~a21~0 1)) (.cse3 (= ~a8~0 15))) (or (and .cse0 (not (and .cse1 .cse2 .cse3 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse4 .cse5 .cse8) (and .cse1 (not .cse6) .cse5 .cse9 .cse8) (and .cse10 .cse0) (and (not .cse5) .cse0) (and (not .cse11) (< ~a8~0 15)) (and .cse7 .cse1 .cse11 .cse2 .cse4 .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse3)))) [2024-11-09 00:37:36,058 INFO L77 FloydHoareUtils]: At program point L485-1(lines 40 585) the Hoare annotation is: (not (let ((.cse1 (= 5 ~a16~0)) (.cse4 (= ~a17~0 1)) (.cse0 (= ~a12~0 8)) (.cse2 (not (= ~a7~0 1))) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a20~0 1))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~a20~0 ~a7~0))) (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (= 14 ~a8~0) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse5 (= ~a17~0 ~a7~0)))))) [2024-11-09 00:37:36,058 INFO L77 FloydHoareUtils]: At program point L188(lines 188 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse9 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse10 (<= 15 ~a8~0)) (.cse14 (not .cse8)) (.cse2 (= ~a12~0 8)) (.cse11 (= 14 ~a8~0)) (.cse4 (not .cse9)) (.cse7 (not .cse6)) (.cse5 (= ~a21~0 1)) (.cse1 (= ~a16~0 4)) (.cse3 (= 5 ~a16~0)) (.cse0 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse5 .cse8 .cse1) (and .cse9 .cse10) (and (not .cse11) (< ~a8~0 15)) (let ((.cse12 (= ~a20~0 ~a7~0)) (.cse13 (= ~a17~0 ~a7~0))) (and (not (and .cse2 .cse3 .cse5 .cse0 .cse12 .cse13)) (not (and .cse2 .cse5 .cse0 .cse12 .cse13 .cse1)) .cse10)) (and .cse14 .cse2 .cse11 .cse3 .cse4 .cse5) (and .cse14 .cse2 .cse4 .cse5 .cse6 .cse1) (and .cse2 .cse11 .cse4 .cse7 .cse5 .cse1) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse3 .cse0)))) [2024-11-09 00:37:36,058 INFO L75 FloydHoareUtils]: For program point L486(line 486) no Hoare annotation was computed. [2024-11-09 00:37:36,058 INFO L77 FloydHoareUtils]: At program point L387(lines 387 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-09 00:37:36,059 INFO L77 FloydHoareUtils]: At program point L288(lines 288 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-09 00:37:36,059 INFO L77 FloydHoareUtils]: At program point L255(lines 255 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-09 00:37:36,059 INFO L77 FloydHoareUtils]: At program point L90(lines 90 400) the Hoare annotation is: (let ((.cse5 (= ~a21~0 1)) (.cse9 (= ~a20~0 1)) (.cse6 (= ~a7~0 1))) (let ((.cse0 (not .cse6)) (.cse8 (= ~a16~0 4)) (.cse11 (<= 15 ~a8~0)) (.cse7 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse4 (not (= ~a17~0 1))) (.cse13 (= 14 ~a8~0)) (.cse10 (= ~a8~0 15)) (.cse12 (not .cse5)) (.cse3 (= 5 ~a16~0)) (.cse1 (= ~a8~0 13))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (not .cse2)) (and .cse7 .cse1) (and .cse7 .cse2 .cse4 .cse5 .cse8) (and .cse2 .cse0 .cse5 .cse9 .cse8) (and (not (and .cse2 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse11) (and .cse12 .cse11) (and (<= ~a16~0 4) .cse11) (and (not (and .cse7 (<= ~a16~0 5))) .cse11) (and .cse7 .cse2 .cse13 .cse3 .cse4 .cse5) (and (not .cse13) (not .cse1) (< ~a8~0 15)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and .cse12 .cse1) (and (not .cse3) .cse1)))) [2024-11-09 00:37:36,059 INFO L77 FloydHoareUtils]: At program point L355(lines 355 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-09 00:37:36,060 INFO L77 FloydHoareUtils]: At program point L322(lines 322 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-09 00:37:36,060 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-09 00:37:36,060 INFO L77 FloydHoareUtils]: At program point L124(lines 124 400) the Hoare annotation is: (let ((.cse10 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse6 (= ~a7~0 1)) (.cse8 (= ~a16~0 4)) (.cse0 (<= 15 ~a8~0)) (.cse7 (not .cse9)) (.cse1 (= ~a12~0 8)) (.cse11 (= 14 ~a8~0)) (.cse2 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse5 (= ~a21~0 1)) (.cse3 (= ~a8~0 15))) (or (and .cse0 (not (and .cse1 .cse2 .cse3 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse4 .cse5 .cse8) (and .cse1 (not .cse6) .cse5 .cse9 .cse8) (and .cse10 .cse0) (and (not .cse5) .cse0) (and (not .cse11) (< ~a8~0 15)) (and .cse7 .cse1 .cse11 .cse2 .cse4 .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse3)))) [2024-11-09 00:37:36,060 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-11-09 00:37:36,060 INFO L77 FloydHoareUtils]: At program point L224(lines 224 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-09 00:37:36,060 INFO L77 FloydHoareUtils]: At program point L158(lines 158 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse9 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse10 (<= 15 ~a8~0)) (.cse14 (not .cse8)) (.cse2 (= ~a12~0 8)) (.cse11 (= 14 ~a8~0)) (.cse4 (not .cse9)) (.cse7 (not .cse6)) (.cse5 (= ~a21~0 1)) (.cse1 (= ~a16~0 4)) (.cse3 (= 5 ~a16~0)) (.cse0 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse5 .cse8 .cse1) (and .cse9 .cse10) (and (not .cse11) (< ~a8~0 15)) (let ((.cse12 (= ~a20~0 ~a7~0)) (.cse13 (= ~a17~0 ~a7~0))) (and (not (and .cse2 .cse3 .cse5 .cse0 .cse12 .cse13)) (not (and .cse2 .cse5 .cse0 .cse12 .cse13 .cse1)) .cse10)) (and .cse14 .cse2 .cse11 .cse3 .cse4 .cse5) (and .cse14 .cse2 .cse4 .cse5 .cse6 .cse1) (and .cse2 .cse11 .cse4 .cse7 .cse5 .cse1) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse3 .cse0)))) [2024-11-09 00:37:36,061 INFO L77 FloydHoareUtils]: At program point L59(lines 59 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse7 (not .cse9)) (.cse4 (not (= ~a17~0 1))) (.cse2 (= ~a12~0 8)) (.cse1 (not .cse6)) (.cse8 (= ~a16~0 4)) (.cse5 (= ~a21~0 1)) (.cse3 (= 5 ~a16~0)) (.cse0 (= ~a8~0 13))) (or (and (not (= 14 ~a8~0)) (not .cse0)) (and .cse1 .cse0) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not .cse2)) (and .cse7 .cse0) (and .cse7 .cse2 .cse4 .cse5 .cse8) (and .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse1 .cse5 .cse9 .cse8) (and (not .cse5) .cse0) (and (not .cse3) .cse0)))) [2024-11-09 00:37:36,061 INFO L77 FloydHoareUtils]: At program point L94(lines 94 400) the Hoare annotation is: (let ((.cse5 (= ~a21~0 1)) (.cse9 (= ~a20~0 1)) (.cse6 (= ~a7~0 1))) (let ((.cse0 (not .cse6)) (.cse8 (= ~a16~0 4)) (.cse11 (<= 15 ~a8~0)) (.cse7 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse4 (not (= ~a17~0 1))) (.cse13 (= 14 ~a8~0)) (.cse10 (= ~a8~0 15)) (.cse12 (not .cse5)) (.cse3 (= 5 ~a16~0)) (.cse1 (= ~a8~0 13))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (not .cse2)) (and .cse7 .cse1) (and .cse7 .cse2 .cse4 .cse5 .cse8) (and .cse2 .cse0 .cse5 .cse9 .cse8) (and (not (and .cse2 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse11) (and .cse12 .cse11) (and (<= ~a16~0 4) .cse11) (and (not (and .cse7 (<= ~a16~0 5))) .cse11) (and .cse7 .cse2 .cse13 .cse3 .cse4 .cse5) (and (not .cse13) (not .cse1) (< ~a8~0 15)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and .cse12 .cse1) (and (not .cse3) .cse1)))) [2024-11-09 00:37:36,061 INFO L77 FloydHoareUtils]: At program point L392(lines 392 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-09 00:37:36,061 INFO L77 FloydHoareUtils]: At program point L326(lines 326 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-09 00:37:36,061 INFO L77 FloydHoareUtils]: At program point L260(lines 260 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-09 00:37:36,061 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-09 00:37:36,062 INFO L77 FloydHoareUtils]: At program point L228(lines 228 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-09 00:37:36,062 INFO L77 FloydHoareUtils]: At program point L162(lines 162 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse9 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse10 (<= 15 ~a8~0)) (.cse14 (not .cse8)) (.cse2 (= ~a12~0 8)) (.cse11 (= 14 ~a8~0)) (.cse4 (not .cse9)) (.cse7 (not .cse6)) (.cse5 (= ~a21~0 1)) (.cse1 (= ~a16~0 4)) (.cse3 (= 5 ~a16~0)) (.cse0 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse5 .cse8 .cse1) (and .cse9 .cse10) (and (not .cse11) (< ~a8~0 15)) (let ((.cse12 (= ~a20~0 ~a7~0)) (.cse13 (= ~a17~0 ~a7~0))) (and (not (and .cse2 .cse3 .cse5 .cse0 .cse12 .cse13)) (not (and .cse2 .cse5 .cse0 .cse12 .cse13 .cse1)) .cse10)) (and .cse14 .cse2 .cse11 .cse3 .cse4 .cse5) (and .cse14 .cse2 .cse4 .cse5 .cse6 .cse1) (and .cse2 .cse11 .cse4 .cse7 .cse5 .cse1) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse3 .cse0)))) [2024-11-09 00:37:36,062 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (let ((.cse10 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse6 (= ~a7~0 1)) (.cse8 (= ~a16~0 4)) (.cse0 (<= 15 ~a8~0)) (.cse7 (not .cse9)) (.cse1 (= ~a12~0 8)) (.cse11 (= 14 ~a8~0)) (.cse2 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse5 (= ~a21~0 1)) (.cse3 (= ~a8~0 15))) (or (and .cse0 (not (and .cse1 .cse2 .cse3 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse4 .cse5 .cse8) (and .cse1 (not .cse6) .cse5 .cse9 .cse8) (and .cse10 .cse0) (and (not .cse5) .cse0) (and (not .cse11) (< ~a8~0 15)) (and .cse7 .cse1 .cse11 .cse2 .cse4 .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse3)))) [2024-11-09 00:37:36,062 INFO L77 FloydHoareUtils]: At program point L328(lines 328 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-09 00:37:36,062 INFO L77 FloydHoareUtils]: At program point L196(lines 196 400) the Hoare annotation is: (let ((.cse10 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse6 (= ~a7~0 1)) (.cse8 (= ~a16~0 4)) (.cse0 (<= 15 ~a8~0)) (.cse7 (not .cse9)) (.cse1 (= ~a12~0 8)) (.cse11 (= 14 ~a8~0)) (.cse2 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse5 (= ~a21~0 1)) (.cse3 (= ~a8~0 15))) (or (and .cse0 (not (and .cse1 .cse2 .cse3 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse4 .cse5 .cse8) (and .cse1 (not .cse6) .cse5 .cse9 .cse8) (and .cse10 .cse0) (and (not .cse5) .cse0) (and (not .cse11) (< ~a8~0 15)) (and .cse7 .cse1 .cse11 .cse2 .cse4 .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse3)))) [2024-11-09 00:37:36,063 INFO L77 FloydHoareUtils]: At program point L64(lines 64 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse7 (not .cse9)) (.cse4 (not (= ~a17~0 1))) (.cse2 (= ~a12~0 8)) (.cse1 (not .cse6)) (.cse8 (= ~a16~0 4)) (.cse5 (= ~a21~0 1)) (.cse3 (= 5 ~a16~0)) (.cse0 (= ~a8~0 13))) (or (and (not (= 14 ~a8~0)) (not .cse0)) (and .cse1 .cse0) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not .cse2)) (and .cse7 .cse0) (and .cse7 .cse2 .cse4 .cse5 .cse8) (and .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse1 .cse5 .cse9 .cse8) (and (not .cse5) .cse0) (and (not .cse3) .cse0)))) [2024-11-09 00:37:36,063 INFO L77 FloydHoareUtils]: At program point L593-2(lines 593 603) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse7 (not .cse9)) (.cse4 (not (= ~a17~0 1))) (.cse2 (= ~a12~0 8)) (.cse1 (not .cse6)) (.cse8 (= ~a16~0 4)) (.cse5 (= ~a21~0 1)) (.cse3 (= 5 ~a16~0)) (.cse0 (= ~a8~0 13))) (or (and (not (= 14 ~a8~0)) (not .cse0)) (and .cse1 .cse0) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not .cse2)) (and .cse7 .cse0) (and .cse7 .cse2 .cse4 .cse5 .cse8) (and .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse1 .cse5 .cse9 .cse8) (and (not .cse5) .cse0) (and (not .cse3) .cse0)))) [2024-11-09 00:37:36,063 INFO L77 FloydHoareUtils]: At program point L296(lines 296 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-09 00:37:36,063 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 40 585) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse7 (not .cse9)) (.cse4 (not (= ~a17~0 1))) (.cse2 (= ~a12~0 8)) (.cse1 (not .cse6)) (.cse8 (= ~a16~0 4)) (.cse5 (= ~a21~0 1)) (.cse3 (= 5 ~a16~0)) (.cse0 (= ~a8~0 13))) (or (and (not (= 14 ~a8~0)) (not .cse0)) (and .cse1 .cse0) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not .cse2)) (and .cse7 .cse0) (and .cse7 .cse2 .cse4 .cse5 .cse8) (and .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse1 .cse5 .cse9 .cse8) (and (not .cse5) .cse0) (and (not .cse3) .cse0)))) [2024-11-09 00:37:36,063 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 486) no Hoare annotation was computed. [2024-11-09 00:37:36,063 INFO L77 FloydHoareUtils]: At program point L363(lines 363 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-09 00:37:36,064 INFO L77 FloydHoareUtils]: At program point L199(lines 199 400) the Hoare annotation is: (let ((.cse10 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse6 (= ~a7~0 1)) (.cse8 (= ~a16~0 4)) (.cse0 (<= 15 ~a8~0)) (.cse7 (not .cse9)) (.cse1 (= ~a12~0 8)) (.cse11 (= 14 ~a8~0)) (.cse2 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse5 (= ~a21~0 1)) (.cse3 (= ~a8~0 15))) (or (and .cse0 (not (and .cse1 .cse2 .cse3 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse4 .cse5 .cse8) (and .cse1 (not .cse6) .cse5 .cse9 .cse8) (and .cse10 .cse0) (and (not .cse5) .cse0) (and (not .cse11) (< ~a8~0 15)) (and .cse7 .cse1 .cse11 .cse2 .cse4 .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse3)))) [2024-11-09 00:37:36,064 INFO L77 FloydHoareUtils]: At program point L365(lines 365 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-09 00:37:36,064 INFO L77 FloydHoareUtils]: At program point L266(lines 266 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-09 00:37:36,064 INFO L77 FloydHoareUtils]: At program point L233(lines 233 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-09 00:37:36,064 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (let ((.cse10 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse6 (= ~a7~0 1)) (.cse8 (= ~a16~0 4)) (.cse0 (<= 15 ~a8~0)) (.cse7 (not .cse9)) (.cse1 (= ~a12~0 8)) (.cse11 (= 14 ~a8~0)) (.cse2 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse5 (= ~a21~0 1)) (.cse3 (= ~a8~0 15))) (or (and .cse0 (not (and .cse1 .cse2 .cse3 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse4 .cse5 .cse8) (and .cse1 (not .cse6) .cse5 .cse9 .cse8) (and .cse10 .cse0) (and (not .cse5) .cse0) (and (not .cse11) (< ~a8~0 15)) (and .cse7 .cse1 .cse11 .cse2 .cse4 .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse3)))) [2024-11-09 00:37:36,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.11 12:37:36 ImpRootNode [2024-11-09 00:37:36,083 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-09 00:37:36,083 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:37:36,083 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:37:36,084 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:37:36,084 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:31:51" (3/4) ... [2024-11-09 00:37:36,090 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 00:37:36,108 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 120 nodes and edges [2024-11-09 00:37:36,109 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-09 00:37:36,110 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 00:37:36,111 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 00:37:36,337 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e818af30-32cc-42ec-a81d-079530d771cb/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-09 00:37:36,339 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e818af30-32cc-42ec-a81d-079530d771cb/bin/ukojak-verify-ImItNfHLgk/witness.yml [2024-11-09 00:37:36,339 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:37:36,340 INFO L158 Benchmark]: Toolchain (without parser) took 347246.12ms. Allocated memory was 132.1MB in the beginning and 5.4GB in the end (delta: 5.2GB). Free memory was 93.1MB in the beginning and 5.0GB in the end (delta: -4.9GB). Peak memory consumption was 318.6MB. Max. memory is 16.1GB. [2024-11-09 00:37:36,340 INFO L158 Benchmark]: CDTParser took 1.27ms. Allocated memory is still 132.1MB. Free memory is still 77.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:37:36,341 INFO L158 Benchmark]: CACSL2BoogieTranslator took 686.97ms. Allocated memory is still 132.1MB. Free memory was 93.1MB in the beginning and 63.3MB in the end (delta: 29.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-09 00:37:36,341 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.00ms. Allocated memory is still 132.1MB. Free memory was 63.1MB in the beginning and 57.2MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 00:37:36,341 INFO L158 Benchmark]: Boogie Preprocessor took 58.13ms. Allocated memory is still 132.1MB. Free memory was 57.2MB in the beginning and 52.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:37:36,342 INFO L158 Benchmark]: RCFGBuilder took 1710.16ms. Allocated memory was 132.1MB in the beginning and 184.5MB in the end (delta: 52.4MB). Free memory was 52.6MB in the beginning and 82.1MB in the end (delta: -29.5MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2024-11-09 00:37:36,342 INFO L158 Benchmark]: CodeCheck took 344446.86ms. Allocated memory was 184.5MB in the beginning and 5.4GB in the end (delta: 5.2GB). Free memory was 82.1MB in the beginning and 5.0GB in the end (delta: -5.0GB). Peak memory consumption was 240.2MB. Max. memory is 16.1GB. [2024-11-09 00:37:36,343 INFO L158 Benchmark]: Witness Printer took 256.09ms. Allocated memory is still 5.4GB. Free memory was 5.0GB in the beginning and 5.0GB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 00:37:36,344 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: 288.0s, OverallIterations: 155, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 564975 SdHoareTripleChecker+Valid, 1563.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 562503 mSDsluCounter, 79409 SdHoareTripleChecker+Invalid, 1345.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 67768 mSDsCounter, 97995 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1183013 IncrementalHoareTripleChecker+Invalid, 1281008 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97995 mSolverCounterUnsat, 11641 mSDtfsCounter, 1183013 mSolverCounterSat, 13.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 198774 GetRequests, 190118 SyntacticMatches, 7248 SemanticMatches, 1408 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300814 ImplicationChecksByTransitivity, 202.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 1.3s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 46.4s InterpolantComputationTime, 29639 NumberOfCodeBlocks, 29639 NumberOfCodeBlocksAsserted, 154 NumberOfCheckSat, 29485 ConstructedInterpolants, 0 QuantifiedInterpolants, 160868 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 154 InterpolantComputations, 74 PerfectInterpolantSequences, 28582/34269 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: 486]: 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: (((((((((((14 != a8) && (a8 != 13)) || ((a7 != 1) && (a8 == 13))) || (((((a12 == 8) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a7 == 1))) || ((a8 == 13) && (a12 != 8))) || ((a20 != 1) && (a8 == 13))) || (((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) || (((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) || (((((a12 == 8) && (a7 != 1)) && (a21 == 1)) && (a20 == 1)) && (a16 == 4))) || ((a21 != 1) && (a8 == 13))) || ((5 != a16) && (a8 == 13))) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: (((((((((((14 != a8) && (a8 != 13)) || ((a7 != 1) && (a8 == 13))) || (((((a12 == 8) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a7 == 1))) || ((a8 == 13) && (a12 != 8))) || ((a20 != 1) && (a8 == 13))) || (((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) || (((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) || (((((a12 == 8) && (a7 != 1)) && (a21 == 1)) && (a20 == 1)) && (a16 == 4))) || ((a21 != 1) && (a8 == 13))) || ((5 != a16) && (a8 == 13))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.27ms. Allocated memory is still 132.1MB. Free memory is still 77.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 686.97ms. Allocated memory is still 132.1MB. Free memory was 93.1MB in the beginning and 63.3MB in the end (delta: 29.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.00ms. Allocated memory is still 132.1MB. Free memory was 63.1MB in the beginning and 57.2MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.13ms. Allocated memory is still 132.1MB. Free memory was 57.2MB in the beginning and 52.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1710.16ms. Allocated memory was 132.1MB in the beginning and 184.5MB in the end (delta: 52.4MB). Free memory was 52.6MB in the beginning and 82.1MB in the end (delta: -29.5MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. * CodeCheck took 344446.86ms. Allocated memory was 184.5MB in the beginning and 5.4GB in the end (delta: 5.2GB). Free memory was 82.1MB in the beginning and 5.0GB in the end (delta: -5.0GB). Peak memory consumption was 240.2MB. Max. memory is 16.1GB. * Witness Printer took 256.09ms. Allocated memory is still 5.4GB. Free memory was 5.0GB in the beginning and 5.0GB 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-09 00:37:36,383 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e818af30-32cc-42ec-a81d-079530d771cb/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE