./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label21.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3ac879-5aa0-4f3b-89a8-845bcb42aefc/bin/ukojak-rkRKPMF4O4/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3ac879-5aa0-4f3b-89a8-845bcb42aefc/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_ee3ac879-5aa0-4f3b-89a8-845bcb42aefc/bin/ukojak-rkRKPMF4O4/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3ac879-5aa0-4f3b-89a8-845bcb42aefc/bin/ukojak-rkRKPMF4O4/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label21.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3ac879-5aa0-4f3b-89a8-845bcb42aefc/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_ee3ac879-5aa0-4f3b-89a8-845bcb42aefc/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 7fc08bc6eca06c500d742b65350dc2aa3c19e672662fd614514fbc6bd34af0fd --- 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 21:14:14,192 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 21:14:14,193 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 21:14:14,209 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 21:14:14,209 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 21:14:14,210 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 21:14:14,210 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 21:14:14,212 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 21:14:14,213 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 21:14:14,214 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 21:14:14,215 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 21:14:14,215 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 21:14:14,216 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 21:14:14,216 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 21:14:14,217 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 21:14:14,218 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 21:14:14,219 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 21:14:14,219 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 21:14:14,220 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 21:14:14,222 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 21:14:14,223 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 21:14:14,224 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 21:14:14,224 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 21:14:14,225 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 21:14:14,228 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 21:14:14,228 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 21:14:14,228 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 21:14:14,229 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 21:14:14,229 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 21:14:14,230 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 21:14:14,230 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 21:14:14,231 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 21:14:14,231 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 21:14:14,232 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 21:14:14,232 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 21:14:14,233 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 21:14:14,233 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 21:14:14,233 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 21:14:14,233 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 21:14:14,234 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 21:14:14,234 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 21:14:14,235 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3ac879-5aa0-4f3b-89a8-845bcb42aefc/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-12-14 21:14:14,253 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 21:14:14,253 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 21:14:14,254 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 21:14:14,254 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-12-14 21:14:14,254 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 21:14:14,254 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 21:14:14,254 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 21:14:14,255 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 21:14:14,255 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 21:14:14,255 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 21:14:14,255 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 21:14:14,255 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 21:14:14,255 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 21:14:14,255 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 21:14:14,255 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 21:14:14,255 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 21:14:14,256 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 21:14:14,256 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 21:14:14,256 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-12-14 21:14:14,256 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-12-14 21:14:14,256 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 21:14:14,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 21:14:14,256 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 21:14:14,256 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 21:14:14,256 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 21:14:14,257 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-12-14 21:14:14,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 21:14:14,257 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 21:14:14,257 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_ee3ac879-5aa0-4f3b-89a8-845bcb42aefc/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_ee3ac879-5aa0-4f3b-89a8-845bcb42aefc/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 -> 7fc08bc6eca06c500d742b65350dc2aa3c19e672662fd614514fbc6bd34af0fd [2022-12-14 21:14:14,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 21:14:14,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 21:14:14,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 21:14:14,444 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 21:14:14,444 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 21:14:14,445 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3ac879-5aa0-4f3b-89a8-845bcb42aefc/bin/ukojak-rkRKPMF4O4/../../sv-benchmarks/c/eca-rers2012/Problem01_label21.c [2022-12-14 21:14:16,931 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 21:14:17,164 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 21:14:17,164 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3ac879-5aa0-4f3b-89a8-845bcb42aefc/sv-benchmarks/c/eca-rers2012/Problem01_label21.c [2022-12-14 21:14:17,174 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3ac879-5aa0-4f3b-89a8-845bcb42aefc/bin/ukojak-rkRKPMF4O4/data/5cdc2df07/15906c3c657b48d0a26f6d2886deb0c1/FLAG9b1ec5a91 [2022-12-14 21:14:17,532 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3ac879-5aa0-4f3b-89a8-845bcb42aefc/bin/ukojak-rkRKPMF4O4/data/5cdc2df07/15906c3c657b48d0a26f6d2886deb0c1 [2022-12-14 21:14:17,539 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 21:14:17,543 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 21:14:17,546 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 21:14:17,546 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 21:14:17,555 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 21:14:17,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:14:17" (1/1) ... [2022-12-14 21:14:17,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58d2068a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:14:17, skipping insertion in model container [2022-12-14 21:14:17,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:14:17" (1/1) ... [2022-12-14 21:14:17,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 21:14:17,602 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 21:14:17,789 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_ee3ac879-5aa0-4f3b-89a8-845bcb42aefc/sv-benchmarks/c/eca-rers2012/Problem01_label21.c[15876,15889] [2022-12-14 21:14:17,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 21:14:17,826 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 21:14:17,884 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_ee3ac879-5aa0-4f3b-89a8-845bcb42aefc/sv-benchmarks/c/eca-rers2012/Problem01_label21.c[15876,15889] [2022-12-14 21:14:17,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 21:14:17,909 INFO L208 MainTranslator]: Completed translation [2022-12-14 21:14:17,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:14:17 WrapperNode [2022-12-14 21:14:17,910 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 21:14:17,911 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 21:14:17,911 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 21:14:17,911 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 21:14:17,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:14:17" (1/1) ... [2022-12-14 21:14:17,928 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:14:17" (1/1) ... [2022-12-14 21:14:17,959 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2022-12-14 21:14:17,960 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 21:14:17,960 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 21:14:17,960 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 21:14:17,960 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 21:14:17,967 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:14:17" (1/1) ... [2022-12-14 21:14:17,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:14:17" (1/1) ... [2022-12-14 21:14:17,970 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:14:17" (1/1) ... [2022-12-14 21:14:17,971 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:14:17" (1/1) ... [2022-12-14 21:14:17,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:14:17" (1/1) ... [2022-12-14 21:14:17,987 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:14:17" (1/1) ... [2022-12-14 21:14:17,991 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:14:17" (1/1) ... [2022-12-14 21:14:17,994 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:14:17" (1/1) ... [2022-12-14 21:14:18,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 21:14:18,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 21:14:18,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 21:14:18,008 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 21:14:18,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:14:17" (1/1) ... [2022-12-14 21:14:18,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 21:14:18,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3ac879-5aa0-4f3b-89a8-845bcb42aefc/bin/ukojak-rkRKPMF4O4/z3 [2022-12-14 21:14:18,032 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3ac879-5aa0-4f3b-89a8-845bcb42aefc/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-12-14 21:14:18,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3ac879-5aa0-4f3b-89a8-845bcb42aefc/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-12-14 21:14:18,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 21:14:18,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 21:14:18,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 21:14:18,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 21:14:18,133 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 21:14:18,134 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 21:14:18,839 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 21:14:18,997 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 21:14:18,997 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 21:14:18,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:14:18 BoogieIcfgContainer [2022-12-14 21:14:18,999 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 21:14:19,000 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-12-14 21:14:19,000 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-12-14 21:14:19,007 INFO L275 PluginConnector]: CodeCheck initialized [2022-12-14 21:14:19,007 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:14:18" (1/1) ... [2022-12-14 21:14:19,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 21:14:19,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:19,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2022-12-14 21:14:19,054 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2022-12-14 21:14:19,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-14 21:14:19,057 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:19,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:19,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:19,287 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 21:14:19,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:19,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 145 states and 231 transitions. [2022-12-14 21:14:19,655 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 231 transitions. [2022-12-14 21:14:19,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-14 21:14:19,658 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:19,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:19,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:14:20,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:20,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 215 states and 304 transitions. [2022-12-14 21:14:20,250 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 304 transitions. [2022-12-14 21:14:20,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-12-14 21:14:20,251 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:20,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:20,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 21:14:20,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:20,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 216 states and 305 transitions. [2022-12-14 21:14:20,428 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 305 transitions. [2022-12-14 21:14:20,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-12-14 21:14:20,429 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:20,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:20,505 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:14:20,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:20,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 231 states and 323 transitions. [2022-12-14 21:14:20,620 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 323 transitions. [2022-12-14 21:14:20,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-12-14 21:14:20,621 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:20,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:20,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:20,717 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:14:20,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:20,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 232 states and 337 transitions. [2022-12-14 21:14:20,866 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 337 transitions. [2022-12-14 21:14:20,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-12-14 21:14:20,868 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:20,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:20,926 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:14:20,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:20,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 237 states and 342 transitions. [2022-12-14 21:14:20,977 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 342 transitions. [2022-12-14 21:14:20,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-12-14 21:14:20,978 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:20,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:21,045 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:14:21,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:21,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 253 states and 363 transitions. [2022-12-14 21:14:21,270 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 363 transitions. [2022-12-14 21:14:21,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-12-14 21:14:21,271 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:21,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:21,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:21,329 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:14:21,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:21,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 279 states and 394 transitions. [2022-12-14 21:14:21,568 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 394 transitions. [2022-12-14 21:14:21,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-14 21:14:21,569 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:21,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:21,701 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-14 21:14:22,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:22,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 290 states and 412 transitions. [2022-12-14 21:14:22,013 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 412 transitions. [2022-12-14 21:14:22,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-14 21:14:22,014 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:22,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:22,061 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 21:14:22,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:22,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 311 states and 436 transitions. [2022-12-14 21:14:22,399 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 436 transitions. [2022-12-14 21:14:22,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-12-14 21:14:22,400 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:22,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:22,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:22,470 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 21:14:22,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:22,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 320 states and 449 transitions. [2022-12-14 21:14:22,797 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 449 transitions. [2022-12-14 21:14:22,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-12-14 21:14:22,798 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:22,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:22,919 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 21:14:23,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:23,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 323 states and 454 transitions. [2022-12-14 21:14:23,166 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 454 transitions. [2022-12-14 21:14:23,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-12-14 21:14:23,168 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:23,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:23,281 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 21:14:23,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:23,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 334 states and 465 transitions. [2022-12-14 21:14:23,430 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 465 transitions. [2022-12-14 21:14:23,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-12-14 21:14:23,431 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:23,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:23,488 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 21:14:23,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:23,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 346 states and 482 transitions. [2022-12-14 21:14:23,955 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 482 transitions. [2022-12-14 21:14:23,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-12-14 21:14:23,955 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:23,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:24,018 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 21:14:24,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:24,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 348 states and 485 transitions. [2022-12-14 21:14:24,096 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 485 transitions. [2022-12-14 21:14:24,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-12-14 21:14:24,096 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:24,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:24,256 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 21:14:24,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:24,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 351 states and 488 transitions. [2022-12-14 21:14:24,417 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 488 transitions. [2022-12-14 21:14:24,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-12-14 21:14:24,418 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:24,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:24,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:24,487 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-14 21:14:24,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:24,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 352 states and 490 transitions. [2022-12-14 21:14:24,647 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 490 transitions. [2022-12-14 21:14:24,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-14 21:14:24,648 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:24,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:24,687 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:14:24,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:24,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 366 states and 504 transitions. [2022-12-14 21:14:24,757 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 504 transitions. [2022-12-14 21:14:24,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-12-14 21:14:24,758 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:24,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:24,798 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-14 21:14:24,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:24,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 373 states and 512 transitions. [2022-12-14 21:14:24,838 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 512 transitions. [2022-12-14 21:14:24,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-12-14 21:14:24,838 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:24,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:24,874 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-14 21:14:24,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:24,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 374 states and 513 transitions. [2022-12-14 21:14:24,903 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 513 transitions. [2022-12-14 21:14:24,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-12-14 21:14:24,904 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:24,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:24,959 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 21:14:25,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:25,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 383 states and 523 transitions. [2022-12-14 21:14:25,012 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 523 transitions. [2022-12-14 21:14:25,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-14 21:14:25,013 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:25,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:25,079 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:14:25,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:25,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 407 states and 548 transitions. [2022-12-14 21:14:25,182 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 548 transitions. [2022-12-14 21:14:25,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-12-14 21:14:25,183 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:25,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:25,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:25,264 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:14:25,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:25,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 440 states and 583 transitions. [2022-12-14 21:14:25,724 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 583 transitions. [2022-12-14 21:14:25,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-12-14 21:14:25,725 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:25,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:25,811 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-14 21:14:26,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:26,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 462 states and 607 transitions. [2022-12-14 21:14:26,137 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 607 transitions. [2022-12-14 21:14:26,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-12-14 21:14:26,138 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:26,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:26,180 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-14 21:14:26,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:26,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 463 states and 609 transitions. [2022-12-14 21:14:26,205 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 609 transitions. [2022-12-14 21:14:26,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-12-14 21:14:26,206 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:26,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:26,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:26,291 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 21:14:26,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:26,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 479 states and 640 transitions. [2022-12-14 21:14:26,626 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 640 transitions. [2022-12-14 21:14:26,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-12-14 21:14:26,627 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:26,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:26,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:26,688 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:14:26,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:26,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 508 states and 671 transitions. [2022-12-14 21:14:26,852 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 671 transitions. [2022-12-14 21:14:26,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-12-14 21:14:26,853 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:26,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:26,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:26,898 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-14 21:14:26,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:26,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 510 states and 673 transitions. [2022-12-14 21:14:26,924 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 673 transitions. [2022-12-14 21:14:26,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-12-14 21:14:26,925 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:26,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:26,998 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 21:14:27,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:27,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 554 states and 719 transitions. [2022-12-14 21:14:27,326 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 719 transitions. [2022-12-14 21:14:27,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-12-14 21:14:27,326 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:27,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:27,409 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 21:14:27,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:27,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 570 states and 760 transitions. [2022-12-14 21:14:27,697 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 760 transitions. [2022-12-14 21:14:27,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-12-14 21:14:27,698 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:27,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:27,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:27,748 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 21:14:28,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:28,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 603 states and 801 transitions. [2022-12-14 21:14:28,346 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 801 transitions. [2022-12-14 21:14:28,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-12-14 21:14:28,347 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:28,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:28,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:28,436 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-12-14 21:14:28,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:28,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 608 states and 806 transitions. [2022-12-14 21:14:28,603 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 806 transitions. [2022-12-14 21:14:28,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-12-14 21:14:28,604 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:28,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:28,646 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 21:14:28,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:28,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 611 states and 810 transitions. [2022-12-14 21:14:28,833 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 810 transitions. [2022-12-14 21:14:28,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-12-14 21:14:28,834 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:28,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:28,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:28,939 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 21:14:29,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:29,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 612 states and 811 transitions. [2022-12-14 21:14:29,124 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 811 transitions. [2022-12-14 21:14:29,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-12-14 21:14:29,125 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:29,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:29,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:29,165 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-14 21:14:29,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:29,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 613 states and 811 transitions. [2022-12-14 21:14:29,242 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 811 transitions. [2022-12-14 21:14:29,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-12-14 21:14:29,243 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:29,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:29,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:29,321 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:14:29,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:29,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 641 states and 842 transitions. [2022-12-14 21:14:29,703 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 842 transitions. [2022-12-14 21:14:29,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-12-14 21:14:29,703 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:29,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:29,756 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 21:14:29,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:29,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 642 states and 846 transitions. [2022-12-14 21:14:29,798 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 846 transitions. [2022-12-14 21:14:29,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-12-14 21:14:29,799 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:29,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:29,876 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 21:14:30,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:30,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 679 states and 884 transitions. [2022-12-14 21:14:30,121 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 884 transitions. [2022-12-14 21:14:30,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-12-14 21:14:30,121 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:30,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:30,166 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 21:14:30,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:30,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 680 states and 884 transitions. [2022-12-14 21:14:30,324 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 884 transitions. [2022-12-14 21:14:30,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-12-14 21:14:30,324 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:30,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:30,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:30,381 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-12-14 21:14:30,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:30,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 681 states and 884 transitions. [2022-12-14 21:14:30,422 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 884 transitions. [2022-12-14 21:14:30,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-12-14 21:14:30,422 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:30,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:30,534 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:14:30,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:30,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 725 states and 929 transitions. [2022-12-14 21:14:30,907 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 929 transitions. [2022-12-14 21:14:30,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-12-14 21:14:30,907 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:30,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:31,096 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 96 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 21:14:32,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:32,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 780 states and 996 transitions. [2022-12-14 21:14:32,187 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 996 transitions. [2022-12-14 21:14:32,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-12-14 21:14:32,188 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:32,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:32,232 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-14 21:14:32,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:32,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 783 states and 998 transitions. [2022-12-14 21:14:32,304 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 998 transitions. [2022-12-14 21:14:32,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-12-14 21:14:32,305 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:32,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:32,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:32,364 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 21:14:32,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:32,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 807 states and 1028 transitions. [2022-12-14 21:14:32,639 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1028 transitions. [2022-12-14 21:14:32,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-12-14 21:14:32,640 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:32,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:32,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:32,760 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 21:14:32,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:32,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 809 states and 1030 transitions. [2022-12-14 21:14:32,934 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1030 transitions. [2022-12-14 21:14:32,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-12-14 21:14:32,935 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:32,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:33,035 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-12-14 21:14:33,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:33,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 812 states and 1033 transitions. [2022-12-14 21:14:33,176 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1033 transitions. [2022-12-14 21:14:33,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-12-14 21:14:33,177 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:33,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:33,279 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-12-14 21:14:33,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:33,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 815 states and 1036 transitions. [2022-12-14 21:14:33,353 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1036 transitions. [2022-12-14 21:14:33,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-12-14 21:14:33,354 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:33,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:33,404 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 21:14:33,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:33,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 822 states and 1044 transitions. [2022-12-14 21:14:33,625 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1044 transitions. [2022-12-14 21:14:33,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-12-14 21:14:33,626 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:33,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:33,750 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-14 21:14:34,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:34,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 824 states and 1047 transitions. [2022-12-14 21:14:34,023 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1047 transitions. [2022-12-14 21:14:34,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-12-14 21:14:34,024 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:34,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:34,103 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-14 21:14:34,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:34,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 831 states and 1057 transitions. [2022-12-14 21:14:34,349 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1057 transitions. [2022-12-14 21:14:34,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-12-14 21:14:34,350 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:34,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:34,402 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 21:14:34,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:34,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 832 states and 1061 transitions. [2022-12-14 21:14:34,569 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1061 transitions. [2022-12-14 21:14:34,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-12-14 21:14:34,569 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:34,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:34,656 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-14 21:14:34,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:34,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 833 states and 1062 transitions. [2022-12-14 21:14:34,848 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1062 transitions. [2022-12-14 21:14:34,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-12-14 21:14:34,848 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:34,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:34,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:34,914 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 21:14:35,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:35,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 860 states and 1094 transitions. [2022-12-14 21:14:35,211 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1094 transitions. [2022-12-14 21:14:35,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-12-14 21:14:35,212 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:35,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:35,310 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 21:14:35,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:35,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 861 states and 1094 transitions. [2022-12-14 21:14:35,466 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1094 transitions. [2022-12-14 21:14:35,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-12-14 21:14:35,466 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:35,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:35,783 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 90 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:14:36,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:36,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 945 states and 1193 transitions. [2022-12-14 21:14:36,694 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1193 transitions. [2022-12-14 21:14:36,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-14 21:14:36,695 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:36,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:36,925 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 21:14:37,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:37,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1016 states and 1264 transitions. [2022-12-14 21:14:37,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1264 transitions. [2022-12-14 21:14:37,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-12-14 21:14:37,893 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:37,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:37,956 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-12-14 21:14:38,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:38,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1026 states and 1276 transitions. [2022-12-14 21:14:38,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1276 transitions. [2022-12-14 21:14:38,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-12-14 21:14:38,336 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:38,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:38,396 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-12-14 21:14:38,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:38,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1033 states and 1286 transitions. [2022-12-14 21:14:38,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1286 transitions. [2022-12-14 21:14:38,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-12-14 21:14:38,570 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:38,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:38,631 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-12-14 21:14:38,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:38,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1034 states and 1287 transitions. [2022-12-14 21:14:38,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1287 transitions. [2022-12-14 21:14:38,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-12-14 21:14:38,863 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:38,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:38,950 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 117 proven. 46 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 21:14:39,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:39,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1050 states and 1309 transitions. [2022-12-14 21:14:39,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1309 transitions. [2022-12-14 21:14:39,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-12-14 21:14:39,403 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:39,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:39,482 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 21:14:39,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:39,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1066 states and 1332 transitions. [2022-12-14 21:14:39,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1332 transitions. [2022-12-14 21:14:39,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-12-14 21:14:39,702 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:39,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:39,886 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 106 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 21:14:40,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:40,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1067 states and 1333 transitions. [2022-12-14 21:14:40,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1333 transitions. [2022-12-14 21:14:40,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-12-14 21:14:40,132 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:40,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:40,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:40,189 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-14 21:14:40,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:40,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1068 states and 1334 transitions. [2022-12-14 21:14:40,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1334 transitions. [2022-12-14 21:14:40,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-12-14 21:14:40,386 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:40,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:40,776 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 136 proven. 27 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-12-14 21:14:42,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:42,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1134 states and 1414 transitions. [2022-12-14 21:14:42,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1414 transitions. [2022-12-14 21:14:42,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-12-14 21:14:42,369 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:42,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:42,509 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 21:14:43,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:43,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1155 states and 1445 transitions. [2022-12-14 21:14:43,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1445 transitions. [2022-12-14 21:14:43,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-12-14 21:14:43,197 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:43,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:43,264 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 21:14:43,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:43,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463 states to 1170 states and 1463 transitions. [2022-12-14 21:14:43,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1463 transitions. [2022-12-14 21:14:43,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-12-14 21:14:43,497 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:43,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:43,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:43,676 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 136 proven. 27 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-12-14 21:14:43,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:43,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463 states to 1171 states and 1463 transitions. [2022-12-14 21:14:43,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1463 transitions. [2022-12-14 21:14:43,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-12-14 21:14:43,781 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:43,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:43,894 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 21:14:44,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:44,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1173 states and 1467 transitions. [2022-12-14 21:14:44,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1467 transitions. [2022-12-14 21:14:44,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-12-14 21:14:44,038 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:44,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:44,134 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 21:14:44,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:44,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1174 states and 1469 transitions. [2022-12-14 21:14:44,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1469 transitions. [2022-12-14 21:14:44,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-12-14 21:14:44,414 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:44,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:44,473 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 21:14:44,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:44,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1472 states to 1176 states and 1472 transitions. [2022-12-14 21:14:44,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1472 transitions. [2022-12-14 21:14:44,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-12-14 21:14:44,522 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:44,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:44,576 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 21:14:44,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:44,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1192 states and 1491 transitions. [2022-12-14 21:14:44,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1491 transitions. [2022-12-14 21:14:44,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-12-14 21:14:44,946 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:44,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:44,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:45,010 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 21:14:45,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:45,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1207 states and 1507 transitions. [2022-12-14 21:14:45,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1507 transitions. [2022-12-14 21:14:45,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-12-14 21:14:45,256 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:45,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:45,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:45,331 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-12-14 21:14:45,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:45,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1223 states and 1522 transitions. [2022-12-14 21:14:45,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1522 transitions. [2022-12-14 21:14:45,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-12-14 21:14:45,432 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:45,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:45,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:45,631 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 226 proven. 11 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-12-14 21:14:46,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:46,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1248 states and 1563 transitions. [2022-12-14 21:14:46,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1563 transitions. [2022-12-14 21:14:46,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-12-14 21:14:46,260 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:46,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:46,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:46,765 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 124 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:14:49,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:49,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1331 states and 1668 transitions. [2022-12-14 21:14:49,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1668 transitions. [2022-12-14 21:14:49,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-12-14 21:14:49,710 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:49,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:49,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:49,947 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 124 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:14:50,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:50,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1335 states and 1672 transitions. [2022-12-14 21:14:50,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 1672 transitions. [2022-12-14 21:14:50,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-12-14 21:14:50,482 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:50,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:50,672 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 124 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:14:50,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:50,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1338 states and 1674 transitions. [2022-12-14 21:14:50,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1674 transitions. [2022-12-14 21:14:50,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-12-14 21:14:50,960 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:50,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:51,168 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 149 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 21:14:52,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:52,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1372 states and 1715 transitions. [2022-12-14 21:14:52,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1715 transitions. [2022-12-14 21:14:52,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-12-14 21:14:52,758 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:52,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:53,011 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 149 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 21:14:53,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:53,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1377 states and 1724 transitions. [2022-12-14 21:14:53,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1724 transitions. [2022-12-14 21:14:53,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-12-14 21:14:53,800 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:53,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:53,973 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-12-14 21:14:55,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:55,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1424 states and 1781 transitions. [2022-12-14 21:14:55,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 1781 transitions. [2022-12-14 21:14:55,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-12-14 21:14:55,022 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:55,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:55,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:55,113 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 21:14:56,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:56,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1494 states and 1865 transitions. [2022-12-14 21:14:56,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1865 transitions. [2022-12-14 21:14:56,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-12-14 21:14:56,559 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:56,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:56,622 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-12-14 21:14:57,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:57,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1514 states and 1891 transitions. [2022-12-14 21:14:57,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1891 transitions. [2022-12-14 21:14:57,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-12-14 21:14:57,364 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:57,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:57,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:57,427 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-12-14 21:14:57,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:57,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1908 states to 1529 states and 1908 transitions. [2022-12-14 21:14:57,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 1908 transitions. [2022-12-14 21:14:57,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-12-14 21:14:57,761 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:57,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:57,882 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 21:14:59,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:14:59,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1944 states to 1565 states and 1944 transitions. [2022-12-14 21:14:59,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 1944 transitions. [2022-12-14 21:14:59,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-12-14 21:14:59,695 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:14:59,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:14:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:14:59,814 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 21:15:00,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:00,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1571 states and 1950 transitions. [2022-12-14 21:15:00,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 1950 transitions. [2022-12-14 21:15:00,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-12-14 21:15:00,256 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:00,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:00,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:00,361 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 21:15:00,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:00,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1572 states and 1950 transitions. [2022-12-14 21:15:00,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 1950 transitions. [2022-12-14 21:15:00,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-12-14 21:15:00,746 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:00,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:00,831 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-12-14 21:15:01,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:01,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1576 states and 1953 transitions. [2022-12-14 21:15:01,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1953 transitions. [2022-12-14 21:15:01,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-12-14 21:15:01,290 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:01,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:01,567 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 180 proven. 57 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 21:15:02,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:02,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1608 states and 1996 transitions. [2022-12-14 21:15:02,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 1996 transitions. [2022-12-14 21:15:02,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-12-14 21:15:02,949 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:02,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:03,035 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-12-14 21:15:04,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:04,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2040 states to 1645 states and 2040 transitions. [2022-12-14 21:15:04,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2040 transitions. [2022-12-14 21:15:04,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-12-14 21:15:04,090 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:04,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:04,246 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 180 proven. 57 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 21:15:04,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:04,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 1646 states and 2044 transitions. [2022-12-14 21:15:04,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 2044 transitions. [2022-12-14 21:15:04,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-12-14 21:15:04,571 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:04,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:04,725 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 180 proven. 57 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 21:15:05,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:05,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 1647 states and 2052 transitions. [2022-12-14 21:15:05,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2052 transitions. [2022-12-14 21:15:05,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-12-14 21:15:05,045 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:05,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:05,124 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-12-14 21:15:05,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:05,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2075 states to 1663 states and 2075 transitions. [2022-12-14 21:15:05,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 2075 transitions. [2022-12-14 21:15:05,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-12-14 21:15:05,639 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:05,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:05,885 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 181 proven. 57 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 21:15:06,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:06,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 1710 states and 2126 transitions. [2022-12-14 21:15:06,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2126 transitions. [2022-12-14 21:15:06,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-12-14 21:15:06,910 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:06,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:07,525 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 199 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 21:15:08,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:08,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 1779 states and 2206 transitions. [2022-12-14 21:15:08,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2206 transitions. [2022-12-14 21:15:08,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-12-14 21:15:08,771 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:08,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:08,845 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-12-14 21:15:08,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:08,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2208 states to 1781 states and 2208 transitions. [2022-12-14 21:15:08,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2208 transitions. [2022-12-14 21:15:08,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-12-14 21:15:08,940 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:08,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:09,014 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-12-14 21:15:09,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:09,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2208 states to 1782 states and 2208 transitions. [2022-12-14 21:15:09,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1782 states and 2208 transitions. [2022-12-14 21:15:09,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-12-14 21:15:09,267 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:09,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:09,435 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 179 proven. 57 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 21:15:11,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:11,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 1814 states and 2243 transitions. [2022-12-14 21:15:11,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1814 states and 2243 transitions. [2022-12-14 21:15:11,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-12-14 21:15:11,052 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:11,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:11,271 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 179 proven. 57 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 21:15:11,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:11,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 1815 states and 2245 transitions. [2022-12-14 21:15:11,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2245 transitions. [2022-12-14 21:15:11,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-12-14 21:15:11,757 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:11,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:11,864 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-12-14 21:15:12,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:12,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 1832 states and 2261 transitions. [2022-12-14 21:15:12,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 2261 transitions. [2022-12-14 21:15:12,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-12-14 21:15:12,496 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:12,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:12,742 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 248 proven. 27 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-14 21:15:13,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:13,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 1838 states and 2270 transitions. [2022-12-14 21:15:13,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2270 transitions. [2022-12-14 21:15:13,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-12-14 21:15:13,330 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:13,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:14,105 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 175 proven. 83 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 21:15:18,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:18,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2461 states to 1990 states and 2461 transitions. [2022-12-14 21:15:18,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 2461 transitions. [2022-12-14 21:15:18,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-12-14 21:15:18,735 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:18,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:18,957 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 21:15:19,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:19,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2464 states to 1992 states and 2464 transitions. [2022-12-14 21:15:19,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1992 states and 2464 transitions. [2022-12-14 21:15:19,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2022-12-14 21:15:19,174 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:19,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:19,648 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 185 proven. 88 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 21:15:20,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:20,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2543 states to 2066 states and 2543 transitions. [2022-12-14 21:15:20,854 INFO L276 IsEmpty]: Start isEmpty. Operand 2066 states and 2543 transitions. [2022-12-14 21:15:20,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-12-14 21:15:20,855 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:20,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:20,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:20,979 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-12-14 21:15:21,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:21,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2083 states and 2571 transitions. [2022-12-14 21:15:21,974 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 2571 transitions. [2022-12-14 21:15:21,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-12-14 21:15:21,975 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:21,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:22,051 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-12-14 21:15:22,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:22,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2085 states and 2578 transitions. [2022-12-14 21:15:22,404 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 2578 transitions. [2022-12-14 21:15:22,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-12-14 21:15:22,405 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:22,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:22,483 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-12-14 21:15:23,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:23,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2583 states to 2086 states and 2583 transitions. [2022-12-14 21:15:23,047 INFO L276 IsEmpty]: Start isEmpty. Operand 2086 states and 2583 transitions. [2022-12-14 21:15:23,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-12-14 21:15:23,049 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:23,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:23,126 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-12-14 21:15:23,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:23,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2588 states to 2087 states and 2588 transitions. [2022-12-14 21:15:23,640 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states and 2588 transitions. [2022-12-14 21:15:23,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-12-14 21:15:23,641 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:23,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:23,716 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-12-14 21:15:24,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:24,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2628 states to 2116 states and 2628 transitions. [2022-12-14 21:15:24,518 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 2628 transitions. [2022-12-14 21:15:24,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2022-12-14 21:15:24,519 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:24,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:24,811 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 160 proven. 92 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-12-14 21:15:26,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:26,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2654 states to 2137 states and 2654 transitions. [2022-12-14 21:15:26,132 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 2654 transitions. [2022-12-14 21:15:26,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2022-12-14 21:15:26,134 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:26,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:26,294 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 160 proven. 92 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-12-14 21:15:26,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:26,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2657 states to 2138 states and 2657 transitions. [2022-12-14 21:15:26,728 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 2657 transitions. [2022-12-14 21:15:26,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-12-14 21:15:26,729 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:26,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:27,502 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 198 proven. 111 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 21:15:30,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:30,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2730 states to 2196 states and 2730 transitions. [2022-12-14 21:15:30,116 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 2730 transitions. [2022-12-14 21:15:30,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-12-14 21:15:30,118 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:30,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:30,393 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 198 proven. 111 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 21:15:30,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:30,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2736 states to 2201 states and 2736 transitions. [2022-12-14 21:15:30,928 INFO L276 IsEmpty]: Start isEmpty. Operand 2201 states and 2736 transitions. [2022-12-14 21:15:30,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-12-14 21:15:30,929 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:30,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:31,203 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 198 proven. 111 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 21:15:31,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:31,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2743 states to 2206 states and 2743 transitions. [2022-12-14 21:15:31,727 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 2743 transitions. [2022-12-14 21:15:31,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-12-14 21:15:31,728 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:31,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:31,807 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-12-14 21:15:32,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:32,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2746 states to 2210 states and 2746 transitions. [2022-12-14 21:15:32,071 INFO L276 IsEmpty]: Start isEmpty. Operand 2210 states and 2746 transitions. [2022-12-14 21:15:32,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2022-12-14 21:15:32,072 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:32,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:32,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:32,151 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-12-14 21:15:33,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:33,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2767 states to 2228 states and 2767 transitions. [2022-12-14 21:15:33,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2767 transitions. [2022-12-14 21:15:33,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2022-12-14 21:15:33,154 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:33,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:33,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:33,233 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-12-14 21:15:33,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:33,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2782 states to 2243 states and 2782 transitions. [2022-12-14 21:15:33,683 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 2782 transitions. [2022-12-14 21:15:33,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-12-14 21:15:33,684 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:33,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:33,873 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-12-14 21:15:34,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:34,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2783 states to 2245 states and 2783 transitions. [2022-12-14 21:15:34,356 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 2783 transitions. [2022-12-14 21:15:34,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-12-14 21:15:34,357 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:34,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:35,766 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 230 proven. 89 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-12-14 21:15:37,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:37,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2803 states to 2264 states and 2803 transitions. [2022-12-14 21:15:37,805 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 2803 transitions. [2022-12-14 21:15:37,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2022-12-14 21:15:37,806 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:37,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:37,891 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-12-14 21:15:38,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:38,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2804 states to 2266 states and 2804 transitions. [2022-12-14 21:15:38,305 INFO L276 IsEmpty]: Start isEmpty. Operand 2266 states and 2804 transitions. [2022-12-14 21:15:38,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2022-12-14 21:15:38,306 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:38,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:38,423 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2022-12-14 21:15:39,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:39,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2816 states to 2279 states and 2816 transitions. [2022-12-14 21:15:39,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 2816 transitions. [2022-12-14 21:15:39,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2022-12-14 21:15:39,368 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:39,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:40,188 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 170 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:15:43,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:43,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2905 states to 2346 states and 2905 transitions. [2022-12-14 21:15:43,751 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 2905 transitions. [2022-12-14 21:15:43,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2022-12-14 21:15:43,752 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:43,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:43,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:43,872 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-12-14 21:15:44,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:44,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2923 states to 2360 states and 2923 transitions. [2022-12-14 21:15:44,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 2923 transitions. [2022-12-14 21:15:44,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2022-12-14 21:15:44,193 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:44,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:44,612 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-12-14 21:15:46,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:46,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2957 states to 2390 states and 2957 transitions. [2022-12-14 21:15:46,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 2957 transitions. [2022-12-14 21:15:46,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2022-12-14 21:15:46,903 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:46,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:47,096 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-12-14 21:15:47,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:47,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2973 states to 2406 states and 2973 transitions. [2022-12-14 21:15:47,774 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 2973 transitions. [2022-12-14 21:15:47,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2022-12-14 21:15:47,776 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:47,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:47,941 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 176 proven. 92 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-12-14 21:15:48,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:48,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2977 states to 2407 states and 2977 transitions. [2022-12-14 21:15:48,452 INFO L276 IsEmpty]: Start isEmpty. Operand 2407 states and 2977 transitions. [2022-12-14 21:15:48,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2022-12-14 21:15:48,454 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:48,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:48,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:48,551 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-12-14 21:15:48,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:48,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2981 states to 2409 states and 2981 transitions. [2022-12-14 21:15:48,853 INFO L276 IsEmpty]: Start isEmpty. Operand 2409 states and 2981 transitions. [2022-12-14 21:15:48,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2022-12-14 21:15:48,854 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:48,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:48,943 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-12-14 21:15:49,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:49,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2998 states to 2425 states and 2998 transitions. [2022-12-14 21:15:49,834 INFO L276 IsEmpty]: Start isEmpty. Operand 2425 states and 2998 transitions. [2022-12-14 21:15:49,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2022-12-14 21:15:49,836 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:49,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:49,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:49,920 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-12-14 21:15:50,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:50,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2998 states to 2426 states and 2998 transitions. [2022-12-14 21:15:50,335 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 2998 transitions. [2022-12-14 21:15:50,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2022-12-14 21:15:50,336 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:50,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:50,461 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-12-14 21:15:52,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:52,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3044 states to 2471 states and 3044 transitions. [2022-12-14 21:15:52,261 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 3044 transitions. [2022-12-14 21:15:52,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2022-12-14 21:15:52,262 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:52,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:52,539 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 82 proven. 261 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 21:15:53,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:53,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 2541 states and 3116 transitions. [2022-12-14 21:15:53,545 INFO L276 IsEmpty]: Start isEmpty. Operand 2541 states and 3116 transitions. [2022-12-14 21:15:53,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-12-14 21:15:53,547 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:53,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:53,690 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 21:15:56,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:56,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3195 states to 2609 states and 3195 transitions. [2022-12-14 21:15:56,621 INFO L276 IsEmpty]: Start isEmpty. Operand 2609 states and 3195 transitions. [2022-12-14 21:15:56,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-12-14 21:15:56,622 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:56,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:56,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:56,763 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 21:15:57,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:57,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3196 states to 2611 states and 3196 transitions. [2022-12-14 21:15:57,316 INFO L276 IsEmpty]: Start isEmpty. Operand 2611 states and 3196 transitions. [2022-12-14 21:15:57,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-12-14 21:15:57,317 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:57,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:57,493 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 21:15:58,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:58,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3221 states to 2634 states and 3221 transitions. [2022-12-14 21:15:58,063 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 3221 transitions. [2022-12-14 21:15:58,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-12-14 21:15:58,064 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:58,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:58,206 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 21:15:58,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:15:58,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3248 states to 2657 states and 3248 transitions. [2022-12-14 21:15:58,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2657 states and 3248 transitions. [2022-12-14 21:15:58,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2022-12-14 21:15:58,758 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:15:58,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:15:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:15:59,350 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 273 proven. 24 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-14 21:16:02,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:16:02,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3306 states to 2712 states and 3306 transitions. [2022-12-14 21:16:02,881 INFO L276 IsEmpty]: Start isEmpty. Operand 2712 states and 3306 transitions. [2022-12-14 21:16:02,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2022-12-14 21:16:02,882 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:16:02,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:16:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:16:03,153 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 273 proven. 24 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-14 21:16:03,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:16:03,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3306 states to 2713 states and 3306 transitions. [2022-12-14 21:16:03,622 INFO L276 IsEmpty]: Start isEmpty. Operand 2713 states and 3306 transitions. [2022-12-14 21:16:03,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2022-12-14 21:16:03,624 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:16:03,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:16:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 21:16:03,653 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 21:16:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 21:16:03,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 21:16:03,816 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 21:16:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 21:16:03,896 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 137 iterations. [2022-12-14 21:16:04,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 14.12 09:16:04 ImpRootNode [2022-12-14 21:16:04,040 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-12-14 21:16:04,041 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 21:16:04,041 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 21:16:04,041 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 21:16:04,041 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:14:18" (3/4) ... [2022-12-14 21:16:04,043 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 21:16:04,142 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3ac879-5aa0-4f3b-89a8-845bcb42aefc/bin/ukojak-rkRKPMF4O4/witness.graphml [2022-12-14 21:16:04,142 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 21:16:04,143 INFO L158 Benchmark]: Toolchain (without parser) took 106601.06ms. Allocated memory was 130.0MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 93.7MB in the beginning and 764.2MB in the end (delta: -670.6MB). Peak memory consumption was 550.9MB. Max. memory is 16.1GB. [2022-12-14 21:16:04,143 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 130.0MB. Free memory is still 73.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 21:16:04,143 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.55ms. Allocated memory is still 130.0MB. Free memory was 93.7MB in the beginning and 66.4MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-14 21:16:04,143 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.15ms. Allocated memory is still 130.0MB. Free memory was 66.4MB in the beginning and 60.6MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-14 21:16:04,143 INFO L158 Benchmark]: Boogie Preprocessor took 46.58ms. Allocated memory was 130.0MB in the beginning and 178.3MB in the end (delta: 48.2MB). Free memory was 60.6MB in the beginning and 146.6MB in the end (delta: -86.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-14 21:16:04,144 INFO L158 Benchmark]: RCFGBuilder took 991.82ms. Allocated memory is still 178.3MB. Free memory was 146.6MB in the beginning and 104.7MB in the end (delta: 41.9MB). Peak memory consumption was 87.4MB. Max. memory is 16.1GB. [2022-12-14 21:16:04,144 INFO L158 Benchmark]: CodeCheck took 105040.86ms. Allocated memory was 178.3MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 104.7MB in the beginning and 787.3MB in the end (delta: -682.6MB). Peak memory consumption was 488.7MB. Max. memory is 16.1GB. [2022-12-14 21:16:04,144 INFO L158 Benchmark]: Witness Printer took 101.34ms. Allocated memory is still 1.4GB. Free memory was 787.3MB in the beginning and 764.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-12-14 21:16:04,146 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: 104.9s, OverallIterations: 137, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 364904 SdHoareTripleChecker+Valid, 650.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 363823 mSDsluCounter, 82535 SdHoareTripleChecker+Invalid, 559.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 74471 mSDsCounter, 97760 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 779988 IncrementalHoareTripleChecker+Invalid, 877748 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97760 mSolverCounterUnsat, 8064 mSDtfsCounter, 779988 mSolverCounterSat, 4.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 159837 GetRequests, 155515 SyntacticMatches, 3316 SemanticMatches, 1006 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681636 ImplicationChecksByTransitivity, 71.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.7s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 18.2s InterpolantComputationTime, 23961 NumberOfCodeBlocks, 23961 NumberOfCodeBlocksAsserted, 137 NumberOfCheckSat, 23570 ConstructedInterpolants, 0 QuantifiedInterpolants, 84104 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 136 InterpolantComputations, 103 PerfectInterpolantSequences, 22259/24354 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: 435]: 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, 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)=5, 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=5, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND TRUE ((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))))))) [L393] a20 = 0 [L394] a21 = 1 [L395] a8 = 14 [L396] a17 = 0 [L397] a16 = 5 [L398] a7 = 1 [L399] return -1; VAL [\old(input)=5, \result=-1, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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))) [L410] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L413] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L416] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L419] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L422] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L425] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L428] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L431] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L434] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1)) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L435] reach_error() VAL [\old(input)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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.20ms. Allocated memory is still 130.0MB. Free memory is still 73.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 364.55ms. Allocated memory is still 130.0MB. Free memory was 93.7MB in the beginning and 66.4MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.15ms. Allocated memory is still 130.0MB. Free memory was 66.4MB in the beginning and 60.6MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.58ms. Allocated memory was 130.0MB in the beginning and 178.3MB in the end (delta: 48.2MB). Free memory was 60.6MB in the beginning and 146.6MB in the end (delta: -86.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 991.82ms. Allocated memory is still 178.3MB. Free memory was 146.6MB in the beginning and 104.7MB in the end (delta: 41.9MB). Peak memory consumption was 87.4MB. Max. memory is 16.1GB. * CodeCheck took 105040.86ms. Allocated memory was 178.3MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 104.7MB in the beginning and 787.3MB in the end (delta: -682.6MB). Peak memory consumption was 488.7MB. Max. memory is 16.1GB. * Witness Printer took 101.34ms. Allocated memory is still 1.4GB. Free memory was 787.3MB in the beginning and 764.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2022-12-14 21:16:04,165 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3ac879-5aa0-4f3b-89a8-845bcb42aefc/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