./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label37.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5209a888-98a3-4322-85f7-87e176e31380/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5209a888-98a3-4322-85f7-87e176e31380/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5209a888-98a3-4322-85f7-87e176e31380/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5209a888-98a3-4322-85f7-87e176e31380/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label37.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5209a888-98a3-4322-85f7-87e176e31380/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5209a888-98a3-4322-85f7-87e176e31380/bin/ukojak-verify-EEHR8qb7sm --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 889703d30f71ddcf9dd164cd63c57e33725418944081edb29f7e0df12e48cb88 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 20:48:17,418 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 20:48:17,514 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5209a888-98a3-4322-85f7-87e176e31380/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 20:48:17,522 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 20:48:17,522 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 20:48:17,551 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 20:48:17,552 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 20:48:17,552 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 20:48:17,554 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 20:48:17,554 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 20:48:17,554 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 20:48:17,555 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 20:48:17,555 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 20:48:17,555 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 20:48:17,556 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 20:48:17,556 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 20:48:17,556 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 20:48:17,556 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 20:48:17,556 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 20:48:17,556 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 20:48:17,556 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 20:48:17,557 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 20:48:17,557 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 20:48:17,557 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 20:48:17,557 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 20:48:17,558 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 20:48:17,558 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 20:48:17,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 20:48:17,558 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 20:48:17,558 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 20:48:17,558 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 20:48:17,558 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 20:48:17,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 20:48:17,558 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5209a888-98a3-4322-85f7-87e176e31380/bin/ukojak-verify-EEHR8qb7sm 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 -> 889703d30f71ddcf9dd164cd63c57e33725418944081edb29f7e0df12e48cb88 [2024-11-13 20:48:17,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 20:48:17,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 20:48:17,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 20:48:17,886 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 20:48:17,886 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 20:48:17,888 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5209a888-98a3-4322-85f7-87e176e31380/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/eca-rers2012/Problem01_label37.c Unable to find full path for "g++" [2024-11-13 20:48:19,950 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 20:48:20,367 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 20:48:20,367 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5209a888-98a3-4322-85f7-87e176e31380/sv-benchmarks/c/eca-rers2012/Problem01_label37.c [2024-11-13 20:48:20,384 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5209a888-98a3-4322-85f7-87e176e31380/bin/ukojak-verify-EEHR8qb7sm/data/d322260fa/6a9c379c5a464998a27b12c4d0ad1333/FLAG3324e2d11 [2024-11-13 20:48:20,407 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5209a888-98a3-4322-85f7-87e176e31380/bin/ukojak-verify-EEHR8qb7sm/data/d322260fa/6a9c379c5a464998a27b12c4d0ad1333 [2024-11-13 20:48:20,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 20:48:20,412 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 20:48:20,415 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 20:48:20,416 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 20:48:20,420 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 20:48:20,421 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 08:48:20" (1/1) ... [2024-11-13 20:48:20,423 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@451ebd27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:48:20, skipping insertion in model container [2024-11-13 20:48:20,423 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 08:48:20" (1/1) ... [2024-11-13 20:48:20,469 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 20:48:20,805 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_5209a888-98a3-4322-85f7-87e176e31380/sv-benchmarks/c/eca-rers2012/Problem01_label37.c[14876,14889] [2024-11-13 20:48:20,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 20:48:20,871 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 20:48:20,952 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_5209a888-98a3-4322-85f7-87e176e31380/sv-benchmarks/c/eca-rers2012/Problem01_label37.c[14876,14889] [2024-11-13 20:48:20,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 20:48:21,000 INFO L204 MainTranslator]: Completed translation [2024-11-13 20:48:21,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:48:21 WrapperNode [2024-11-13 20:48:21,001 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 20:48:21,002 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 20:48:21,002 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 20:48:21,003 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 20:48:21,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:48:21" (1/1) ... [2024-11-13 20:48:21,034 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:48:21" (1/1) ... [2024-11-13 20:48:21,094 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-13 20:48:21,098 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 20:48:21,099 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 20:48:21,099 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 20:48:21,099 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 20:48:21,112 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:48:21" (1/1) ... [2024-11-13 20:48:21,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:48:21" (1/1) ... [2024-11-13 20:48:21,121 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:48:21" (1/1) ... [2024-11-13 20:48:21,122 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:48:21" (1/1) ... [2024-11-13 20:48:21,155 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:48:21" (1/1) ... [2024-11-13 20:48:21,169 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:48:21" (1/1) ... [2024-11-13 20:48:21,172 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:48:21" (1/1) ... [2024-11-13 20:48:21,175 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:48:21" (1/1) ... [2024-11-13 20:48:21,180 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 20:48:21,181 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 20:48:21,181 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 20:48:21,181 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 20:48:21,182 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:48:21" (1/1) ... [2024-11-13 20:48:21,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 20:48:21,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5209a888-98a3-4322-85f7-87e176e31380/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 20:48:21,223 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5209a888-98a3-4322-85f7-87e176e31380/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 20:48:21,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5209a888-98a3-4322-85f7-87e176e31380/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 20:48:21,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 20:48:21,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 20:48:21,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 20:48:21,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 20:48:21,346 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 20:48:21,349 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 20:48:22,791 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-13 20:48:22,792 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 20:48:23,065 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 20:48:23,067 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 20:48:23,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:48:23 BoogieIcfgContainer [2024-11-13 20:48:23,068 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 20:48:23,068 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 20:48:23,069 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 20:48:23,091 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 20:48:23,091 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:48:23" (1/1) ... [2024-11-13 20:48:23,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 20:48:23,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:23,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-13 20:48:23,165 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-13 20:48:23,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 20:48:23,169 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:23,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:23,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:23,823 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-13 20:48:24,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:24,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 145 states and 243 transitions. [2024-11-13 20:48:24,504 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 243 transitions. [2024-11-13 20:48:24,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 20:48:24,508 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:24,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:24,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:48:25,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:25,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 218 states and 323 transitions. [2024-11-13 20:48:25,820 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 323 transitions. [2024-11-13 20:48:25,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-13 20:48:25,824 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:25,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:26,108 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-13 20:48:26,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:26,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 219 states and 326 transitions. [2024-11-13 20:48:26,455 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 326 transitions. [2024-11-13 20:48:26,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-13 20:48:26,457 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:26,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:26,733 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-13 20:48:27,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:27,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 229 states and 341 transitions. [2024-11-13 20:48:27,050 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 341 transitions. [2024-11-13 20:48:27,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-13 20:48:27,053 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:27,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:27,390 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-13 20:48:28,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:28,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 240 states and 357 transitions. [2024-11-13 20:48:28,034 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 357 transitions. [2024-11-13 20:48:28,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-13 20:48:28,038 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:28,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:28,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:28,263 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-13 20:48:28,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:28,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 250 states and 368 transitions. [2024-11-13 20:48:28,458 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 368 transitions. [2024-11-13 20:48:28,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-13 20:48:28,459 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:28,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:28,700 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-13 20:48:28,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:28,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 253 states and 372 transitions. [2024-11-13 20:48:28,859 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 372 transitions. [2024-11-13 20:48:28,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-13 20:48:28,860 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:28,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:29,048 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:48:29,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:29,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 267 states and 388 transitions. [2024-11-13 20:48:29,616 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 388 transitions. [2024-11-13 20:48:29,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-13 20:48:29,618 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:29,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:29,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:29,780 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 20:48:30,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:30,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 268 states and 390 transitions. [2024-11-13 20:48:30,062 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 390 transitions. [2024-11-13 20:48:30,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-13 20:48:30,063 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:30,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:30,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:30,189 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 20:48:30,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:30,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 271 states and 394 transitions. [2024-11-13 20:48:30,390 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 394 transitions. [2024-11-13 20:48:30,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-13 20:48:30,391 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:30,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:30,638 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:48:31,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:31,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 286 states and 415 transitions. [2024-11-13 20:48:31,505 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 415 transitions. [2024-11-13 20:48:31,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-13 20:48:31,507 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:31,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:31,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:31,658 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:48:32,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:32,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 296 states and 426 transitions. [2024-11-13 20:48:32,084 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 426 transitions. [2024-11-13 20:48:32,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-13 20:48:32,085 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:32,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:32,272 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:48:32,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:32,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 299 states and 429 transitions. [2024-11-13 20:48:32,469 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 429 transitions. [2024-11-13 20:48:32,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-13 20:48:32,470 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:32,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:32,587 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:48:32,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:32,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 314 states and 450 transitions. [2024-11-13 20:48:32,878 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 450 transitions. [2024-11-13 20:48:32,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 20:48:32,880 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:32,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:33,000 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:48:33,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:33,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 330 states and 472 transitions. [2024-11-13 20:48:33,884 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 472 transitions. [2024-11-13 20:48:33,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 20:48:33,885 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:33,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:33,951 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:48:34,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:34,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 340 states and 482 transitions. [2024-11-13 20:48:34,339 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 482 transitions. [2024-11-13 20:48:34,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 20:48:34,340 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:34,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:34,429 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 20:48:34,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:34,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 341 states and 483 transitions. [2024-11-13 20:48:34,566 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 483 transitions. [2024-11-13 20:48:34,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 20:48:34,567 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:34,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:34,624 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:48:35,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:35,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 350 states and 495 transitions. [2024-11-13 20:48:35,017 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 495 transitions. [2024-11-13 20:48:35,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-13 20:48:35,019 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:35,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:35,134 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 20:48:35,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:35,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 354 states and 499 transitions. [2024-11-13 20:48:35,380 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 499 transitions. [2024-11-13 20:48:35,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 20:48:35,383 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:35,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:35,481 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:48:35,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:35,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 363 states and 513 transitions. [2024-11-13 20:48:35,944 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 513 transitions. [2024-11-13 20:48:35,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 20:48:35,946 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:35,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:36,046 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:48:36,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:36,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 367 states and 517 transitions. [2024-11-13 20:48:36,307 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 517 transitions. [2024-11-13 20:48:36,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 20:48:36,309 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:36,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:36,468 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-13 20:48:37,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:37,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 386 states and 542 transitions. [2024-11-13 20:48:37,264 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 542 transitions. [2024-11-13 20:48:37,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 20:48:37,265 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:37,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:37,343 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 20:48:37,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:37,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 390 states and 546 transitions. [2024-11-13 20:48:37,573 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 546 transitions. [2024-11-13 20:48:37,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 20:48:37,575 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:37,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:37,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:37,683 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 20:48:37,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:37,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 392 states and 548 transitions. [2024-11-13 20:48:37,863 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 548 transitions. [2024-11-13 20:48:37,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 20:48:37,865 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:37,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:37,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:37,980 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:48:38,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:38,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 409 states and 568 transitions. [2024-11-13 20:48:38,331 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 568 transitions. [2024-11-13 20:48:38,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 20:48:38,333 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:38,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:38,459 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-13 20:48:39,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:39,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 432 states and 597 transitions. [2024-11-13 20:48:39,661 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 597 transitions. [2024-11-13 20:48:39,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 20:48:39,664 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:39,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:39,794 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-13 20:48:40,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:40,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 436 states and 600 transitions. [2024-11-13 20:48:40,017 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 600 transitions. [2024-11-13 20:48:40,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 20:48:40,019 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:40,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:40,091 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 20:48:40,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:40,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 451 states and 617 transitions. [2024-11-13 20:48:40,782 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 617 transitions. [2024-11-13 20:48:40,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 20:48:40,783 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:40,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:41,046 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 35 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:48:41,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:41,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 463 states and 629 transitions. [2024-11-13 20:48:41,788 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 629 transitions. [2024-11-13 20:48:41,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 20:48:41,790 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:41,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:41,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:41,914 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 20:48:42,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:42,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 469 states and 636 transitions. [2024-11-13 20:48:42,346 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 636 transitions. [2024-11-13 20:48:42,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 20:48:42,348 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:42,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:42,487 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 20:48:42,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:42,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 473 states and 640 transitions. [2024-11-13 20:48:42,946 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 640 transitions. [2024-11-13 20:48:42,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 20:48:42,947 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:42,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:43,061 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:48:43,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:43,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 561 states and 740 transitions. [2024-11-13 20:48:43,939 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 740 transitions. [2024-11-13 20:48:43,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-13 20:48:43,941 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:43,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:44,106 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 20:48:44,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:44,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 565 states and 743 transitions. [2024-11-13 20:48:44,368 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 743 transitions. [2024-11-13 20:48:44,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 20:48:44,370 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:44,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:44,697 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 47 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:48:45,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:45,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 580 states and 763 transitions. [2024-11-13 20:48:45,641 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 763 transitions. [2024-11-13 20:48:45,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 20:48:45,643 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:45,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:45,844 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 47 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:48:46,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:46,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 583 states and 767 transitions. [2024-11-13 20:48:46,219 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 767 transitions. [2024-11-13 20:48:46,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 20:48:46,220 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:46,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:46,400 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 20:48:47,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:47,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 621 states and 812 transitions. [2024-11-13 20:48:47,392 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 812 transitions. [2024-11-13 20:48:47,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-13 20:48:47,394 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:47,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:47,533 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 20:48:48,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:48,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 632 states and 827 transitions. [2024-11-13 20:48:48,426 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 827 transitions. [2024-11-13 20:48:48,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-13 20:48:48,428 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:48,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:48,526 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 20:48:48,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:48,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 637 states and 838 transitions. [2024-11-13 20:48:48,999 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 838 transitions. [2024-11-13 20:48:49,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-13 20:48:49,000 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:49,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:49,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:49,068 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 20:48:49,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:49,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 640 states and 842 transitions. [2024-11-13 20:48:49,380 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 842 transitions. [2024-11-13 20:48:49,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-13 20:48:49,381 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:49,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:49,547 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 56 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 20:48:50,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:50,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 647 states and 854 transitions. [2024-11-13 20:48:50,107 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 854 transitions. [2024-11-13 20:48:50,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-13 20:48:50,108 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:50,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:50,173 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 20:48:50,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:50,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 654 states and 864 transitions. [2024-11-13 20:48:50,695 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 864 transitions. [2024-11-13 20:48:50,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-13 20:48:50,696 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:50,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:50,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:50,784 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 20:48:51,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:51,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 661 states and 871 transitions. [2024-11-13 20:48:51,299 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 871 transitions. [2024-11-13 20:48:51,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 20:48:51,300 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:51,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:51,384 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 20:48:52,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:52,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 684 states and 900 transitions. [2024-11-13 20:48:52,137 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 900 transitions. [2024-11-13 20:48:52,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 20:48:52,138 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:52,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:52,248 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 20:48:53,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:53,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 720 states and 938 transitions. [2024-11-13 20:48:53,182 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 938 transitions. [2024-11-13 20:48:53,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 20:48:53,183 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:53,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:53,253 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 20:48:53,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:53,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 729 states and 948 transitions. [2024-11-13 20:48:53,798 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 948 transitions. [2024-11-13 20:48:53,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-13 20:48:53,799 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:53,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:53,887 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 20:48:54,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:54,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 736 states and 956 transitions. [2024-11-13 20:48:54,365 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 956 transitions. [2024-11-13 20:48:54,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-13 20:48:54,367 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:54,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:54,456 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 20:48:55,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:55,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 745 states and 965 transitions. [2024-11-13 20:48:55,404 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 965 transitions. [2024-11-13 20:48:55,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-13 20:48:55,406 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:55,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:55,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:55,649 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 20:48:55,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:55,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 748 states and 968 transitions. [2024-11-13 20:48:55,911 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 968 transitions. [2024-11-13 20:48:55,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-13 20:48:55,912 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:55,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:56,004 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 20:48:56,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:56,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 762 states and 987 transitions. [2024-11-13 20:48:56,652 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 987 transitions. [2024-11-13 20:48:56,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 20:48:56,652 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:56,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:56,917 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 71 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:48:57,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:57,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 763 states and 988 transitions. [2024-11-13 20:48:57,273 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 988 transitions. [2024-11-13 20:48:57,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 20:48:57,274 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:57,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:57,407 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 71 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:48:58,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:58,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 773 states and 999 transitions. [2024-11-13 20:48:58,130 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 999 transitions. [2024-11-13 20:48:58,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 20:48:58,132 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:58,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:58,304 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 71 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:48:58,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:58,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 776 states and 1002 transitions. [2024-11-13 20:48:58,588 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1002 transitions. [2024-11-13 20:48:58,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-13 20:48:58,588 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:58,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:58,634 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-13 20:48:58,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:58,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 789 states and 1016 transitions. [2024-11-13 20:48:58,871 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1016 transitions. [2024-11-13 20:48:58,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-13 20:48:58,872 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:58,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:58,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:58,924 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-13 20:48:59,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:59,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 798 states and 1026 transitions. [2024-11-13 20:48:59,391 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1026 transitions. [2024-11-13 20:48:59,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-13 20:48:59,393 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:59,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:59,508 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 20:48:59,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:59,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 802 states and 1031 transitions. [2024-11-13 20:48:59,903 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1031 transitions. [2024-11-13 20:48:59,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-13 20:48:59,905 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:59,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:59,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:59,991 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 20:49:00,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:00,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 818 states and 1051 transitions. [2024-11-13 20:49:00,998 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1051 transitions. [2024-11-13 20:49:01,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-13 20:49:01,000 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:01,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:01,112 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 20:49:01,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:01,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 825 states and 1058 transitions. [2024-11-13 20:49:01,766 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1058 transitions. [2024-11-13 20:49:01,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 20:49:01,767 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:01,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:01,846 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 20:49:02,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:02,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 832 states and 1065 transitions. [2024-11-13 20:49:02,364 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1065 transitions. [2024-11-13 20:49:02,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 20:49:02,366 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:02,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:02,477 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 20:49:02,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:02,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 837 states and 1069 transitions. [2024-11-13 20:49:02,698 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1069 transitions. [2024-11-13 20:49:02,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-13 20:49:02,699 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:02,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:02,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:02,793 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:03,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:03,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 868 states and 1118 transitions. [2024-11-13 20:49:03,306 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1118 transitions. [2024-11-13 20:49:03,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-13 20:49:03,307 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:03,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:03,487 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 69 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:04,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:04,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 882 states and 1135 transitions. [2024-11-13 20:49:04,134 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1135 transitions. [2024-11-13 20:49:04,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-13 20:49:04,135 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:04,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:04,216 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 20:49:04,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:04,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 884 states and 1139 transitions. [2024-11-13 20:49:04,505 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1139 transitions. [2024-11-13 20:49:04,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-13 20:49:04,506 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:04,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:04,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:04,567 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:05,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:05,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 928 states and 1187 transitions. [2024-11-13 20:49:05,684 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1187 transitions. [2024-11-13 20:49:05,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-13 20:49:05,686 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:05,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:05,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:05,812 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:06,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:06,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 935 states and 1194 transitions. [2024-11-13 20:49:06,519 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1194 transitions. [2024-11-13 20:49:06,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-13 20:49:06,521 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:06,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:06,590 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:07,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:07,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 964 states and 1229 transitions. [2024-11-13 20:49:07,400 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1229 transitions. [2024-11-13 20:49:07,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-13 20:49:07,401 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:07,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:07,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:07,467 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:07,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:07,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 966 states and 1230 transitions. [2024-11-13 20:49:07,859 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1230 transitions. [2024-11-13 20:49:07,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 20:49:07,860 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:07,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:07,923 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:12,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:12,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1011 states and 1298 transitions. [2024-11-13 20:49:12,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1298 transitions. [2024-11-13 20:49:12,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 20:49:12,884 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:12,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:12,987 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:14,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:14,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1027 states and 1320 transitions. [2024-11-13 20:49:14,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1320 transitions. [2024-11-13 20:49:14,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 20:49:14,595 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:14,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:14,709 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:15,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:15,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1040 states and 1331 transitions. [2024-11-13 20:49:15,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1331 transitions. [2024-11-13 20:49:15,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 20:49:15,196 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:15,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:15,296 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:15,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:15,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1042 states and 1332 transitions. [2024-11-13 20:49:15,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1332 transitions. [2024-11-13 20:49:15,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 20:49:15,731 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:15,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:15,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:15,836 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:16,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:16,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1051 states and 1343 transitions. [2024-11-13 20:49:16,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1343 transitions. [2024-11-13 20:49:16,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 20:49:16,405 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:16,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:16,472 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:16,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:16,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1055 states and 1348 transitions. [2024-11-13 20:49:16,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1348 transitions. [2024-11-13 20:49:16,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 20:49:16,950 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:16,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:17,056 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:17,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:17,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1057 states and 1349 transitions. [2024-11-13 20:49:17,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1349 transitions. [2024-11-13 20:49:17,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 20:49:17,674 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:17,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:17,787 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:18,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:18,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1064 states and 1358 transitions. [2024-11-13 20:49:18,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1358 transitions. [2024-11-13 20:49:18,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 20:49:18,711 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:18,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:18,807 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:19,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:19,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1066 states and 1359 transitions. [2024-11-13 20:49:19,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1359 transitions. [2024-11-13 20:49:19,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 20:49:19,283 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:19,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:19,471 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:19,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:19,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1068 states and 1361 transitions. [2024-11-13 20:49:19,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1361 transitions. [2024-11-13 20:49:19,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 20:49:19,936 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:19,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:20,008 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:20,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:20,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1073 states and 1366 transitions. [2024-11-13 20:49:20,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1366 transitions. [2024-11-13 20:49:20,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 20:49:20,519 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:20,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:20,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:20,621 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:21,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:21,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1080 states and 1372 transitions. [2024-11-13 20:49:21,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1372 transitions. [2024-11-13 20:49:21,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 20:49:21,518 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:21,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:21,586 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:22,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:22,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1085 states and 1376 transitions. [2024-11-13 20:49:22,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1376 transitions. [2024-11-13 20:49:22,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 20:49:22,142 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:22,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:22,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:22,209 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:22,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:22,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1090 states and 1380 transitions. [2024-11-13 20:49:22,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1380 transitions. [2024-11-13 20:49:22,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 20:49:22,475 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:22,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:22,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:22,590 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:22,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:22,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1092 states and 1382 transitions. [2024-11-13 20:49:22,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1382 transitions. [2024-11-13 20:49:22,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 20:49:22,929 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:22,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:23,013 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:23,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:23,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1098 states and 1387 transitions. [2024-11-13 20:49:23,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1387 transitions. [2024-11-13 20:49:23,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-13 20:49:23,465 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:23,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:23,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:23,646 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 20:49:23,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:23,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1101 states and 1390 transitions. [2024-11-13 20:49:23,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1390 transitions. [2024-11-13 20:49:23,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-13 20:49:23,825 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:23,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:24,000 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 20:49:24,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:24,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1104 states and 1393 transitions. [2024-11-13 20:49:24,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1393 transitions. [2024-11-13 20:49:24,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-13 20:49:24,293 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:24,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:24,425 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-13 20:49:24,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:24,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1105 states and 1394 transitions. [2024-11-13 20:49:24,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1394 transitions. [2024-11-13 20:49:24,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-13 20:49:24,745 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:24,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:24,829 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 20:49:26,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:26,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1119 states and 1411 transitions. [2024-11-13 20:49:26,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1411 transitions. [2024-11-13 20:49:26,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-13 20:49:26,363 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:26,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:26,456 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 20:49:27,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:27,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1137 states and 1431 transitions. [2024-11-13 20:49:27,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1431 transitions. [2024-11-13 20:49:27,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-13 20:49:27,121 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:27,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:27,214 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 20:49:27,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:27,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1138 states and 1431 transitions. [2024-11-13 20:49:27,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1431 transitions. [2024-11-13 20:49:27,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-13 20:49:27,498 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:27,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:27,568 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:28,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:28,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1149 states and 1444 transitions. [2024-11-13 20:49:28,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1444 transitions. [2024-11-13 20:49:28,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-13 20:49:28,737 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:28,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:28,823 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-13 20:49:29,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:29,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1162 states and 1458 transitions. [2024-11-13 20:49:29,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1458 transitions. [2024-11-13 20:49:29,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-13 20:49:29,100 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:29,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:29,187 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-13 20:49:29,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:29,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1163 states and 1459 transitions. [2024-11-13 20:49:29,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1459 transitions. [2024-11-13 20:49:29,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-13 20:49:29,246 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:29,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:29,396 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 20:49:29,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:29,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1183 states and 1483 transitions. [2024-11-13 20:49:29,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1483 transitions. [2024-11-13 20:49:29,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 20:49:29,980 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:29,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:30,060 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-13 20:49:30,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:30,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1194 states and 1495 transitions. [2024-11-13 20:49:30,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1495 transitions. [2024-11-13 20:49:30,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-13 20:49:30,611 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:30,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:30,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:30,701 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-13 20:49:30,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:30,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1195 states and 1496 transitions. [2024-11-13 20:49:30,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1496 transitions. [2024-11-13 20:49:30,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-13 20:49:30,800 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:30,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:30,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:31,143 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 137 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:33,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:33,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1265 states and 1570 transitions. [2024-11-13 20:49:33,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1570 transitions. [2024-11-13 20:49:33,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-13 20:49:33,661 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:33,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:33,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:34,025 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 137 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:34,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:34,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1280 states and 1588 transitions. [2024-11-13 20:49:34,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1588 transitions. [2024-11-13 20:49:34,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-13 20:49:34,729 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:34,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:35,029 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 137 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:35,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:35,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1291 states and 1598 transitions. [2024-11-13 20:49:35,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1598 transitions. [2024-11-13 20:49:35,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-13 20:49:35,503 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:35,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:35,842 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 137 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:36,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:36,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1305 states and 1613 transitions. [2024-11-13 20:49:36,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1613 transitions. [2024-11-13 20:49:36,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-13 20:49:36,588 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:36,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:36,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:36,735 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-13 20:49:36,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:36,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1316 states and 1625 transitions. [2024-11-13 20:49:36,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1625 transitions. [2024-11-13 20:49:36,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 20:49:36,998 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:36,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:37,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:37,953 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 143 proven. 3 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 20:49:44,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:44,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1385 states and 1725 transitions. [2024-11-13 20:49:44,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 1725 transitions. [2024-11-13 20:49:44,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 20:49:44,008 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:44,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:44,293 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 143 proven. 3 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 20:49:47,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:47,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1421 states and 1766 transitions. [2024-11-13 20:49:47,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 1766 transitions. [2024-11-13 20:49:47,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-13 20:49:47,166 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:47,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:47,267 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 20:49:48,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:48,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1424 states and 1774 transitions. [2024-11-13 20:49:48,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 1774 transitions. [2024-11-13 20:49:48,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-13 20:49:48,605 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:48,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:48,701 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 20:49:50,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:50,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1436 states and 1785 transitions. [2024-11-13 20:49:50,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 1785 transitions. [2024-11-13 20:49:50,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-13 20:49:50,249 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:50,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:50,346 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 20:49:50,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:50,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1437 states and 1785 transitions. [2024-11-13 20:49:50,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 1785 transitions. [2024-11-13 20:49:50,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-13 20:49:50,652 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:50,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:50,747 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 20:49:51,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:51,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1787 states to 1438 states and 1787 transitions. [2024-11-13 20:49:51,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 1787 transitions. [2024-11-13 20:49:51,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-13 20:49:51,388 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:51,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:51,723 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 20:49:54,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:54,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1456 states and 1808 transitions. [2024-11-13 20:49:54,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 1808 transitions. [2024-11-13 20:49:54,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-13 20:49:54,239 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:54,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:54,392 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 20:49:56,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:56,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1490 states and 1841 transitions. [2024-11-13 20:49:56,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1841 transitions. [2024-11-13 20:49:56,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-13 20:49:56,476 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:56,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:57,492 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 20:50:00,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:00,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1560 states and 1912 transitions. [2024-11-13 20:50:00,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 1912 transitions. [2024-11-13 20:50:00,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-13 20:50:00,239 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:00,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:00,559 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 20:50:01,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:01,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1561 states and 1912 transitions. [2024-11-13 20:50:01,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1912 transitions. [2024-11-13 20:50:01,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-13 20:50:01,087 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:01,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:01,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:01,197 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-13 20:50:01,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:01,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1574 states and 1925 transitions. [2024-11-13 20:50:01,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 1925 transitions. [2024-11-13 20:50:01,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-13 20:50:01,353 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:01,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:02,616 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 168 proven. 36 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 20:50:05,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:05,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1622 states and 1987 transitions. [2024-11-13 20:50:05,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 1987 transitions. [2024-11-13 20:50:05,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-13 20:50:05,086 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:05,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:05,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:05,177 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-13 20:50:07,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:07,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 1644 states and 2014 transitions. [2024-11-13 20:50:07,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2014 transitions. [2024-11-13 20:50:07,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-13 20:50:07,825 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:07,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:07,912 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-13 20:50:08,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:08,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 1663 states and 2033 transitions. [2024-11-13 20:50:08,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 2033 transitions. [2024-11-13 20:50:08,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-13 20:50:08,860 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:08,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:08,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:09,856 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-13 20:50:20,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:20,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 1736 states and 2149 transitions. [2024-11-13 20:50:20,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2149 transitions. [2024-11-13 20:50:20,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-13 20:50:20,473 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:20,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:21,047 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-13 20:50:29,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:29,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 1779 states and 2200 transitions. [2024-11-13 20:50:29,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2200 transitions. [2024-11-13 20:50:29,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-13 20:50:29,398 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:29,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:29,833 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-13 20:50:30,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:30,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 1781 states and 2202 transitions. [2024-11-13 20:50:30,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2202 transitions. [2024-11-13 20:50:30,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-13 20:50:30,533 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:30,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:31,032 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-13 20:50:32,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:32,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 1790 states and 2213 transitions. [2024-11-13 20:50:32,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 2213 transitions. [2024-11-13 20:50:32,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-13 20:50:32,883 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:32,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:33,251 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-13 20:50:35,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:35,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 1799 states and 2224 transitions. [2024-11-13 20:50:35,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2224 transitions. [2024-11-13 20:50:35,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-13 20:50:35,371 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:35,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:35,711 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-13 20:50:36,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:36,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2229 states to 1804 states and 2229 transitions. [2024-11-13 20:50:36,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2229 transitions. [2024-11-13 20:50:36,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-13 20:50:36,006 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:36,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:36,414 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-13 20:50:38,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:38,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 1820 states and 2245 transitions. [2024-11-13 20:50:38,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 2245 transitions. [2024-11-13 20:50:38,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-13 20:50:38,817 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:38,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:39,211 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-13 20:50:40,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:40,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 1831 states and 2254 transitions. [2024-11-13 20:50:40,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1831 states and 2254 transitions. [2024-11-13 20:50:40,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-13 20:50:40,576 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:40,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:40,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:41,082 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-13 20:50:41,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:41,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 1835 states and 2258 transitions. [2024-11-13 20:50:41,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2258 transitions. [2024-11-13 20:50:41,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-13 20:50:41,757 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:41,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:42,154 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-13 20:50:43,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:43,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2268 states to 1846 states and 2268 transitions. [2024-11-13 20:50:43,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 2268 transitions. [2024-11-13 20:50:43,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-13 20:50:43,632 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:43,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:44,001 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-13 20:50:44,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:44,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 1851 states and 2272 transitions. [2024-11-13 20:50:44,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 2272 transitions. [2024-11-13 20:50:44,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-13 20:50:44,851 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:44,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:45,170 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-13 20:50:45,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:45,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2276 states to 1856 states and 2276 transitions. [2024-11-13 20:50:45,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 2276 transitions. [2024-11-13 20:50:45,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-13 20:50:45,828 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:45,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:46,165 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-13 20:50:46,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:46,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 1858 states and 2277 transitions. [2024-11-13 20:50:46,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2277 transitions. [2024-11-13 20:50:46,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-13 20:50:46,916 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:46,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:47,254 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-13 20:50:48,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:48,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 1862 states and 2280 transitions. [2024-11-13 20:50:48,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2280 transitions. [2024-11-13 20:50:48,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-13 20:50:48,222 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:48,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:48,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:49,063 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 198 proven. 51 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-13 20:50:50,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:50,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2298 states to 1877 states and 2298 transitions. [2024-11-13 20:50:50,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2298 transitions. [2024-11-13 20:50:50,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-13 20:50:50,261 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:50,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:50,347 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2024-11-13 20:50:50,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:50,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2303 states to 1882 states and 2303 transitions. [2024-11-13 20:50:50,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2303 transitions. [2024-11-13 20:50:50,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-13 20:50:50,787 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:50,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:50,874 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2024-11-13 20:50:51,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:51,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 1887 states and 2309 transitions. [2024-11-13 20:50:51,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 2309 transitions. [2024-11-13 20:50:51,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-13 20:50:51,328 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:51,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:51,433 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 20:50:53,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:53,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 1926 states and 2352 transitions. [2024-11-13 20:50:53,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 2352 transitions. [2024-11-13 20:50:53,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 20:50:53,298 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:53,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:53,496 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 94 proven. 162 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-13 20:50:53,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:53,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 1927 states and 2352 transitions. [2024-11-13 20:50:53,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 2352 transitions. [2024-11-13 20:50:53,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-11-13 20:50:53,755 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:53,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:53,841 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2024-11-13 20:50:53,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:53,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 1931 states and 2356 transitions. [2024-11-13 20:50:53,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2356 transitions. [2024-11-13 20:50:53,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-11-13 20:50:53,934 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:53,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:54,018 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2024-11-13 20:50:54,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:54,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2360 states to 1935 states and 2360 transitions. [2024-11-13 20:50:54,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2360 transitions. [2024-11-13 20:50:54,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-13 20:50:54,114 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:54,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:55,154 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 192 proven. 21 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-11-13 20:50:57,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:57,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2365 states to 1939 states and 2365 transitions. [2024-11-13 20:50:57,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 2365 transitions. [2024-11-13 20:50:57,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-13 20:50:57,585 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:57,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:57,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:58,273 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 192 proven. 21 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-11-13 20:50:59,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:59,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 1942 states and 2367 transitions. [2024-11-13 20:50:59,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2367 transitions. [2024-11-13 20:50:59,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-13 20:50:59,536 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:59,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:59,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:51:00,655 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 20:51:16,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:51:16,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2502 states to 2040 states and 2502 transitions. [2024-11-13 20:51:16,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 2502 transitions. [2024-11-13 20:51:16,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-13 20:51:16,420 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:51:16,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:51:16,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:51:16,775 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 20:51:24,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:51:24,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2556 states to 2072 states and 2556 transitions. [2024-11-13 20:51:24,839 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 2556 transitions. [2024-11-13 20:51:24,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-13 20:51:24,840 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:51:24,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:51:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:51:25,213 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 20:51:26,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:51:26,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2079 states and 2565 transitions. [2024-11-13 20:51:26,960 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 2565 transitions. [2024-11-13 20:51:26,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-13 20:51:26,962 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:51:26,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:51:26,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:51:27,265 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 20:51:28,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:51:28,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2573 states to 2086 states and 2573 transitions. [2024-11-13 20:51:28,785 INFO L276 IsEmpty]: Start isEmpty. Operand 2086 states and 2573 transitions. [2024-11-13 20:51:28,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-13 20:51:28,787 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:51:28,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:51:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:51:29,329 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 20:51:30,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:51:30,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2577 states to 2091 states and 2577 transitions. [2024-11-13 20:51:30,633 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 2577 transitions. [2024-11-13 20:51:30,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-13 20:51:30,637 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:51:30,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:51:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:51:31,286 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 20:51:33,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:51:33,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2583 states to 2098 states and 2583 transitions. [2024-11-13 20:51:33,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 2583 transitions. [2024-11-13 20:51:33,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-13 20:51:33,235 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:51:33,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:51:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:51:33,608 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 20:51:35,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:51:35,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2589 states to 2105 states and 2589 transitions. [2024-11-13 20:51:35,326 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 2589 transitions. [2024-11-13 20:51:35,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-13 20:51:35,328 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:51:35,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:51:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:51:35,907 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 20:51:39,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:51:39,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2603 states to 2116 states and 2603 transitions. [2024-11-13 20:51:39,778 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 2603 transitions. [2024-11-13 20:51:39,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-13 20:51:39,781 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:51:39,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:51:39,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:51:40,140 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 20:51:42,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:51:42,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2609 states to 2123 states and 2609 transitions. [2024-11-13 20:51:42,047 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 2609 transitions. [2024-11-13 20:51:42,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-13 20:51:42,049 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:51:42,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:51:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:51:42,410 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 20:51:44,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:51:44,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2137 states and 2623 transitions. [2024-11-13 20:51:44,759 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 2623 transitions. [2024-11-13 20:51:44,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-13 20:51:44,761 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:51:44,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:51:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:51:45,127 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 20:51:46,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:51:46,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2141 states and 2626 transitions. [2024-11-13 20:51:46,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2141 states and 2626 transitions. [2024-11-13 20:51:47,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-13 20:51:47,102 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:51:47,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:51:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:51:47,485 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 20:51:48,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:51:48,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2628 states to 2143 states and 2628 transitions. [2024-11-13 20:51:48,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2143 states and 2628 transitions. [2024-11-13 20:51:48,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-13 20:51:48,484 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:51:48,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:51:48,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:51:48,875 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 20:51:51,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:51:51,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2638 states to 2152 states and 2638 transitions. [2024-11-13 20:51:51,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 2638 transitions. [2024-11-13 20:51:51,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-13 20:51:51,939 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:51:51,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:51:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:51:52,322 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 20:51:53,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:51:53,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2642 states to 2157 states and 2642 transitions. [2024-11-13 20:51:53,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 2642 transitions. [2024-11-13 20:51:53,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-13 20:51:53,372 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:51:53,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:51:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:51:53,795 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 20:51:54,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:51:54,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2646 states to 2162 states and 2646 transitions. [2024-11-13 20:51:54,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2162 states and 2646 transitions. [2024-11-13 20:51:54,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-13 20:51:54,826 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:51:54,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:51:54,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:51:55,601 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 20:51:56,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:51:56,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2649 states to 2165 states and 2649 transitions. [2024-11-13 20:51:56,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2165 states and 2649 transitions. [2024-11-13 20:51:56,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-13 20:51:56,711 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:51:56,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:51:56,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:51:57,065 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 20:51:58,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:51:58,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2652 states to 2168 states and 2652 transitions. [2024-11-13 20:51:58,063 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 2652 transitions. [2024-11-13 20:51:58,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-13 20:51:58,065 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:51:58,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:51:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:51:58,444 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 20:52:00,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:52:00,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2666 states to 2177 states and 2666 transitions. [2024-11-13 20:52:00,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2177 states and 2666 transitions. [2024-11-13 20:52:00,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-13 20:52:00,816 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:52:00,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:52:00,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:52:01,203 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 20:52:01,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:52:01,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2678 states to 2188 states and 2678 transitions. [2024-11-13 20:52:01,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2188 states and 2678 transitions. [2024-11-13 20:52:01,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-13 20:52:01,434 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:52:01,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:52:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:52:01,804 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 20:52:03,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:52:03,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2681 states to 2192 states and 2681 transitions. [2024-11-13 20:52:03,120 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 2681 transitions. [2024-11-13 20:52:03,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-13 20:52:03,121 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:52:03,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:52:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:52:03,331 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 232 proven. 46 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-13 20:52:03,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:52:03,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2681 states to 2193 states and 2681 transitions. [2024-11-13 20:52:03,739 INFO L276 IsEmpty]: Start isEmpty. Operand 2193 states and 2681 transitions. [2024-11-13 20:52:03,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-11-13 20:52:03,741 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:52:03,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:52:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:52:03,829 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-11-13 20:52:04,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:52:04,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2223 states and 2711 transitions. [2024-11-13 20:52:04,373 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 2711 transitions. [2024-11-13 20:52:04,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-11-13 20:52:04,375 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:52:04,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:52:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:52:04,953 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 242 proven. 62 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-13 20:52:07,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:52:07,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2717 states to 2225 states and 2717 transitions. [2024-11-13 20:52:07,095 INFO L276 IsEmpty]: Start isEmpty. Operand 2225 states and 2717 transitions. [2024-11-13 20:52:07,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-11-13 20:52:07,096 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:52:07,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:52:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:52:07,426 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 242 proven. 62 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-13 20:52:10,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:52:10,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2735 states to 2238 states and 2735 transitions. [2024-11-13 20:52:10,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2238 states and 2735 transitions. [2024-11-13 20:52:10,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-11-13 20:52:10,035 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:52:10,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:52:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:52:10,414 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-11-13 20:52:12,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:52:12,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2753 states to 2252 states and 2753 transitions. [2024-11-13 20:52:12,734 INFO L276 IsEmpty]: Start isEmpty. Operand 2252 states and 2753 transitions. [2024-11-13 20:52:12,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-13 20:52:12,736 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:52:12,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:52:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 20:52:12,773 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 20:52:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 20:52:13,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 20:52:13,150 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 20:52:13,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 20:52:13,394 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 162 iterations. [2024-11-13 20:52:13,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 08:52:13 ImpRootNode [2024-11-13 20:52:13,620 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 20:52:13,621 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 20:52:13,621 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 20:52:13,621 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 20:52:13,622 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:48:23" (3/4) ... [2024-11-13 20:52:13,624 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 20:52:13,858 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5209a888-98a3-4322-85f7-87e176e31380/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 20:52:13,859 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 20:52:13,863 INFO L158 Benchmark]: Toolchain (without parser) took 233447.75ms. Allocated memory was 117.4MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 91.0MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 732.0MB. Max. memory is 16.1GB. [2024-11-13 20:52:13,863 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 117.4MB. Free memory was 73.7MB in the beginning and 73.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 20:52:13,864 INFO L158 Benchmark]: CACSL2BoogieTranslator took 586.04ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 63.9MB in the end (delta: 27.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 20:52:13,864 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.45ms. Allocated memory is still 117.4MB. Free memory was 63.9MB in the beginning and 58.6MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 20:52:13,864 INFO L158 Benchmark]: Boogie Preprocessor took 81.49ms. Allocated memory is still 117.4MB. Free memory was 58.6MB in the beginning and 54.5MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 20:52:13,865 INFO L158 Benchmark]: RCFGBuilder took 1886.64ms. Allocated memory is still 117.4MB. Free memory was 54.5MB in the beginning and 27.9MB in the end (delta: 26.6MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. [2024-11-13 20:52:13,865 INFO L158 Benchmark]: CodeCheck took 230551.89ms. Allocated memory was 117.4MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 27.9MB in the beginning and 2.1GB in the end (delta: -2.1GB). Peak memory consumption was 637.9MB. Max. memory is 16.1GB. [2024-11-13 20:52:13,865 INFO L158 Benchmark]: Witness Printer took 237.70ms. Allocated memory is still 2.9GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-13 20:52:13,869 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: 230.3s, OverallIterations: 162, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 402909 SdHoareTripleChecker+Valid, 1220.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 401315 mSDsluCounter, 74728 SdHoareTripleChecker+Invalid, 1037.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 64535 mSDsCounter, 110474 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 871202 IncrementalHoareTripleChecker+Invalid, 981676 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110474 mSolverCounterUnsat, 10193 mSDtfsCounter, 871202 mSolverCounterSat, 12.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 192635 GetRequests, 186951 SyntacticMatches, 4374 SemanticMatches, 1310 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1102284 ImplicationChecksByTransitivity, 167.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 1.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 34.1s InterpolantComputationTime, 29054 NumberOfCodeBlocks, 29054 NumberOfCodeBlocksAsserted, 162 NumberOfCheckSat, 28628 ConstructedInterpolants, 0 QuantifiedInterpolants, 106176 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 161 InterpolantComputations, 97 PerfectInterpolantSequences, 26247/28674 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 - CounterExampleResult [Line: 411]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int d= 4; [L19] int e= 5; [L20] int f= 6; [L21] int c= 3; [L22] int b= 2; [L25] int u = 21; [L26] int v = 22; [L27] int w = 23; [L28] int x = 24; [L29] int y = 25; [L30] int z = 26; [L32] int a17 = 1; [L33] int a7 = 0; [L34] int a20 = 1; [L35] int a8 = 15; [L36] int a12 = 8; [L37] int a16 = 5; [L38] int a21 = 1; [L590] int output = -1; VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L344] a17 = 0 [L345] a16 = 4 [L346] return 21; VAL [\result=21, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L279] a20 = 0 [L280] a17 = 1 [L281] a16 = 6 [L282] return 21; VAL [\result=21, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L73] a17 = 0 [L74] return 26; VAL [\result=26, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L83] a7 = 1 [L84] a17 = 1 [L85] a21 = 0 [L86] a20 = 1 [L87] a8 = 13 [L88] a16 = 5 [L89] return 26; VAL [\result=26, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND TRUE ((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5)) [L388] a21 = 1 [L389] a16 = 6 [L390] a7 = 0 [L391] return -1; VAL [\result=-1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L410] COND TRUE (((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1)) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L411] reach_error() VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 117.4MB. Free memory was 73.7MB in the beginning and 73.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 586.04ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 63.9MB in the end (delta: 27.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 96.45ms. Allocated memory is still 117.4MB. Free memory was 63.9MB in the beginning and 58.6MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.49ms. Allocated memory is still 117.4MB. Free memory was 58.6MB in the beginning and 54.5MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1886.64ms. Allocated memory is still 117.4MB. Free memory was 54.5MB in the beginning and 27.9MB in the end (delta: 26.6MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. * CodeCheck took 230551.89ms. Allocated memory was 117.4MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 27.9MB in the beginning and 2.1GB in the end (delta: -2.1GB). Peak memory consumption was 637.9MB. Max. memory is 16.1GB. * Witness Printer took 237.70ms. Allocated memory is still 2.9GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-13 20:52:13,925 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5209a888-98a3-4322-85f7-87e176e31380/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE