./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 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85642e45-7cd3-490d-bfef-89d17a56e12d/bin/ukojak-rkRKPMF4O4/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85642e45-7cd3-490d-bfef-89d17a56e12d/bin/ukojak-rkRKPMF4O4/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85642e45-7cd3-490d-bfef-89d17a56e12d/bin/ukojak-rkRKPMF4O4/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85642e45-7cd3-490d-bfef-89d17a56e12d/bin/ukojak-rkRKPMF4O4/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label37.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85642e45-7cd3-490d-bfef-89d17a56e12d/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85642e45-7cd3-490d-bfef-89d17a56e12d/bin/ukojak-rkRKPMF4O4 --witnessprinter.witness.filename witness.graphml --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 19:30:39,383 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 19:30:39,385 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 19:30:39,398 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 19:30:39,398 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 19:30:39,399 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 19:30:39,400 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 19:30:39,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 19:30:39,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 19:30:39,403 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 19:30:39,404 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 19:30:39,404 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 19:30:39,405 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 19:30:39,405 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 19:30:39,406 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 19:30:39,407 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 19:30:39,408 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 19:30:39,408 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 19:30:39,409 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 19:30:39,410 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 19:30:39,411 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 19:30:39,413 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 19:30:39,414 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 19:30:39,415 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 19:30:39,417 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 19:30:39,417 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 19:30:39,417 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 19:30:39,418 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 19:30:39,419 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 19:30:39,419 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 19:30:39,419 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 19:30:39,420 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 19:30:39,420 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 19:30:39,421 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 19:30:39,421 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 19:30:39,422 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 19:30:39,422 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 19:30:39,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 19:30:39,423 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 19:30:39,423 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 19:30:39,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 19:30:39,424 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85642e45-7cd3-490d-bfef-89d17a56e12d/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-12-14 19:30:39,439 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 19:30:39,439 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 19:30:39,439 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 19:30:39,439 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-12-14 19:30:39,440 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 19:30:39,446 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 19:30:39,446 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 19:30:39,446 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 19:30:39,446 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 19:30:39,446 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 19:30:39,447 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 19:30:39,447 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 19:30:39,447 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 19:30:39,447 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 19:30:39,447 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 19:30:39,448 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 19:30:39,448 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 19:30:39,448 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 19:30:39,448 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-12-14 19:30:39,448 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-12-14 19:30:39,449 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 19:30:39,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 19:30:39,449 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 19:30:39,449 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 19:30:39,449 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 19:30:39,450 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-12-14 19:30:39,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 19:30:39,450 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 19:30:39,450 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85642e45-7cd3-490d-bfef-89d17a56e12d/bin/ukojak-rkRKPMF4O4/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85642e45-7cd3-490d-bfef-89d17a56e12d/bin/ukojak-rkRKPMF4O4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 [2022-12-14 19:30:39,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 19:30:39,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 19:30:39,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 19:30:39,671 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 19:30:39,671 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 19:30:39,672 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85642e45-7cd3-490d-bfef-89d17a56e12d/bin/ukojak-rkRKPMF4O4/../../sv-benchmarks/c/eca-rers2012/Problem01_label37.c [2022-12-14 19:30:42,319 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 19:30:42,556 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 19:30:42,556 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85642e45-7cd3-490d-bfef-89d17a56e12d/sv-benchmarks/c/eca-rers2012/Problem01_label37.c [2022-12-14 19:30:42,566 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85642e45-7cd3-490d-bfef-89d17a56e12d/bin/ukojak-rkRKPMF4O4/data/14bcb11ab/c0e7cd6a80b24ad1838e6e3bc0daf48d/FLAG42d6d2aa5 [2022-12-14 19:30:42,577 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85642e45-7cd3-490d-bfef-89d17a56e12d/bin/ukojak-rkRKPMF4O4/data/14bcb11ab/c0e7cd6a80b24ad1838e6e3bc0daf48d [2022-12-14 19:30:42,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 19:30:42,580 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 19:30:42,581 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 19:30:42,581 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 19:30:42,584 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 19:30:42,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:30:42" (1/1) ... [2022-12-14 19:30:42,585 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab65945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:30:42, skipping insertion in model container [2022-12-14 19:30:42,585 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:30:42" (1/1) ... [2022-12-14 19:30:42,591 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 19:30:42,619 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 19:30:42,801 WARN L237 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_85642e45-7cd3-490d-bfef-89d17a56e12d/sv-benchmarks/c/eca-rers2012/Problem01_label37.c[14876,14889] [2022-12-14 19:30:42,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 19:30:42,840 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 19:30:42,895 WARN L237 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_85642e45-7cd3-490d-bfef-89d17a56e12d/sv-benchmarks/c/eca-rers2012/Problem01_label37.c[14876,14889] [2022-12-14 19:30:42,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 19:30:42,920 INFO L208 MainTranslator]: Completed translation [2022-12-14 19:30:42,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:30:42 WrapperNode [2022-12-14 19:30:42,920 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 19:30:42,921 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 19:30:42,921 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 19:30:42,921 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 19:30:42,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:30:42" (1/1) ... [2022-12-14 19:30:42,938 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:30:42" (1/1) ... [2022-12-14 19:30:42,969 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2022-12-14 19:30:42,969 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 19:30:42,970 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 19:30:42,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 19:30:42,970 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 19:30:42,977 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:30:42" (1/1) ... [2022-12-14 19:30:42,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:30:42" (1/1) ... [2022-12-14 19:30:42,980 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:30:42" (1/1) ... [2022-12-14 19:30:42,980 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:30:42" (1/1) ... [2022-12-14 19:30:42,992 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:30:42" (1/1) ... [2022-12-14 19:30:42,997 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:30:42" (1/1) ... [2022-12-14 19:30:43,001 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:30:42" (1/1) ... [2022-12-14 19:30:43,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:30:42" (1/1) ... [2022-12-14 19:30:43,008 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 19:30:43,009 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 19:30:43,009 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 19:30:43,009 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 19:30:43,010 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:30:42" (1/1) ... [2022-12-14 19:30:43,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 19:30:43,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85642e45-7cd3-490d-bfef-89d17a56e12d/bin/ukojak-rkRKPMF4O4/z3 [2022-12-14 19:30:43,032 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85642e45-7cd3-490d-bfef-89d17a56e12d/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-12-14 19:30:43,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85642e45-7cd3-490d-bfef-89d17a56e12d/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-12-14 19:30:43,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 19:30:43,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 19:30:43,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 19:30:43,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 19:30:43,144 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 19:30:43,146 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 19:30:43,837 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 19:30:43,997 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 19:30:43,998 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 19:30:43,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:30:43 BoogieIcfgContainer [2022-12-14 19:30:44,000 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 19:30:44,000 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-12-14 19:30:44,000 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-12-14 19:30:44,008 INFO L275 PluginConnector]: CodeCheck initialized [2022-12-14 19:30:44,008 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:30:43" (1/1) ... [2022-12-14 19:30:44,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 19:30:44,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:44,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2022-12-14 19:30:44,052 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2022-12-14 19:30:44,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-14 19:30:44,054 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:44,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:44,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:30:44,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:44,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 145 states and 243 transitions. [2022-12-14 19:30:44,697 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 243 transitions. [2022-12-14 19:30:44,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-14 19:30:44,699 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:44,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:44,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:30:45,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:45,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 218 states and 323 transitions. [2022-12-14 19:30:45,373 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 323 transitions. [2022-12-14 19:30:45,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-12-14 19:30:45,375 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:45,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:45,495 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:30:45,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:45,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 219 states and 326 transitions. [2022-12-14 19:30:45,683 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 326 transitions. [2022-12-14 19:30:45,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-12-14 19:30:45,684 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:45,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:45,794 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:30:45,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:45,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 229 states and 341 transitions. [2022-12-14 19:30:45,961 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 341 transitions. [2022-12-14 19:30:45,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-12-14 19:30:45,964 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:45,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:46,107 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:30:46,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:46,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 240 states and 356 transitions. [2022-12-14 19:30:46,313 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 356 transitions. [2022-12-14 19:30:46,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-12-14 19:30:46,314 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:46,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:46,432 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:30:46,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:46,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 250 states and 369 transitions. [2022-12-14 19:30:46,610 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 369 transitions. [2022-12-14 19:30:46,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-12-14 19:30:46,611 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:46,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:46,718 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:30:46,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:46,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 253 states and 372 transitions. [2022-12-14 19:30:46,827 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 372 transitions. [2022-12-14 19:30:46,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-12-14 19:30:46,828 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:46,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:46,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:46,923 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:30:47,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:47,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 267 states and 388 transitions. [2022-12-14 19:30:47,205 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 388 transitions. [2022-12-14 19:30:47,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-14 19:30:47,206 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:47,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:47,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:47,272 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 19:30:47,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:47,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 271 states and 394 transitions. [2022-12-14 19:30:47,532 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 394 transitions. [2022-12-14 19:30:47,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-12-14 19:30:47,532 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:47,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:47,661 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:30:48,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:48,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 286 states and 416 transitions. [2022-12-14 19:30:48,123 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 416 transitions. [2022-12-14 19:30:48,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-12-14 19:30:48,124 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:48,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:48,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:48,250 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:30:48,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:48,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 296 states and 426 transitions. [2022-12-14 19:30:48,490 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 426 transitions. [2022-12-14 19:30:48,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-12-14 19:30:48,490 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:48,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:48,573 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:30:48,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:48,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 299 states and 429 transitions. [2022-12-14 19:30:48,696 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 429 transitions. [2022-12-14 19:30:48,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-12-14 19:30:48,698 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:48,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:48,784 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:30:48,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:48,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 314 states and 450 transitions. [2022-12-14 19:30:48,939 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 450 transitions. [2022-12-14 19:30:48,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-12-14 19:30:48,940 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:48,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:48,999 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:30:49,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:49,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 330 states and 472 transitions. [2022-12-14 19:30:49,526 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 472 transitions. [2022-12-14 19:30:49,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-12-14 19:30:49,528 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:49,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:49,562 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:30:49,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:49,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 337 states and 479 transitions. [2022-12-14 19:30:49,711 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 479 transitions. [2022-12-14 19:30:49,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-12-14 19:30:49,711 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:49,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:49,742 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:30:49,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:49,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 340 states and 482 transitions. [2022-12-14 19:30:49,858 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 482 transitions. [2022-12-14 19:30:49,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-12-14 19:30:49,858 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:49,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:49,904 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 19:30:50,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:50,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 341 states and 483 transitions. [2022-12-14 19:30:50,001 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 483 transitions. [2022-12-14 19:30:50,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-12-14 19:30:50,002 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:50,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:50,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:50,032 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:30:50,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:50,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 350 states and 495 transitions. [2022-12-14 19:30:50,279 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 495 transitions. [2022-12-14 19:30:50,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-12-14 19:30:50,280 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:50,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:50,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:50,358 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 19:30:50,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:50,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 354 states and 499 transitions. [2022-12-14 19:30:50,500 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 499 transitions. [2022-12-14 19:30:50,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-14 19:30:50,501 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:50,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:50,558 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:30:50,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:50,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 363 states and 513 transitions. [2022-12-14 19:30:50,761 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 513 transitions. [2022-12-14 19:30:50,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-14 19:30:50,762 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:50,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:50,806 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:30:50,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:50,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 367 states and 517 transitions. [2022-12-14 19:30:50,905 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 517 transitions. [2022-12-14 19:30:50,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-12-14 19:30:50,906 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:50,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:50,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:50,995 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:30:51,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:51,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 386 states and 542 transitions. [2022-12-14 19:30:51,352 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 542 transitions. [2022-12-14 19:30:51,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-12-14 19:30:51,352 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:51,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:51,403 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-14 19:30:51,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:51,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 388 states and 544 transitions. [2022-12-14 19:30:51,487 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 544 transitions. [2022-12-14 19:30:51,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-12-14 19:30:51,488 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:51,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:51,519 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 19:30:51,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:51,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 392 states and 548 transitions. [2022-12-14 19:30:51,670 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 548 transitions. [2022-12-14 19:30:51,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-12-14 19:30:51,670 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:51,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:51,729 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:30:51,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:51,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 409 states and 568 transitions. [2022-12-14 19:30:51,957 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 568 transitions. [2022-12-14 19:30:51,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-12-14 19:30:51,958 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:51,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:52,030 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 19:30:52,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:52,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 432 states and 597 transitions. [2022-12-14 19:30:52,566 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 597 transitions. [2022-12-14 19:30:52,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-12-14 19:30:52,566 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:52,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:52,627 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 19:30:52,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:52,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 436 states and 600 transitions. [2022-12-14 19:30:52,760 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 600 transitions. [2022-12-14 19:30:52,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-12-14 19:30:52,760 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:52,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:52,798 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 19:30:53,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:53,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 451 states and 617 transitions. [2022-12-14 19:30:53,190 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 617 transitions. [2022-12-14 19:30:53,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-12-14 19:30:53,191 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:53,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:53,323 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 35 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:30:53,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:53,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 463 states and 629 transitions. [2022-12-14 19:30:53,652 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 629 transitions. [2022-12-14 19:30:53,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-12-14 19:30:53,653 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:53,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:53,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:53,711 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 19:30:53,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:53,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 469 states and 636 transitions. [2022-12-14 19:30:53,921 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 636 transitions. [2022-12-14 19:30:53,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-12-14 19:30:53,922 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:53,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:53,979 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 19:30:54,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:54,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 473 states and 640 transitions. [2022-12-14 19:30:54,260 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 640 transitions. [2022-12-14 19:30:54,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-12-14 19:30:54,261 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:54,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:54,320 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:30:54,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:54,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 561 states and 740 transitions. [2022-12-14 19:30:54,772 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 740 transitions. [2022-12-14 19:30:54,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-12-14 19:30:54,773 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:54,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:54,848 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-14 19:30:55,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:55,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 565 states and 743 transitions. [2022-12-14 19:30:55,013 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 743 transitions. [2022-12-14 19:30:55,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-12-14 19:30:55,013 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:55,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:55,176 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 47 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:30:55,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:55,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 580 states and 763 transitions. [2022-12-14 19:30:55,688 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 763 transitions. [2022-12-14 19:30:55,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-12-14 19:30:55,688 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:55,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:55,770 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 47 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:30:55,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:55,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 583 states and 767 transitions. [2022-12-14 19:30:55,983 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 767 transitions. [2022-12-14 19:30:55,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-12-14 19:30:55,984 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:55,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:56,075 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 19:30:56,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:56,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 621 states and 812 transitions. [2022-12-14 19:30:56,685 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 812 transitions. [2022-12-14 19:30:56,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-12-14 19:30:56,686 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:56,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:56,764 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 19:30:57,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:57,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 632 states and 827 transitions. [2022-12-14 19:30:57,279 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 827 transitions. [2022-12-14 19:30:57,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-12-14 19:30:57,280 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:57,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:57,315 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 19:30:57,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:57,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 637 states and 838 transitions. [2022-12-14 19:30:57,620 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 838 transitions. [2022-12-14 19:30:57,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-12-14 19:30:57,620 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:57,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:57,662 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 19:30:57,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:57,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 640 states and 842 transitions. [2022-12-14 19:30:57,796 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 842 transitions. [2022-12-14 19:30:57,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-12-14 19:30:57,797 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:57,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:57,855 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 56 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 19:30:58,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:58,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 647 states and 854 transitions. [2022-12-14 19:30:58,114 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 854 transitions. [2022-12-14 19:30:58,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-12-14 19:30:58,115 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:58,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:58,157 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 19:30:58,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:58,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 654 states and 864 transitions. [2022-12-14 19:30:58,409 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 864 transitions. [2022-12-14 19:30:58,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-12-14 19:30:58,410 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:58,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:58,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:58,447 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 19:30:58,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:58,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 661 states and 871 transitions. [2022-12-14 19:30:58,764 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 871 transitions. [2022-12-14 19:30:58,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-12-14 19:30:58,765 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:58,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:58,820 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 19:30:59,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:59,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 684 states and 900 transitions. [2022-12-14 19:30:59,264 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 900 transitions. [2022-12-14 19:30:59,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-12-14 19:30:59,265 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:59,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:59,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:59,310 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 19:30:59,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:30:59,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 720 states and 938 transitions. [2022-12-14 19:30:59,823 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 938 transitions. [2022-12-14 19:30:59,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-12-14 19:30:59,824 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:30:59,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:30:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:30:59,859 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 19:31:00,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:00,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 729 states and 948 transitions. [2022-12-14 19:31:00,099 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 948 transitions. [2022-12-14 19:31:00,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-12-14 19:31:00,100 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:00,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:00,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:00,137 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-14 19:31:00,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:00,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 736 states and 956 transitions. [2022-12-14 19:31:00,320 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 956 transitions. [2022-12-14 19:31:00,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-12-14 19:31:00,321 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:00,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:00,358 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-14 19:31:00,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:00,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 745 states and 965 transitions. [2022-12-14 19:31:00,714 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 965 transitions. [2022-12-14 19:31:00,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-12-14 19:31:00,715 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:00,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:00,776 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 19:31:01,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:01,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 762 states and 987 transitions. [2022-12-14 19:31:01,246 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 987 transitions. [2022-12-14 19:31:01,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-12-14 19:31:01,247 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:01,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:01,402 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 71 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:31:01,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:01,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 763 states and 988 transitions. [2022-12-14 19:31:01,610 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 988 transitions. [2022-12-14 19:31:01,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-12-14 19:31:01,610 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:01,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:01,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:01,707 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 71 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:31:02,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:02,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 773 states and 999 transitions. [2022-12-14 19:31:02,100 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 999 transitions. [2022-12-14 19:31:02,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-12-14 19:31:02,101 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:02,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:02,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:02,248 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 71 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:31:02,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:02,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 776 states and 1002 transitions. [2022-12-14 19:31:02,386 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1002 transitions. [2022-12-14 19:31:02,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-12-14 19:31:02,387 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:02,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:02,425 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 19:31:02,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:02,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 789 states and 1016 transitions. [2022-12-14 19:31:02,592 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1016 transitions. [2022-12-14 19:31:02,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-12-14 19:31:02,593 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:02,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:02,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:02,640 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 19:31:02,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:02,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 798 states and 1026 transitions. [2022-12-14 19:31:02,906 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1026 transitions. [2022-12-14 19:31:02,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-12-14 19:31:02,907 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:02,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:02,971 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 19:31:03,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:03,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 814 states and 1046 transitions. [2022-12-14 19:31:03,635 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1046 transitions. [2022-12-14 19:31:03,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-12-14 19:31:03,636 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:03,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:03,700 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 19:31:03,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:03,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 821 states and 1053 transitions. [2022-12-14 19:31:03,996 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1053 transitions. [2022-12-14 19:31:03,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-12-14 19:31:03,996 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:03,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:04,035 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 19:31:04,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:04,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 825 states and 1058 transitions. [2022-12-14 19:31:04,202 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1058 transitions. [2022-12-14 19:31:04,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-12-14 19:31:04,203 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:04,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:04,269 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-14 19:31:04,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:04,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 832 states and 1065 transitions. [2022-12-14 19:31:04,548 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1065 transitions. [2022-12-14 19:31:04,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-12-14 19:31:04,549 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:04,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:04,615 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-14 19:31:04,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:04,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 837 states and 1069 transitions. [2022-12-14 19:31:04,780 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1069 transitions. [2022-12-14 19:31:04,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-12-14 19:31:04,782 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:04,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:04,874 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:31:05,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:05,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 868 states and 1118 transitions. [2022-12-14 19:31:05,160 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1118 transitions. [2022-12-14 19:31:05,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-12-14 19:31:05,161 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:05,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:05,260 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 69 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:31:05,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:05,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 882 states and 1135 transitions. [2022-12-14 19:31:05,689 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1135 transitions. [2022-12-14 19:31:05,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-12-14 19:31:05,689 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:05,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:05,783 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-12-14 19:31:05,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:05,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 884 states and 1139 transitions. [2022-12-14 19:31:05,913 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1139 transitions. [2022-12-14 19:31:05,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-12-14 19:31:05,914 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:05,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:05,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:06,239 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:31:08,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:08,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 955 states and 1238 transitions. [2022-12-14 19:31:08,716 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1238 transitions. [2022-12-14 19:31:08,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-12-14 19:31:08,717 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:08,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:08,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:08,866 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:31:09,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:09,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 967 states and 1249 transitions. [2022-12-14 19:31:09,459 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1249 transitions. [2022-12-14 19:31:09,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-12-14 19:31:09,460 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:09,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:09,541 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:31:10,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:10,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 996 states and 1286 transitions. [2022-12-14 19:31:10,602 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1286 transitions. [2022-12-14 19:31:10,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-12-14 19:31:10,602 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:10,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:10,656 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:31:10,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:10,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 998 states and 1287 transitions. [2022-12-14 19:31:10,934 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1287 transitions. [2022-12-14 19:31:10,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-12-14 19:31:10,935 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:10,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:11,291 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 104 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:31:14,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:14,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1082 states and 1414 transitions. [2022-12-14 19:31:14,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1414 transitions. [2022-12-14 19:31:14,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-12-14 19:31:14,917 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:14,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:15,018 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-12-14 19:31:15,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:15,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1083 states and 1415 transitions. [2022-12-14 19:31:15,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1415 transitions. [2022-12-14 19:31:15,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-12-14 19:31:15,246 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:15,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:15,835 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 120 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:31:19,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:19,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1153 states and 1497 transitions. [2022-12-14 19:31:19,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1497 transitions. [2022-12-14 19:31:19,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-12-14 19:31:19,071 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:19,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:19,282 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 120 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:31:21,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:21,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1184 states and 1533 transitions. [2022-12-14 19:31:21,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1533 transitions. [2022-12-14 19:31:21,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-12-14 19:31:21,526 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:21,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:21,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:21,750 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 120 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:31:22,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:22,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1193 states and 1541 transitions. [2022-12-14 19:31:22,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1541 transitions. [2022-12-14 19:31:22,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-12-14 19:31:22,290 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:22,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:22,497 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 119 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 19:31:23,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:23,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1220 states and 1573 transitions. [2022-12-14 19:31:23,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1573 transitions. [2022-12-14 19:31:23,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-12-14 19:31:23,687 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:23,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:23,738 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 19:31:23,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:23,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1224 states and 1578 transitions. [2022-12-14 19:31:23,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1578 transitions. [2022-12-14 19:31:23,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-12-14 19:31:23,952 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:23,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:24,004 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-12-14 19:31:24,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:24,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1229 states and 1585 transitions. [2022-12-14 19:31:24,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1585 transitions. [2022-12-14 19:31:24,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-12-14 19:31:24,172 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:24,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:24,367 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 126 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 19:31:24,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:24,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1238 states and 1594 transitions. [2022-12-14 19:31:24,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1594 transitions. [2022-12-14 19:31:24,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-12-14 19:31:24,831 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:24,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:25,122 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 126 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:31:27,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:27,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1275 states and 1639 transitions. [2022-12-14 19:31:27,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1639 transitions. [2022-12-14 19:31:27,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-12-14 19:31:27,152 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:27,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:27,342 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 126 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:31:28,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:28,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1298 states and 1668 transitions. [2022-12-14 19:31:28,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1668 transitions. [2022-12-14 19:31:28,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-12-14 19:31:28,657 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:28,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:28,843 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 126 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:31:29,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:29,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1304 states and 1675 transitions. [2022-12-14 19:31:29,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1675 transitions. [2022-12-14 19:31:29,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-12-14 19:31:29,427 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:29,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:29,629 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 126 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:31:30,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:30,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1311 states and 1683 transitions. [2022-12-14 19:31:30,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1683 transitions. [2022-12-14 19:31:30,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-12-14 19:31:30,157 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:30,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:30,345 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 126 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:31:30,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:30,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1316 states and 1687 transitions. [2022-12-14 19:31:30,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1687 transitions. [2022-12-14 19:31:30,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-12-14 19:31:30,720 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:30,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:30,771 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-12-14 19:31:30,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:30,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1319 states and 1691 transitions. [2022-12-14 19:31:30,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1691 transitions. [2022-12-14 19:31:30,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-12-14 19:31:30,826 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:30,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:30,877 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 19:31:30,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:30,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1322 states and 1694 transitions. [2022-12-14 19:31:30,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1694 transitions. [2022-12-14 19:31:30,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-12-14 19:31:30,924 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:30,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:30,979 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-12-14 19:31:31,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:31,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1334 states and 1708 transitions. [2022-12-14 19:31:31,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1708 transitions. [2022-12-14 19:31:31,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-12-14 19:31:31,227 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:31,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:31,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:31,281 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 19:31:31,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:31,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1349 states and 1725 transitions. [2022-12-14 19:31:31,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1725 transitions. [2022-12-14 19:31:31,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-12-14 19:31:31,710 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:31,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:31,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:31,766 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-12-14 19:31:31,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:31,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1361 states and 1739 transitions. [2022-12-14 19:31:31,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1739 transitions. [2022-12-14 19:31:31,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-12-14 19:31:31,984 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:31,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:32,042 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 19:31:32,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:32,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1364 states and 1743 transitions. [2022-12-14 19:31:32,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 1743 transitions. [2022-12-14 19:31:32,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-12-14 19:31:32,096 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:32,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:32,304 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 133 proven. 6 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-12-14 19:31:32,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:32,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1371 states and 1750 transitions. [2022-12-14 19:31:32,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1750 transitions. [2022-12-14 19:31:32,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-12-14 19:31:32,547 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:32,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:32,897 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 133 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-14 19:31:35,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:35,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1408 states and 1800 transitions. [2022-12-14 19:31:35,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 1800 transitions. [2022-12-14 19:31:35,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-12-14 19:31:35,239 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:35,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:35,455 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 133 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-14 19:31:37,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:37,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1830 states to 1428 states and 1830 transitions. [2022-12-14 19:31:37,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1830 transitions. [2022-12-14 19:31:37,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-12-14 19:31:37,667 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:37,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:37,886 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 133 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-14 19:31:39,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:39,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1452 states and 1854 transitions. [2022-12-14 19:31:39,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 1854 transitions. [2022-12-14 19:31:39,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-12-14 19:31:39,983 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:39,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:40,199 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 133 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-14 19:31:40,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:40,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1457 states and 1859 transitions. [2022-12-14 19:31:40,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 1859 transitions. [2022-12-14 19:31:40,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-12-14 19:31:40,748 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:40,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:40,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:41,030 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 136 proven. 6 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-12-14 19:31:41,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:41,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1863 states to 1460 states and 1863 transitions. [2022-12-14 19:31:41,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 1863 transitions. [2022-12-14 19:31:41,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-12-14 19:31:41,258 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:41,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:41,611 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 136 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 19:31:44,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:44,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1491 states and 1906 transitions. [2022-12-14 19:31:44,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 1906 transitions. [2022-12-14 19:31:44,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-12-14 19:31:44,967 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:44,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:44,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:45,181 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 136 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 19:31:47,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:47,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1516 states and 1935 transitions. [2022-12-14 19:31:47,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 1935 transitions. [2022-12-14 19:31:47,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-12-14 19:31:47,010 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:47,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:47,228 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 136 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 19:31:48,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:48,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1523 states and 1945 transitions. [2022-12-14 19:31:48,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 1945 transitions. [2022-12-14 19:31:48,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-12-14 19:31:48,064 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:48,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:48,279 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 136 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 19:31:49,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:49,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1530 states and 1953 transitions. [2022-12-14 19:31:49,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 1953 transitions. [2022-12-14 19:31:49,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-12-14 19:31:49,099 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:49,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:49,315 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 136 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 19:31:49,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:49,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1955 states to 1532 states and 1955 transitions. [2022-12-14 19:31:49,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 1955 transitions. [2022-12-14 19:31:49,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-12-14 19:31:49,942 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:49,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:50,153 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 136 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 19:31:50,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:50,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1537 states and 1959 transitions. [2022-12-14 19:31:50,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 1959 transitions. [2022-12-14 19:31:50,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-12-14 19:31:50,732 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:50,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:50,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:50,946 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 136 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 19:31:52,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:53,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1554 states and 1990 transitions. [2022-12-14 19:31:53,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 1990 transitions. [2022-12-14 19:31:53,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-12-14 19:31:53,001 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:53,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:53,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:53,232 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 136 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 19:31:53,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:53,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1561 states and 1998 transitions. [2022-12-14 19:31:53,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1998 transitions. [2022-12-14 19:31:53,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-12-14 19:31:53,956 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:53,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:53,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:54,165 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 136 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 19:31:54,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:54,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2003 states to 1566 states and 2003 transitions. [2022-12-14 19:31:54,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2003 transitions. [2022-12-14 19:31:54,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-12-14 19:31:54,505 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:54,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:54,718 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 136 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 19:31:55,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:55,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2008 states to 1571 states and 2008 transitions. [2022-12-14 19:31:55,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2008 transitions. [2022-12-14 19:31:55,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-12-14 19:31:55,125 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:55,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:55,331 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 136 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 19:31:56,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:56,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2031 states to 1588 states and 2031 transitions. [2022-12-14 19:31:56,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2031 transitions. [2022-12-14 19:31:56,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-12-14 19:31:56,645 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:56,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:56,877 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 136 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 19:31:57,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:57,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 1590 states and 2033 transitions. [2022-12-14 19:31:57,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 2033 transitions. [2022-12-14 19:31:57,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-12-14 19:31:57,313 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:57,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:57,520 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 136 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 19:31:57,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:57,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 1592 states and 2035 transitions. [2022-12-14 19:31:57,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 2035 transitions. [2022-12-14 19:31:57,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-12-14 19:31:57,978 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:57,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:58,213 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 136 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 19:31:58,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:58,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 1599 states and 2042 transitions. [2022-12-14 19:31:58,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2042 transitions. [2022-12-14 19:31:58,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-12-14 19:31:58,599 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:58,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:58,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:58,808 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 136 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 19:31:59,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:31:59,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2049 states to 1606 states and 2049 transitions. [2022-12-14 19:31:59,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 2049 transitions. [2022-12-14 19:31:59,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-12-14 19:31:59,653 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:31:59,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:31:59,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:31:59,889 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 136 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 19:32:00,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:00,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 1611 states and 2054 transitions. [2022-12-14 19:32:00,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2054 transitions. [2022-12-14 19:32:00,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-12-14 19:32:00,479 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:00,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:00,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:00,689 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 136 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 19:32:01,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:01,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 1616 states and 2058 transitions. [2022-12-14 19:32:01,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2058 transitions. [2022-12-14 19:32:01,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-12-14 19:32:01,116 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:01,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:01,326 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 136 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 19:32:01,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:01,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 1621 states and 2063 transitions. [2022-12-14 19:32:01,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 2063 transitions. [2022-12-14 19:32:01,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-12-14 19:32:01,902 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:01,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:02,114 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 136 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 19:32:02,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:02,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 1623 states and 2064 transitions. [2022-12-14 19:32:02,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2064 transitions. [2022-12-14 19:32:02,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-12-14 19:32:02,518 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:02,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:02,731 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 136 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 19:32:03,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:03,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2065 states to 1625 states and 2065 transitions. [2022-12-14 19:32:03,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 2065 transitions. [2022-12-14 19:32:03,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-12-14 19:32:03,201 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:03,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:03,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:03,410 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 136 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 19:32:03,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:03,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 1627 states and 2067 transitions. [2022-12-14 19:32:03,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 2067 transitions. [2022-12-14 19:32:03,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-12-14 19:32:03,852 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:03,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:04,063 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 136 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 19:32:04,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:04,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2068 states to 1629 states and 2068 transitions. [2022-12-14 19:32:04,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2068 transitions. [2022-12-14 19:32:04,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-12-14 19:32:04,542 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:04,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:04,779 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 136 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 19:32:05,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:05,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 1631 states and 2069 transitions. [2022-12-14 19:32:05,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2069 transitions. [2022-12-14 19:32:05,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-12-14 19:32:05,313 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:05,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:05,519 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 136 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 19:32:05,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:05,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 1633 states and 2071 transitions. [2022-12-14 19:32:05,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 2071 transitions. [2022-12-14 19:32:05,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-12-14 19:32:05,860 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:05,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:05,954 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 19:32:06,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:06,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2086 states to 1643 states and 2086 transitions. [2022-12-14 19:32:06,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1643 states and 2086 transitions. [2022-12-14 19:32:06,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-12-14 19:32:06,268 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:06,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:06,325 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-12-14 19:32:06,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:06,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 1654 states and 2100 transitions. [2022-12-14 19:32:06,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 2100 transitions. [2022-12-14 19:32:06,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-12-14 19:32:06,707 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:06,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:06,905 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 19:32:09,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:09,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2178 states to 1718 states and 2178 transitions. [2022-12-14 19:32:09,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2178 transitions. [2022-12-14 19:32:09,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-12-14 19:32:09,778 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:09,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:09,836 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-12-14 19:32:09,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:09,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2179 states to 1719 states and 2179 transitions. [2022-12-14 19:32:09,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2179 transitions. [2022-12-14 19:32:09,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-12-14 19:32:09,879 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:09,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:09,949 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 19:32:10,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:10,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 1755 states and 2217 transitions. [2022-12-14 19:32:10,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2217 transitions. [2022-12-14 19:32:10,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-12-14 19:32:10,757 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:10,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:10,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:10,826 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 19:32:11,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:11,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2220 states to 1759 states and 2220 transitions. [2022-12-14 19:32:11,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2220 transitions. [2022-12-14 19:32:11,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-12-14 19:32:11,258 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:11,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:11,864 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 137 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:32:15,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:15,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2325 states to 1857 states and 2325 transitions. [2022-12-14 19:32:15,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 2325 transitions. [2022-12-14 19:32:15,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-12-14 19:32:15,341 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:15,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:15,579 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 137 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:32:17,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:17,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 1887 states and 2359 transitions. [2022-12-14 19:32:17,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 2359 transitions. [2022-12-14 19:32:17,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-12-14 19:32:17,057 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:17,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:17,271 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 137 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:32:17,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:17,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 1891 states and 2364 transitions. [2022-12-14 19:32:17,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 2364 transitions. [2022-12-14 19:32:17,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-12-14 19:32:17,933 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:17,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:18,133 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 137 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:32:18,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:18,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 1894 states and 2366 transitions. [2022-12-14 19:32:18,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2366 transitions. [2022-12-14 19:32:18,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-12-14 19:32:18,552 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:18,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:18,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:19,075 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 169 proven. 47 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-14 19:32:21,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:21,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 1913 states and 2395 transitions. [2022-12-14 19:32:21,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 2395 transitions. [2022-12-14 19:32:21,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-12-14 19:32:21,589 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:21,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:21,843 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 169 proven. 47 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-14 19:32:22,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:22,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2398 states to 1916 states and 2398 transitions. [2022-12-14 19:32:22,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2398 transitions. [2022-12-14 19:32:22,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-12-14 19:32:22,480 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:22,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:22,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:22,536 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 19:32:22,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:22,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2403 states to 1919 states and 2403 transitions. [2022-12-14 19:32:22,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1919 states and 2403 transitions. [2022-12-14 19:32:22,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-12-14 19:32:22,880 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:22,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:22,936 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 19:32:23,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:23,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 1951 states and 2434 transitions. [2022-12-14 19:32:23,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 2434 transitions. [2022-12-14 19:32:23,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-12-14 19:32:23,615 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:23,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:23,829 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 139 proven. 71 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-12-14 19:32:24,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:24,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2437 states to 1954 states and 2437 transitions. [2022-12-14 19:32:24,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2437 transitions. [2022-12-14 19:32:24,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-12-14 19:32:24,037 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:24,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:24,240 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 143 proven. 3 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 19:32:25,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:25,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2445 states to 1958 states and 2445 transitions. [2022-12-14 19:32:25,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1958 states and 2445 transitions. [2022-12-14 19:32:25,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-12-14 19:32:25,204 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:25,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:25,276 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 19:32:25,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:25,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2446 states to 1959 states and 2446 transitions. [2022-12-14 19:32:25,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 2446 transitions. [2022-12-14 19:32:25,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-12-14 19:32:25,777 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:25,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:25,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:25,999 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 141 proven. 9 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-12-14 19:32:26,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:26,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2453 states to 1965 states and 2453 transitions. [2022-12-14 19:32:26,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 2453 transitions. [2022-12-14 19:32:26,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-12-14 19:32:26,944 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:26,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:27,245 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 141 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:32:27,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:27,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2456 states to 1969 states and 2456 transitions. [2022-12-14 19:32:27,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2456 transitions. [2022-12-14 19:32:27,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-12-14 19:32:27,751 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:27,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:28,055 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 19:32:30,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:30,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 1999 states and 2496 transitions. [2022-12-14 19:32:30,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1999 states and 2496 transitions. [2022-12-14 19:32:30,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-12-14 19:32:30,981 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:30,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:31,078 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 19:32:32,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:32,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2502 states to 2002 states and 2502 transitions. [2022-12-14 19:32:32,116 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 2502 transitions. [2022-12-14 19:32:32,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2022-12-14 19:32:32,117 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:32,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:32,661 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 19:32:35,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:35,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2575 states to 2073 states and 2575 transitions. [2022-12-14 19:32:35,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2073 states and 2575 transitions. [2022-12-14 19:32:35,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2022-12-14 19:32:35,438 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:35,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:35,597 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 19:32:36,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:36,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2577 states to 2076 states and 2577 transitions. [2022-12-14 19:32:36,616 INFO L276 IsEmpty]: Start isEmpty. Operand 2076 states and 2577 transitions. [2022-12-14 19:32:36,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2022-12-14 19:32:36,617 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:36,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:36,675 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-12-14 19:32:36,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:36,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2584 states to 2082 states and 2584 transitions. [2022-12-14 19:32:36,754 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 2584 transitions. [2022-12-14 19:32:36,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2022-12-14 19:32:36,755 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:36,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:36,979 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 151 proven. 83 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-12-14 19:32:37,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:37,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2094 states and 2595 transitions. [2022-12-14 19:32:37,784 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 2595 transitions. [2022-12-14 19:32:37,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-12-14 19:32:37,785 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:37,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:38,158 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 168 proven. 36 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 19:32:40,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:40,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2649 states to 2141 states and 2649 transitions. [2022-12-14 19:32:40,139 INFO L276 IsEmpty]: Start isEmpty. Operand 2141 states and 2649 transitions. [2022-12-14 19:32:40,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-12-14 19:32:40,140 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:40,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:40,367 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 154 proven. 86 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-12-14 19:32:42,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:42,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2172 states and 2682 transitions. [2022-12-14 19:32:42,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 2682 transitions. [2022-12-14 19:32:42,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-12-14 19:32:42,211 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:42,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:42,274 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 236 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-12-14 19:32:43,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:43,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2693 states to 2180 states and 2693 transitions. [2022-12-14 19:32:43,160 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 2693 transitions. [2022-12-14 19:32:43,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2022-12-14 19:32:43,161 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:43,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:43,224 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-12-14 19:32:43,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:43,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2694 states to 2181 states and 2694 transitions. [2022-12-14 19:32:43,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 2694 transitions. [2022-12-14 19:32:43,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2022-12-14 19:32:43,280 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:43,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:43,360 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-12-14 19:32:44,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:44,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2191 states and 2711 transitions. [2022-12-14 19:32:44,747 INFO L276 IsEmpty]: Start isEmpty. Operand 2191 states and 2711 transitions. [2022-12-14 19:32:44,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2022-12-14 19:32:44,749 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:44,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:44,915 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 240 proven. 6 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 19:32:45,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:45,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2719 states to 2198 states and 2719 transitions. [2022-12-14 19:32:45,718 INFO L276 IsEmpty]: Start isEmpty. Operand 2198 states and 2719 transitions. [2022-12-14 19:32:45,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2022-12-14 19:32:45,719 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:45,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:45,970 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 165 proven. 97 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-12-14 19:32:46,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:46,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2734 states to 2212 states and 2734 transitions. [2022-12-14 19:32:46,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2212 states and 2734 transitions. [2022-12-14 19:32:46,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2022-12-14 19:32:46,876 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:46,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:46,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:46,941 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-12-14 19:32:48,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:48,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2751 states to 2224 states and 2751 transitions. [2022-12-14 19:32:48,262 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 2751 transitions. [2022-12-14 19:32:48,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2022-12-14 19:32:48,263 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:48,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:48,729 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 199 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 19:32:51,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:51,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2777 states to 2236 states and 2777 transitions. [2022-12-14 19:32:51,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 2777 transitions. [2022-12-14 19:32:51,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2022-12-14 19:32:51,269 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:51,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:51,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:51,502 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 199 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 19:32:51,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:51,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2772 states to 2232 states and 2772 transitions. [2022-12-14 19:32:51,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2232 states and 2772 transitions. [2022-12-14 19:32:51,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2022-12-14 19:32:51,997 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:51,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:52,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:52,297 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 168 proven. 100 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-12-14 19:32:53,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:53,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2787 states to 2246 states and 2787 transitions. [2022-12-14 19:32:53,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 2787 transitions. [2022-12-14 19:32:53,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2022-12-14 19:32:53,509 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:53,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:53,756 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 168 proven. 100 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-12-14 19:32:55,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:55,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2799 states to 2253 states and 2799 transitions. [2022-12-14 19:32:55,367 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 2799 transitions. [2022-12-14 19:32:55,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-12-14 19:32:55,368 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:55,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:55,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:55,433 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-12-14 19:32:55,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:55,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2801 states to 2255 states and 2801 transitions. [2022-12-14 19:32:55,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 2801 transitions. [2022-12-14 19:32:55,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-12-14 19:32:55,862 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:55,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:56,110 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 171 proven. 103 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-12-14 19:32:56,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:32:56,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2801 states to 2256 states and 2801 transitions. [2022-12-14 19:32:56,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2256 states and 2801 transitions. [2022-12-14 19:32:56,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-12-14 19:32:56,307 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:32:56,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:32:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:32:56,384 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-12-14 19:33:04,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:33:04,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2884 states to 2313 states and 2884 transitions. [2022-12-14 19:33:04,821 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 2884 transitions. [2022-12-14 19:33:04,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-12-14 19:33:04,823 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:33:04,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:33:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:33:04,917 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-12-14 19:33:08,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:33:08,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2908 states to 2331 states and 2908 transitions. [2022-12-14 19:33:08,171 INFO L276 IsEmpty]: Start isEmpty. Operand 2331 states and 2908 transitions. [2022-12-14 19:33:08,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-12-14 19:33:08,173 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:33:08,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:33:08,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:33:08,250 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-12-14 19:33:10,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:33:10,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2921 states to 2342 states and 2921 transitions. [2022-12-14 19:33:10,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2342 states and 2921 transitions. [2022-12-14 19:33:10,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-12-14 19:33:10,591 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:33:10,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:33:10,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:33:10,667 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-12-14 19:33:11,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:33:11,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2349 states and 2929 transitions. [2022-12-14 19:33:11,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2349 states and 2929 transitions. [2022-12-14 19:33:11,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-12-14 19:33:11,897 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:33:11,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:33:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:33:11,972 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-12-14 19:33:12,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:33:12,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2940 states to 2356 states and 2940 transitions. [2022-12-14 19:33:12,740 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 2940 transitions. [2022-12-14 19:33:12,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-12-14 19:33:12,741 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:33:12,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:33:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:33:12,818 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-12-14 19:33:14,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:33:14,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2957 states to 2369 states and 2957 transitions. [2022-12-14 19:33:14,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2369 states and 2957 transitions. [2022-12-14 19:33:14,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-12-14 19:33:14,807 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:33:14,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:33:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:33:14,886 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-12-14 19:33:15,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:33:15,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2960 states to 2371 states and 2960 transitions. [2022-12-14 19:33:15,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 2960 transitions. [2022-12-14 19:33:15,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-12-14 19:33:15,460 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:33:15,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:33:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:33:15,536 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-12-14 19:33:17,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:33:17,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2981 states to 2388 states and 2981 transitions. [2022-12-14 19:33:17,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 2981 transitions. [2022-12-14 19:33:17,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-12-14 19:33:17,706 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:33:17,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:33:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:33:17,782 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-12-14 19:33:19,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:33:19,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2988 states to 2395 states and 2988 transitions. [2022-12-14 19:33:19,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 2988 transitions. [2022-12-14 19:33:19,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-12-14 19:33:19,135 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:33:19,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:33:19,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:33:19,211 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-12-14 19:33:19,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:33:19,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2993 states to 2400 states and 2993 transitions. [2022-12-14 19:33:19,564 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 2993 transitions. [2022-12-14 19:33:19,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-12-14 19:33:19,566 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:33:19,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:33:19,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:33:19,642 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-12-14 19:33:20,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:33:20,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2994 states to 2402 states and 2994 transitions. [2022-12-14 19:33:20,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2402 states and 2994 transitions. [2022-12-14 19:33:20,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-12-14 19:33:20,293 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:33:20,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:33:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:33:20,369 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-12-14 19:33:21,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:33:21,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2406 states and 2999 transitions. [2022-12-14 19:33:21,735 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 2999 transitions. [2022-12-14 19:33:21,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-12-14 19:33:21,736 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:33:21,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:33:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:33:21,812 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-12-14 19:33:22,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:33:22,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3001 states to 2408 states and 3001 transitions. [2022-12-14 19:33:22,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2408 states and 3001 transitions. [2022-12-14 19:33:22,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-12-14 19:33:22,452 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:33:22,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:33:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:33:22,528 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-12-14 19:33:23,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:33:23,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3005 states to 2413 states and 3005 transitions. [2022-12-14 19:33:23,286 INFO L276 IsEmpty]: Start isEmpty. Operand 2413 states and 3005 transitions. [2022-12-14 19:33:23,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-12-14 19:33:23,287 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:33:23,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:33:23,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:33:23,363 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-12-14 19:33:23,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:33:23,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3012 states to 2420 states and 3012 transitions. [2022-12-14 19:33:23,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 3012 transitions. [2022-12-14 19:33:23,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-12-14 19:33:23,669 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:33:23,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:33:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:33:23,744 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-12-14 19:33:24,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:33:24,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3013 states to 2422 states and 3013 transitions. [2022-12-14 19:33:24,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2422 states and 3013 transitions. [2022-12-14 19:33:24,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-12-14 19:33:24,367 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:33:24,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:33:24,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:33:24,443 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-12-14 19:33:25,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:33:25,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3014 states to 2424 states and 3014 transitions. [2022-12-14 19:33:25,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2424 states and 3014 transitions. [2022-12-14 19:33:25,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-12-14 19:33:25,132 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:33:25,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:33:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:33:25,207 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-12-14 19:33:25,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:33:25,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3015 states to 2426 states and 3015 transitions. [2022-12-14 19:33:25,802 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 3015 transitions. [2022-12-14 19:33:25,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-12-14 19:33:25,803 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:33:25,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:33:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:33:25,879 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-12-14 19:33:26,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:33:26,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3025 states to 2437 states and 3025 transitions. [2022-12-14 19:33:26,059 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 3025 transitions. [2022-12-14 19:33:26,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-12-14 19:33:26,060 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:33:26,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:33:26,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:33:26,135 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-12-14 19:33:26,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:33:26,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3029 states to 2442 states and 3029 transitions. [2022-12-14 19:33:26,950 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 3029 transitions. [2022-12-14 19:33:26,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-12-14 19:33:26,952 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:33:26,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:33:26,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:33:27,036 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-12-14 19:33:27,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:33:27,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3035 states to 2446 states and 3035 transitions. [2022-12-14 19:33:27,729 INFO L276 IsEmpty]: Start isEmpty. Operand 2446 states and 3035 transitions. [2022-12-14 19:33:27,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-12-14 19:33:27,730 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:33:27,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:33:27,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:33:27,796 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-12-14 19:33:28,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:33:28,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3036 states to 2448 states and 3036 transitions. [2022-12-14 19:33:28,361 INFO L276 IsEmpty]: Start isEmpty. Operand 2448 states and 3036 transitions. [2022-12-14 19:33:28,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-12-14 19:33:28,362 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:33:28,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:33:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:33:28,607 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 211 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 19:33:30,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:33:30,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3044 states to 2454 states and 3044 transitions. [2022-12-14 19:33:30,022 INFO L276 IsEmpty]: Start isEmpty. Operand 2454 states and 3044 transitions. [2022-12-14 19:33:30,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-12-14 19:33:30,024 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:33:30,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:33:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:33:30,260 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 211 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 19:33:31,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:33:31,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3049 states to 2459 states and 3049 transitions. [2022-12-14 19:33:31,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 3049 transitions. [2022-12-14 19:33:31,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-12-14 19:33:31,041 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:33:31,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:33:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:33:31,329 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 211 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 19:33:33,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:33:33,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3057 states to 2465 states and 3057 transitions. [2022-12-14 19:33:33,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 3057 transitions. [2022-12-14 19:33:33,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-12-14 19:33:33,136 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:33:33,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:33:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:33:33,380 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 172 proven. 104 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-12-14 19:33:34,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:33:34,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 2482 states and 3073 transitions. [2022-12-14 19:33:34,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2482 states and 3073 transitions. [2022-12-14 19:33:34,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2022-12-14 19:33:34,751 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:33:34,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:33:34,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:33:34,820 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-12-14 19:33:36,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:33:36,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3083 states to 2489 states and 3083 transitions. [2022-12-14 19:33:36,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2489 states and 3083 transitions. [2022-12-14 19:33:36,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2022-12-14 19:33:36,329 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:33:36,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:33:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:33:37,350 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 228 proven. 38 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 19:33:40,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:33:40,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3097 states to 2498 states and 3097 transitions. [2022-12-14 19:33:40,094 INFO L276 IsEmpty]: Start isEmpty. Operand 2498 states and 3097 transitions. [2022-12-14 19:33:40,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2022-12-14 19:33:40,096 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:33:40,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:33:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:33:40,344 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 228 proven. 38 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 19:33:42,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:33:42,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 2515 states and 3131 transitions. [2022-12-14 19:33:42,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2515 states and 3131 transitions. [2022-12-14 19:33:42,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2022-12-14 19:33:42,651 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:33:42,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:33:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:33:42,881 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 228 proven. 38 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 19:33:43,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:33:43,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 2520 states and 3137 transitions. [2022-12-14 19:33:43,736 INFO L276 IsEmpty]: Start isEmpty. Operand 2520 states and 3137 transitions. [2022-12-14 19:33:43,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2022-12-14 19:33:43,737 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:33:43,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:33:43,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:33:44,387 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 174 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:33:49,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:33:49,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3196 states to 2570 states and 3196 transitions. [2022-12-14 19:33:49,656 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 3196 transitions. [2022-12-14 19:33:49,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2022-12-14 19:33:49,657 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:33:49,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:33:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:33:49,944 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 174 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:33:50,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:33:50,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3199 states to 2573 states and 3199 transitions. [2022-12-14 19:33:50,851 INFO L276 IsEmpty]: Start isEmpty. Operand 2573 states and 3199 transitions. [2022-12-14 19:33:50,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2022-12-14 19:33:50,852 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:33:50,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:33:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:33:50,967 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-12-14 19:33:51,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:33:51,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3203 states to 2574 states and 3203 transitions. [2022-12-14 19:33:51,763 INFO L276 IsEmpty]: Start isEmpty. Operand 2574 states and 3203 transitions. [2022-12-14 19:33:51,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2022-12-14 19:33:51,764 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:33:51,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:33:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:33:51,942 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 216 proven. 6 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-12-14 19:33:54,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:33:54,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3218 states to 2585 states and 3218 transitions. [2022-12-14 19:33:54,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2585 states and 3218 transitions. [2022-12-14 19:33:54,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2022-12-14 19:33:54,484 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:33:54,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:33:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:33:54,615 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 94 proven. 162 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-12-14 19:33:54,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:33:54,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3218 states to 2586 states and 3218 transitions. [2022-12-14 19:33:54,709 INFO L276 IsEmpty]: Start isEmpty. Operand 2586 states and 3218 transitions. [2022-12-14 19:33:54,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2022-12-14 19:33:54,710 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:33:54,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:33:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:33:54,836 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 268 proven. 6 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 19:33:55,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:33:55,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3221 states to 2591 states and 3221 transitions. [2022-12-14 19:33:55,346 INFO L276 IsEmpty]: Start isEmpty. Operand 2591 states and 3221 transitions. [2022-12-14 19:33:55,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2022-12-14 19:33:55,348 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:33:55,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:33:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:33:55,461 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 268 proven. 6 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 19:33:55,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:33:55,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3223 states to 2592 states and 3223 transitions. [2022-12-14 19:33:55,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2592 states and 3223 transitions. [2022-12-14 19:33:55,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2022-12-14 19:33:55,935 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:33:55,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:33:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:33:56,047 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 268 proven. 6 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 19:33:59,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:33:59,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3239 states to 2605 states and 3239 transitions. [2022-12-14 19:33:59,059 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 3239 transitions. [2022-12-14 19:33:59,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-12-14 19:33:59,061 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:33:59,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:33:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:33:59,147 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2022-12-14 19:33:59,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:33:59,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3240 states to 2607 states and 3240 transitions. [2022-12-14 19:33:59,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2607 states and 3240 transitions. [2022-12-14 19:33:59,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-12-14 19:33:59,677 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:33:59,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:33:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:33:59,775 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 19:34:01,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:34:01,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3254 states to 2615 states and 3254 transitions. [2022-12-14 19:34:01,936 INFO L276 IsEmpty]: Start isEmpty. Operand 2615 states and 3254 transitions. [2022-12-14 19:34:01,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-12-14 19:34:01,938 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:34:01,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:34:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:34:02,042 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 19:34:02,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:34:02,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3259 states to 2616 states and 3259 transitions. [2022-12-14 19:34:02,702 INFO L276 IsEmpty]: Start isEmpty. Operand 2616 states and 3259 transitions. [2022-12-14 19:34:02,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2022-12-14 19:34:02,703 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:34:02,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:34:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:34:02,965 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 231 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 19:34:05,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:34:05,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3282 states to 2632 states and 3282 transitions. [2022-12-14 19:34:05,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2632 states and 3282 transitions. [2022-12-14 19:34:05,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2022-12-14 19:34:05,439 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:34:05,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:34:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:34:05,693 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 231 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 19:34:06,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:34:06,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3290 states to 2640 states and 3290 transitions. [2022-12-14 19:34:06,744 INFO L276 IsEmpty]: Start isEmpty. Operand 2640 states and 3290 transitions. [2022-12-14 19:34:06,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2022-12-14 19:34:06,746 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:34:06,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:34:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:34:07,062 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 228 proven. 65 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-12-14 19:34:08,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:34:08,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3294 states to 2644 states and 3294 transitions. [2022-12-14 19:34:08,713 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3294 transitions. [2022-12-14 19:34:08,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2022-12-14 19:34:08,714 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:34:08,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:34:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:34:08,960 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 228 proven. 65 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-12-14 19:34:09,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:34:09,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3289 states to 2640 states and 3289 transitions. [2022-12-14 19:34:09,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2640 states and 3289 transitions. [2022-12-14 19:34:09,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2022-12-14 19:34:09,636 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:34:09,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:34:09,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:34:09,771 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-12-14 19:34:13,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:34:13,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3308 states to 2652 states and 3308 transitions. [2022-12-14 19:34:13,169 INFO L276 IsEmpty]: Start isEmpty. Operand 2652 states and 3308 transitions. [2022-12-14 19:34:13,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2022-12-14 19:34:13,171 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:34:13,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:34:13,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:34:13,259 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-12-14 19:34:14,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:34:14,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3311 states to 2655 states and 3311 transitions. [2022-12-14 19:34:14,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2655 states and 3311 transitions. [2022-12-14 19:34:14,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2022-12-14 19:34:14,168 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:34:14,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:34:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:34:14,759 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 19:34:20,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:34:20,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3360 states to 2694 states and 3360 transitions. [2022-12-14 19:34:20,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2694 states and 3360 transitions. [2022-12-14 19:34:20,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2022-12-14 19:34:20,557 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:34:20,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:34:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:34:20,904 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 19:34:28,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:34:28,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3401 states to 2726 states and 3401 transitions. [2022-12-14 19:34:28,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2726 states and 3401 transitions. [2022-12-14 19:34:28,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2022-12-14 19:34:28,293 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:34:28,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:34:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:34:28,453 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 249 proven. 58 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 19:34:28,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:34:28,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3403 states to 2728 states and 3403 transitions. [2022-12-14 19:34:28,529 INFO L276 IsEmpty]: Start isEmpty. Operand 2728 states and 3403 transitions. [2022-12-14 19:34:28,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2022-12-14 19:34:28,530 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:34:28,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:34:28,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:34:28,837 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-12-14 19:34:29,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:34:29,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3403 states to 2729 states and 3403 transitions. [2022-12-14 19:34:29,409 INFO L276 IsEmpty]: Start isEmpty. Operand 2729 states and 3403 transitions. [2022-12-14 19:34:29,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2022-12-14 19:34:29,411 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:34:29,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:34:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:34:29,766 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 190 proven. 102 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-12-14 19:34:31,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:34:31,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3407 states to 2732 states and 3407 transitions. [2022-12-14 19:34:31,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2732 states and 3407 transitions. [2022-12-14 19:34:31,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2022-12-14 19:34:31,414 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:34:31,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:34:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:34:31,711 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 190 proven. 102 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-12-14 19:34:36,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:34:36,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3426 states to 2749 states and 3426 transitions. [2022-12-14 19:34:36,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2749 states and 3426 transitions. [2022-12-14 19:34:36,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2022-12-14 19:34:36,094 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:34:36,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:34:36,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:34:36,391 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 190 proven. 102 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-12-14 19:34:37,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:34:37,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3432 states to 2753 states and 3432 transitions. [2022-12-14 19:34:37,929 INFO L276 IsEmpty]: Start isEmpty. Operand 2753 states and 3432 transitions. [2022-12-14 19:34:37,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2022-12-14 19:34:37,930 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:34:37,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:34:38,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:34:38,303 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 190 proven. 102 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-12-14 19:34:39,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:34:39,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3433 states to 2755 states and 3433 transitions. [2022-12-14 19:34:39,258 INFO L276 IsEmpty]: Start isEmpty. Operand 2755 states and 3433 transitions. [2022-12-14 19:34:39,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2022-12-14 19:34:39,259 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:34:39,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:34:39,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:34:39,330 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-12-14 19:34:40,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:34:40,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3434 states to 2756 states and 3434 transitions. [2022-12-14 19:34:40,122 INFO L276 IsEmpty]: Start isEmpty. Operand 2756 states and 3434 transitions. [2022-12-14 19:34:40,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-12-14 19:34:40,124 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:34:40,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:34:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:34:40,194 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-12-14 19:34:42,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:34:42,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3444 states to 2763 states and 3444 transitions. [2022-12-14 19:34:42,594 INFO L276 IsEmpty]: Start isEmpty. Operand 2763 states and 3444 transitions. [2022-12-14 19:34:42,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-12-14 19:34:42,596 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:34:42,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:34:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:34:42,666 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-12-14 19:34:43,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:34:43,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3450 states to 2768 states and 3450 transitions. [2022-12-14 19:34:43,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2768 states and 3450 transitions. [2022-12-14 19:34:43,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-12-14 19:34:43,495 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:34:43,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:34:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:34:43,729 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 246 proven. 58 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 19:34:46,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:34:46,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3472 states to 2784 states and 3472 transitions. [2022-12-14 19:34:46,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 3472 transitions. [2022-12-14 19:34:46,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-12-14 19:34:46,531 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:34:46,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:34:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:34:46,763 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 246 proven. 58 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 19:34:48,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:34:48,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3492 states to 2799 states and 3492 transitions. [2022-12-14 19:34:48,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2799 states and 3492 transitions. [2022-12-14 19:34:48,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-12-14 19:34:48,608 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:34:48,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:34:48,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:34:48,841 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 246 proven. 58 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 19:34:49,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:34:49,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3501 states to 2809 states and 3501 transitions. [2022-12-14 19:34:49,666 INFO L276 IsEmpty]: Start isEmpty. Operand 2809 states and 3501 transitions. [2022-12-14 19:34:49,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2022-12-14 19:34:49,668 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:34:49,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:34:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:34:49,741 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2022-12-14 19:34:50,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:34:50,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3503 states to 2811 states and 3503 transitions. [2022-12-14 19:34:50,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2811 states and 3503 transitions. [2022-12-14 19:34:50,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2022-12-14 19:34:50,437 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:34:50,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:34:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:34:50,543 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-12-14 19:34:53,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:34:53,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3534 states to 2821 states and 3534 transitions. [2022-12-14 19:34:53,974 INFO L276 IsEmpty]: Start isEmpty. Operand 2821 states and 3534 transitions. [2022-12-14 19:34:53,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2022-12-14 19:34:53,975 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:34:53,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:34:53,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:34:54,173 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-12-14 19:34:56,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:34:56,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3543 states to 2828 states and 3543 transitions. [2022-12-14 19:34:56,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 3543 transitions. [2022-12-14 19:34:56,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2022-12-14 19:34:56,051 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:34:56,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:34:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 19:34:56,080 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 19:34:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 19:34:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 19:34:56,310 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 19:34:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 19:34:56,414 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 219 iterations. [2022-12-14 19:34:56,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 14.12 07:34:56 ImpRootNode [2022-12-14 19:34:56,555 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-12-14 19:34:56,556 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 19:34:56,556 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 19:34:56,556 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 19:34:56,556 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:30:43" (3/4) ... [2022-12-14 19:34:56,558 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 19:34:56,711 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85642e45-7cd3-490d-bfef-89d17a56e12d/bin/ukojak-rkRKPMF4O4/witness.graphml [2022-12-14 19:34:56,712 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 19:34:56,712 INFO L158 Benchmark]: Toolchain (without parser) took 254131.76ms. Allocated memory was 134.2MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 91.7MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 900.3MB. Max. memory is 16.1GB. [2022-12-14 19:34:56,712 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 134.2MB. Free memory is still 103.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 19:34:56,713 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.35ms. Allocated memory is still 134.2MB. Free memory was 91.5MB in the beginning and 63.5MB in the end (delta: 28.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-12-14 19:34:56,713 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.05ms. Allocated memory is still 134.2MB. Free memory was 63.5MB in the beginning and 58.0MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 19:34:56,713 INFO L158 Benchmark]: Boogie Preprocessor took 38.60ms. Allocated memory is still 134.2MB. Free memory was 58.0MB in the beginning and 53.4MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-14 19:34:56,714 INFO L158 Benchmark]: RCFGBuilder took 990.82ms. Allocated memory was 134.2MB in the beginning and 163.6MB in the end (delta: 29.4MB). Free memory was 53.4MB in the beginning and 89.9MB in the end (delta: -36.5MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. [2022-12-14 19:34:56,714 INFO L158 Benchmark]: CodeCheck took 252555.40ms. Allocated memory was 163.6MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 89.9MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 844.2MB. Max. memory is 16.1GB. [2022-12-14 19:34:56,715 INFO L158 Benchmark]: Witness Printer took 155.86ms. Allocated memory is still 2.2GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-12-14 19:34:56,716 INFO L339 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: 252.4s, OverallIterations: 219, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 771175 SdHoareTripleChecker+Valid, 1390.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 769011 mSDsluCounter, 122726 SdHoareTripleChecker+Invalid, 1197.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 106040 mSDsCounter, 180699 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1651862 IncrementalHoareTripleChecker+Invalid, 1832561 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 180699 mSolverCounterUnsat, 16686 mSDtfsCounter, 1651862 mSolverCounterSat, 9.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 284015 GetRequests, 271010 SyntacticMatches, 11271 SemanticMatches, 1734 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1970876 ImplicationChecksByTransitivity, 195.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 1.0s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 30.4s InterpolantComputationTime, 42406 NumberOfCodeBlocks, 42406 NumberOfCodeBlocksAsserted, 219 NumberOfCheckSat, 41923 ConstructedInterpolants, 0 QuantifiedInterpolants, 225330 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 218 InterpolantComputations, 113 PerfectInterpolantSequences, 40812/46451 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 [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, output=-1, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, \result=21, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, \result=21, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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 [\old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=4, \result=26, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=1, \result=26, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(input)=1, \result=-1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, 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 [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L411] reach_error() VAL [\old(input)=1, a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, 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.19ms. Allocated memory is still 134.2MB. Free memory is still 103.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 339.35ms. Allocated memory is still 134.2MB. Free memory was 91.5MB in the beginning and 63.5MB in the end (delta: 28.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.05ms. Allocated memory is still 134.2MB. Free memory was 63.5MB in the beginning and 58.0MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.60ms. Allocated memory is still 134.2MB. Free memory was 58.0MB in the beginning and 53.4MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 990.82ms. Allocated memory was 134.2MB in the beginning and 163.6MB in the end (delta: 29.4MB). Free memory was 53.4MB in the beginning and 89.9MB in the end (delta: -36.5MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. * CodeCheck took 252555.40ms. Allocated memory was 163.6MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 89.9MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 844.2MB. Max. memory is 16.1GB. * Witness Printer took 155.86ms. Allocated memory is still 2.2GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2022-12-14 19:34:56,736 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85642e45-7cd3-490d-bfef-89d17a56e12d/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE