./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 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2de7d470-ae60-434c-aa94-fcb9372807b5/bin/ukojak-verify-Qdu7aM0XO9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2de7d470-ae60-434c-aa94-fcb9372807b5/bin/ukojak-verify-Qdu7aM0XO9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2de7d470-ae60-434c-aa94-fcb9372807b5/bin/ukojak-verify-Qdu7aM0XO9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2de7d470-ae60-434c-aa94-fcb9372807b5/bin/ukojak-verify-Qdu7aM0XO9/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label21.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2de7d470-ae60-434c-aa94-fcb9372807b5/bin/ukojak-verify-Qdu7aM0XO9/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2de7d470-ae60-434c-aa94-fcb9372807b5/bin/ukojak-verify-Qdu7aM0XO9 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7fc08bc6eca06c500d742b65350dc2aa3c19e672662fd614514fbc6bd34af0fd --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-03 00:35:08,861 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-03 00:35:08,935 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2de7d470-ae60-434c-aa94-fcb9372807b5/bin/ukojak-verify-Qdu7aM0XO9/config/svcomp-Reach-32bit-Kojak_Default.epf [2023-12-03 00:35:08,939 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-03 00:35:08,940 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2023-12-03 00:35:08,963 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-03 00:35:08,964 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-03 00:35:08,965 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2023-12-03 00:35:08,966 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-03 00:35:08,966 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-03 00:35:08,967 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-03 00:35:08,967 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-03 00:35:08,968 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-03 00:35:08,968 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-03 00:35:08,969 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-03 00:35:08,969 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-03 00:35:08,970 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-03 00:35:08,971 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-03 00:35:08,971 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-03 00:35:08,972 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-03 00:35:08,972 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-03 00:35:08,973 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-03 00:35:08,973 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2023-12-03 00:35:08,974 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2023-12-03 00:35:08,974 INFO L153 SettingsManager]: * Theory for external solver=ALL [2023-12-03 00:35:08,975 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-03 00:35:08,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-03 00:35:08,976 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-03 00:35:08,976 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-03 00:35:08,977 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-03 00:35:08,977 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2023-12-03 00:35:08,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-03 00:35:08,978 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-03 00:35:08,978 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2de7d470-ae60-434c-aa94-fcb9372807b5/bin/ukojak-verify-Qdu7aM0XO9/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_2de7d470-ae60-434c-aa94-fcb9372807b5/bin/ukojak-verify-Qdu7aM0XO9 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7fc08bc6eca06c500d742b65350dc2aa3c19e672662fd614514fbc6bd34af0fd [2023-12-03 00:35:09,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-03 00:35:09,223 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-03 00:35:09,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-03 00:35:09,227 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-03 00:35:09,228 INFO L274 PluginConnector]: CDTParser initialized [2023-12-03 00:35:09,229 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2de7d470-ae60-434c-aa94-fcb9372807b5/bin/ukojak-verify-Qdu7aM0XO9/../../sv-benchmarks/c/eca-rers2012/Problem01_label21.c [2023-12-03 00:35:11,998 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-03 00:35:12,271 INFO L384 CDTParser]: Found 1 translation units. [2023-12-03 00:35:12,271 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2de7d470-ae60-434c-aa94-fcb9372807b5/sv-benchmarks/c/eca-rers2012/Problem01_label21.c [2023-12-03 00:35:12,285 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2de7d470-ae60-434c-aa94-fcb9372807b5/bin/ukojak-verify-Qdu7aM0XO9/data/c9be87b43/2db114d7e62c47cf9127aab9f076221a/FLAG824389a14 [2023-12-03 00:35:12,298 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2de7d470-ae60-434c-aa94-fcb9372807b5/bin/ukojak-verify-Qdu7aM0XO9/data/c9be87b43/2db114d7e62c47cf9127aab9f076221a [2023-12-03 00:35:12,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-03 00:35:12,301 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-03 00:35:12,302 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-03 00:35:12,302 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-03 00:35:12,306 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-03 00:35:12,306 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 12:35:12" (1/1) ... [2023-12-03 00:35:12,308 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16442c2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:35:12, skipping insertion in model container [2023-12-03 00:35:12,308 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 12:35:12" (1/1) ... [2023-12-03 00:35:12,353 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-03 00:35:12,598 WARN L240 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_2de7d470-ae60-434c-aa94-fcb9372807b5/sv-benchmarks/c/eca-rers2012/Problem01_label21.c[15876,15889] [2023-12-03 00:35:12,640 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-03 00:35:12,652 INFO L202 MainTranslator]: Completed pre-run [2023-12-03 00:35:12,725 WARN L240 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_2de7d470-ae60-434c-aa94-fcb9372807b5/sv-benchmarks/c/eca-rers2012/Problem01_label21.c[15876,15889] [2023-12-03 00:35:12,743 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-03 00:35:12,759 INFO L206 MainTranslator]: Completed translation [2023-12-03 00:35:12,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:35:12 WrapperNode [2023-12-03 00:35:12,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-03 00:35:12,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-03 00:35:12,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-03 00:35:12,761 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-03 00:35:12,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:35:12" (1/1) ... [2023-12-03 00:35:12,786 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:35:12" (1/1) ... [2023-12-03 00:35:12,834 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658 [2023-12-03 00:35:12,834 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-03 00:35:12,835 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-03 00:35:12,835 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-03 00:35:12,835 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-03 00:35:12,845 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:35:12" (1/1) ... [2023-12-03 00:35:12,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:35:12" (1/1) ... [2023-12-03 00:35:12,850 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:35:12" (1/1) ... [2023-12-03 00:35:12,850 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:35:12" (1/1) ... [2023-12-03 00:35:12,884 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:35:12" (1/1) ... [2023-12-03 00:35:12,905 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:35:12" (1/1) ... [2023-12-03 00:35:12,911 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:35:12" (1/1) ... [2023-12-03 00:35:12,914 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:35:12" (1/1) ... [2023-12-03 00:35:12,921 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-03 00:35:12,922 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-03 00:35:12,922 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-03 00:35:12,922 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-03 00:35:12,923 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:35:12" (1/1) ... [2023-12-03 00:35:12,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-03 00:35:12,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2de7d470-ae60-434c-aa94-fcb9372807b5/bin/ukojak-verify-Qdu7aM0XO9/z3 [2023-12-03 00:35:12,956 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2de7d470-ae60-434c-aa94-fcb9372807b5/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2023-12-03 00:35:12,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2de7d470-ae60-434c-aa94-fcb9372807b5/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2023-12-03 00:35:12,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-03 00:35:12,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-03 00:35:12,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-03 00:35:12,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-03 00:35:13,074 INFO L241 CfgBuilder]: Building ICFG [2023-12-03 00:35:13,077 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-03 00:35:13,972 INFO L282 CfgBuilder]: Performing block encoding [2023-12-03 00:35:14,228 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-03 00:35:14,228 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-03 00:35:14,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 12:35:14 BoogieIcfgContainer [2023-12-03 00:35:14,230 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-03 00:35:14,231 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2023-12-03 00:35:14,231 INFO L270 PluginConnector]: Initializing CodeCheck... [2023-12-03 00:35:14,241 INFO L274 PluginConnector]: CodeCheck initialized [2023-12-03 00:35:14,241 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 12:35:14" (1/1) ... [2023-12-03 00:35:14,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-03 00:35:14,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:14,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2023-12-03 00:35:14,313 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2023-12-03 00:35:14,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-03 00:35:14,318 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:14,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:14,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 00:35:15,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:15,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 145 states and 231 transitions. [2023-12-03 00:35:15,194 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 231 transitions. [2023-12-03 00:35:15,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-03 00:35:15,198 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:15,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:15,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 00:35:16,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:16,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 215 states and 304 transitions. [2023-12-03 00:35:16,020 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 304 transitions. [2023-12-03 00:35:16,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-03 00:35:16,023 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:16,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:16,169 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-03 00:35:16,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:16,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 216 states and 305 transitions. [2023-12-03 00:35:16,303 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 305 transitions. [2023-12-03 00:35:16,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-12-03 00:35:16,306 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:16,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:16,445 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 00:35:16,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:16,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 231 states and 323 transitions. [2023-12-03 00:35:16,615 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 323 transitions. [2023-12-03 00:35:16,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-03 00:35:16,617 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:16,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:16,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:16,820 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 00:35:17,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:17,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 235 states and 330 transitions. [2023-12-03 00:35:17,043 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 330 transitions. [2023-12-03 00:35:17,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-03 00:35:17,046 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:17,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:17,153 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 00:35:17,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:17,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 240 states and 335 transitions. [2023-12-03 00:35:17,220 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 335 transitions. [2023-12-03 00:35:17,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-03 00:35:17,221 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:17,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:17,355 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 00:35:17,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:17,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 256 states and 356 transitions. [2023-12-03 00:35:17,683 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 356 transitions. [2023-12-03 00:35:17,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-03 00:35:17,684 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:17,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:17,789 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 00:35:18,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:18,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 282 states and 386 transitions. [2023-12-03 00:35:18,230 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 386 transitions. [2023-12-03 00:35:18,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-03 00:35:18,231 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:18,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:18,426 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-03 00:35:18,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:18,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 293 states and 401 transitions. [2023-12-03 00:35:18,785 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 401 transitions. [2023-12-03 00:35:18,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-03 00:35:18,786 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:18,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-03 00:35:19,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:19,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 314 states and 426 transitions. [2023-12-03 00:35:19,379 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 426 transitions. [2023-12-03 00:35:19,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-03 00:35:19,380 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:19,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:19,625 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-03 00:35:19,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:19,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 317 states and 430 transitions. [2023-12-03 00:35:19,857 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 430 transitions. [2023-12-03 00:35:19,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-03 00:35:19,858 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:19,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:20,029 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-03 00:35:20,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:20,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 328 states and 442 transitions. [2023-12-03 00:35:20,263 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 442 transitions. [2023-12-03 00:35:20,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-03 00:35:20,264 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:20,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:20,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:20,461 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 32 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-03 00:35:20,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:20,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 330 states and 444 transitions. [2023-12-03 00:35:20,510 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 444 transitions. [2023-12-03 00:35:20,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-03 00:35:20,512 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:20,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:20,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:20,587 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-03 00:35:20,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:20,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 333 states and 449 transitions. [2023-12-03 00:35:20,729 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 449 transitions. [2023-12-03 00:35:20,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-03 00:35:20,730 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:20,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:20,996 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-03 00:35:21,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:21,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 348 states and 467 transitions. [2023-12-03 00:35:21,499 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 467 transitions. [2023-12-03 00:35:21,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-03 00:35:21,500 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:21,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:21,592 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-03 00:35:21,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:21,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 357 states and 479 transitions. [2023-12-03 00:35:21,974 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 479 transitions. [2023-12-03 00:35:21,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-03 00:35:21,976 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:21,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:22,124 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-03 00:35:22,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:22,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 361 states and 487 transitions. [2023-12-03 00:35:22,514 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 487 transitions. [2023-12-03 00:35:22,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-03 00:35:22,516 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:22,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:22,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:22,602 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 00:35:22,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:22,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 375 states and 501 transitions. [2023-12-03 00:35:22,710 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 501 transitions. [2023-12-03 00:35:22,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-03 00:35:22,712 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:22,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:22,858 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-03 00:35:23,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:23,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 384 states and 511 transitions. [2023-12-03 00:35:23,069 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 511 transitions. [2023-12-03 00:35:23,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-03 00:35:23,071 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:23,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:23,168 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 00:35:23,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:23,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 408 states and 536 transitions. [2023-12-03 00:35:23,330 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 536 transitions. [2023-12-03 00:35:23,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-03 00:35:23,331 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:23,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:23,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:23,481 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 00:35:23,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:23,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 441 states and 571 transitions. [2023-12-03 00:35:23,902 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 571 transitions. [2023-12-03 00:35:23,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-03 00:35:23,903 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:23,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:24,036 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-03 00:35:24,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:24,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 463 states and 595 transitions. [2023-12-03 00:35:24,570 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 595 transitions. [2023-12-03 00:35:24,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-03 00:35:24,572 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:24,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:24,680 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 67 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 00:35:25,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:25,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 479 states and 620 transitions. [2023-12-03 00:35:25,049 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 620 transitions. [2023-12-03 00:35:25,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-03 00:35:25,050 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:25,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:25,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:25,145 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 00:35:25,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:25,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 508 states and 651 transitions. [2023-12-03 00:35:25,406 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 651 transitions. [2023-12-03 00:35:25,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-03 00:35:25,407 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:25,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:25,539 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-03 00:35:26,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:26,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 552 states and 696 transitions. [2023-12-03 00:35:26,041 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 696 transitions. [2023-12-03 00:35:26,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-03 00:35:26,042 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:26,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:26,163 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 80 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-03 00:35:26,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:26,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 567 states and 713 transitions. [2023-12-03 00:35:26,377 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 713 transitions. [2023-12-03 00:35:26,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-03 00:35:26,379 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:26,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:26,476 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-03 00:35:27,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:27,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 600 states and 751 transitions. [2023-12-03 00:35:27,358 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 751 transitions. [2023-12-03 00:35:27,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-03 00:35:27,360 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:27,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:27,541 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-03 00:35:27,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:27,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 605 states and 756 transitions. [2023-12-03 00:35:27,686 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 756 transitions. [2023-12-03 00:35:27,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-03 00:35:27,688 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:27,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:27,754 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-03 00:35:28,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:28,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 608 states and 760 transitions. [2023-12-03 00:35:28,058 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 760 transitions. [2023-12-03 00:35:28,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-03 00:35:28,060 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:28,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:28,230 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 00:35:28,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:28,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 636 states and 791 transitions. [2023-12-03 00:35:28,807 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 791 transitions. [2023-12-03 00:35:28,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-03 00:35:28,809 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:28,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:28,877 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-12-03 00:35:28,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:28,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 637 states and 791 transitions. [2023-12-03 00:35:28,918 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 791 transitions. [2023-12-03 00:35:28,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-03 00:35:28,919 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:28,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:29,295 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 00:35:30,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:30,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 709 states and 880 transitions. [2023-12-03 00:35:30,740 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 880 transitions. [2023-12-03 00:35:30,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-03 00:35:30,742 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:30,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:30,838 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-03 00:35:31,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:31,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 728 states and 900 transitions. [2023-12-03 00:35:31,218 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 900 transitions. [2023-12-03 00:35:31,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-03 00:35:31,220 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:31,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:31,302 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-03 00:35:31,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:31,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 729 states and 900 transitions. [2023-12-03 00:35:31,359 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 900 transitions. [2023-12-03 00:35:31,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-03 00:35:31,362 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:31,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:31,539 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 00:35:31,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:31,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 773 states and 945 transitions. [2023-12-03 00:35:31,955 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 945 transitions. [2023-12-03 00:35:31,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-03 00:35:31,957 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:31,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:32,171 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 101 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-03 00:35:33,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:33,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 813 states and 989 transitions. [2023-12-03 00:35:33,123 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 989 transitions. [2023-12-03 00:35:33,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-03 00:35:33,125 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:33,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:33,270 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-12-03 00:35:33,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:33,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 814 states and 991 transitions. [2023-12-03 00:35:33,563 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 991 transitions. [2023-12-03 00:35:33,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-03 00:35:33,565 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:33,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:33,811 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 99 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-03 00:35:33,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:33,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 816 states and 993 transitions. [2023-12-03 00:35:33,969 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 993 transitions. [2023-12-03 00:35:33,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-03 00:35:33,970 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:33,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:33,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:34,211 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 70 proven. 3 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-12-03 00:35:34,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:34,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 819 states and 996 transitions. [2023-12-03 00:35:34,416 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 996 transitions. [2023-12-03 00:35:34,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-12-03 00:35:34,418 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:34,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:34,600 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 90 proven. 3 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-12-03 00:35:34,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:34,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 822 states and 1000 transitions. [2023-12-03 00:35:34,877 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1000 transitions. [2023-12-03 00:35:34,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-12-03 00:35:34,878 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:34,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:35,347 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 84 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 00:35:36,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:36,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 903 states and 1101 transitions. [2023-12-03 00:35:36,948 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1101 transitions. [2023-12-03 00:35:36,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-12-03 00:35:36,950 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:36,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:37,342 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 84 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 00:35:37,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:37,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 906 states and 1104 transitions. [2023-12-03 00:35:37,661 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1104 transitions. [2023-12-03 00:35:37,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-12-03 00:35:37,662 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:37,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:37,742 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-03 00:35:38,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:38,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 933 states and 1137 transitions. [2023-12-03 00:35:38,206 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1137 transitions. [2023-12-03 00:35:38,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-03 00:35:38,207 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:38,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:38,633 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 90 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 00:35:40,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:40,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1018 states and 1238 transitions. [2023-12-03 00:35:40,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1238 transitions. [2023-12-03 00:35:40,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-12-03 00:35:40,403 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:40,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:40,734 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-03 00:35:41,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:41,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1089 states and 1309 transitions. [2023-12-03 00:35:41,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1309 transitions. [2023-12-03 00:35:41,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-03 00:35:41,913 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:41,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:42,044 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 127 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-03 00:35:42,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:42,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1090 states and 1310 transitions. [2023-12-03 00:35:42,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1310 transitions. [2023-12-03 00:35:42,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-03 00:35:42,232 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:42,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:42,558 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 99 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-03 00:35:43,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:43,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1102 states and 1324 transitions. [2023-12-03 00:35:43,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1324 transitions. [2023-12-03 00:35:43,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-12-03 00:35:43,147 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:43,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:43,289 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-03 00:35:43,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:43,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1123 states and 1353 transitions. [2023-12-03 00:35:43,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1353 transitions. [2023-12-03 00:35:43,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-12-03 00:35:43,964 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:43,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:44,118 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 114 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-03 00:35:44,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:44,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1153 states and 1385 transitions. [2023-12-03 00:35:44,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1385 transitions. [2023-12-03 00:35:44,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2023-12-03 00:35:44,770 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:44,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:45,008 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 00:35:46,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:46,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1186 states and 1421 transitions. [2023-12-03 00:35:46,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1421 transitions. [2023-12-03 00:35:46,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2023-12-03 00:35:46,068 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:46,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:46,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:46,132 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-03 00:35:46,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:46,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1202 states and 1439 transitions. [2023-12-03 00:35:46,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1439 transitions. [2023-12-03 00:35:46,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2023-12-03 00:35:46,683 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:46,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:46,748 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-12-03 00:35:47,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:47,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1209 states and 1447 transitions. [2023-12-03 00:35:47,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1447 transitions. [2023-12-03 00:35:47,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2023-12-03 00:35:47,143 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:47,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:47,281 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-12-03 00:35:47,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:47,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1234 states and 1474 transitions. [2023-12-03 00:35:47,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1474 transitions. [2023-12-03 00:35:47,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2023-12-03 00:35:47,830 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:47,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:47,916 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-12-03 00:35:48,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:48,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1242 states and 1482 transitions. [2023-12-03 00:35:48,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 1482 transitions. [2023-12-03 00:35:48,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-12-03 00:35:48,195 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:48,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:48,667 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 00:35:51,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:51,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1320 states and 1581 transitions. [2023-12-03 00:35:51,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1581 transitions. [2023-12-03 00:35:51,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-12-03 00:35:51,403 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:51,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:51,645 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 00:35:52,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:52,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1331 states and 1593 transitions. [2023-12-03 00:35:52,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1593 transitions. [2023-12-03 00:35:52,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-12-03 00:35:52,199 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:52,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:52,457 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 00:35:52,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:52,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1336 states and 1597 transitions. [2023-12-03 00:35:52,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1597 transitions. [2023-12-03 00:35:52,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-12-03 00:35:52,670 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:52,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:52,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:52,933 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 00:35:53,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:53,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1342 states and 1603 transitions. [2023-12-03 00:35:53,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1603 transitions. [2023-12-03 00:35:53,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2023-12-03 00:35:53,305 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:53,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:53,602 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 146 proven. 49 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-03 00:35:54,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:54,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1364 states and 1631 transitions. [2023-12-03 00:35:54,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 1631 transitions. [2023-12-03 00:35:54,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2023-12-03 00:35:54,759 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:54,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:55,034 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 146 proven. 49 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-03 00:35:55,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:55,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1381 states and 1650 transitions. [2023-12-03 00:35:55,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1650 transitions. [2023-12-03 00:35:55,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-12-03 00:35:55,986 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:55,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:56,249 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 127 proven. 44 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-03 00:35:56,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:56,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1390 states and 1660 transitions. [2023-12-03 00:35:56,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1660 transitions. [2023-12-03 00:35:56,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-12-03 00:35:56,864 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:56,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:56,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:35:57,207 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 00:35:59,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:35:59,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1464 states and 1748 transitions. [2023-12-03 00:35:59,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 1748 transitions. [2023-12-03 00:35:59,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-12-03 00:35:59,873 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:35:59,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:35:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:00,118 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 00:36:00,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:00,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1467 states and 1751 transitions. [2023-12-03 00:36:00,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 1751 transitions. [2023-12-03 00:36:00,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2023-12-03 00:36:00,667 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:00,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:00,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:01,303 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 127 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 00:36:03,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:03,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1511 states and 1808 transitions. [2023-12-03 00:36:03,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 1808 transitions. [2023-12-03 00:36:03,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2023-12-03 00:36:03,268 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:03,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:03,443 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-12-03 00:36:04,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:04,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1518 states and 1816 transitions. [2023-12-03 00:36:04,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1816 transitions. [2023-12-03 00:36:04,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2023-12-03 00:36:04,162 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:04,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:04,413 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 134 proven. 51 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-03 00:36:04,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:04,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1823 states to 1525 states and 1823 transitions. [2023-12-03 00:36:04,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 1823 transitions. [2023-12-03 00:36:04,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2023-12-03 00:36:04,590 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:04,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:05,005 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-03 00:36:07,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:07,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1564 states and 1870 transitions. [2023-12-03 00:36:07,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 1870 transitions. [2023-12-03 00:36:07,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2023-12-03 00:36:07,308 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:07,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:07,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:07,618 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-03 00:36:08,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:08,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1573 states and 1878 transitions. [2023-12-03 00:36:08,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 1878 transitions. [2023-12-03 00:36:08,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2023-12-03 00:36:08,157 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:08,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:08,424 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-03 00:36:08,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:08,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1575 states and 1879 transitions. [2023-12-03 00:36:08,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 1879 transitions. [2023-12-03 00:36:08,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2023-12-03 00:36:08,800 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:08,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:08,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:09,161 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 176 proven. 65 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-12-03 00:36:11,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:11,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1598 states and 1915 transitions. [2023-12-03 00:36:11,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 1915 transitions. [2023-12-03 00:36:11,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2023-12-03 00:36:11,664 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:11,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:11,939 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 176 proven. 65 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-12-03 00:36:12,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:12,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1606 states and 1925 transitions. [2023-12-03 00:36:12,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1925 transitions. [2023-12-03 00:36:12,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2023-12-03 00:36:12,419 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:12,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:12,694 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 176 proven. 65 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-12-03 00:36:13,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:13,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1608 states and 1926 transitions. [2023-12-03 00:36:13,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 1926 transitions. [2023-12-03 00:36:13,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-12-03 00:36:13,192 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:13,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:13,447 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 137 proven. 54 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-03 00:36:13,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:13,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1611 states and 1930 transitions. [2023-12-03 00:36:13,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 1930 transitions. [2023-12-03 00:36:13,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-12-03 00:36:13,591 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:13,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:13,998 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-03 00:36:16,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:16,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1991 states to 1662 states and 1991 transitions. [2023-12-03 00:36:16,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 1991 transitions. [2023-12-03 00:36:16,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-12-03 00:36:16,523 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:16,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:16,820 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-03 00:36:17,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:17,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1665 states and 1994 transitions. [2023-12-03 00:36:17,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 1994 transitions. [2023-12-03 00:36:17,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2023-12-03 00:36:17,399 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:17,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:17,933 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-03 00:36:20,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:20,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 1700 states and 2037 transitions. [2023-12-03 00:36:20,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2037 transitions. [2023-12-03 00:36:20,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2023-12-03 00:36:20,036 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:20,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:20,454 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-03 00:36:21,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:21,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 1717 states and 2053 transitions. [2023-12-03 00:36:21,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 2053 transitions. [2023-12-03 00:36:21,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2023-12-03 00:36:21,978 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:21,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:22,393 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 190 proven. 58 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2023-12-03 00:36:23,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:23,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 1723 states and 2063 transitions. [2023-12-03 00:36:23,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2063 transitions. [2023-12-03 00:36:23,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2023-12-03 00:36:23,554 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:23,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:23,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:23,862 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 140 proven. 71 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-03 00:36:24,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:24,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2066 states to 1726 states and 2066 transitions. [2023-12-03 00:36:24,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2066 transitions. [2023-12-03 00:36:24,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-12-03 00:36:24,365 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:24,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:24,517 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-12-03 00:36:25,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:25,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 1730 states and 2070 transitions. [2023-12-03 00:36:25,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1730 states and 2070 transitions. [2023-12-03 00:36:25,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-12-03 00:36:25,120 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:25,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:25,267 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-12-03 00:36:25,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:25,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2078 states to 1739 states and 2078 transitions. [2023-12-03 00:36:25,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2078 transitions. [2023-12-03 00:36:25,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-12-03 00:36:25,854 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:25,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:26,805 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 119 proven. 137 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-03 00:36:30,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:30,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2230 states to 1873 states and 2230 transitions. [2023-12-03 00:36:30,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 2230 transitions. [2023-12-03 00:36:30,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2023-12-03 00:36:30,773 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:30,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:31,082 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 58 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-03 00:36:31,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:31,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 1879 states and 2236 transitions. [2023-12-03 00:36:31,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 2236 transitions. [2023-12-03 00:36:31,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2023-12-03 00:36:31,481 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:31,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:31,676 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 181 proven. 81 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-03 00:36:32,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:32,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 1884 states and 2243 transitions. [2023-12-03 00:36:32,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 2243 transitions. [2023-12-03 00:36:32,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2023-12-03 00:36:32,118 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:32,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:32,254 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 181 proven. 81 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-03 00:36:32,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:32,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2259 states to 1899 states and 2259 transitions. [2023-12-03 00:36:32,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2259 transitions. [2023-12-03 00:36:32,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2023-12-03 00:36:32,541 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:32,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:32,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:32,944 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 00:36:33,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:33,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 1912 states and 2272 transitions. [2023-12-03 00:36:33,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2272 transitions. [2023-12-03 00:36:33,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2023-12-03 00:36:33,746 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:33,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:34,286 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 129 proven. 142 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-03 00:36:35,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:35,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 1986 states and 2350 transitions. [2023-12-03 00:36:35,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 2350 transitions. [2023-12-03 00:36:35,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2023-12-03 00:36:35,484 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:35,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:35,572 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2023-12-03 00:36:36,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:36,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2353 states to 1987 states and 2353 transitions. [2023-12-03 00:36:36,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 2353 transitions. [2023-12-03 00:36:36,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2023-12-03 00:36:36,056 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:36,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:36,185 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2023-12-03 00:36:36,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:36,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2369 states to 2002 states and 2369 transitions. [2023-12-03 00:36:36,920 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 2369 transitions. [2023-12-03 00:36:36,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2023-12-03 00:36:36,921 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:36,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:37,019 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2023-12-03 00:36:37,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:37,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2011 states and 2377 transitions. [2023-12-03 00:36:37,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 2377 transitions. [2023-12-03 00:36:37,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2023-12-03 00:36:37,493 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:37,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:37,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:37,791 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 152 proven. 83 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-03 00:36:38,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:38,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 2023 states and 2389 transitions. [2023-12-03 00:36:38,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2023 states and 2389 transitions. [2023-12-03 00:36:38,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2023-12-03 00:36:38,587 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:38,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:39,126 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 172 proven. 137 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-03 00:36:40,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:40,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2034 states and 2410 transitions. [2023-12-03 00:36:40,164 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 2410 transitions. [2023-12-03 00:36:40,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2023-12-03 00:36:40,166 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:40,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:40,521 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 172 proven. 137 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-03 00:36:41,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:41,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2415 states to 2039 states and 2415 transitions. [2023-12-03 00:36:41,068 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 2415 transitions. [2023-12-03 00:36:41,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2023-12-03 00:36:41,069 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:41,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:41,472 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 172 proven. 137 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-03 00:36:42,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:42,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2044 states and 2420 transitions. [2023-12-03 00:36:42,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2420 transitions. [2023-12-03 00:36:42,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2023-12-03 00:36:42,033 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:42,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:42,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:42,398 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 172 proven. 137 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-03 00:36:42,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:42,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2049 states and 2426 transitions. [2023-12-03 00:36:42,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2049 states and 2426 transitions. [2023-12-03 00:36:42,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2023-12-03 00:36:42,969 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:42,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:43,102 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-12-03 00:36:43,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:43,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2050 states and 2428 transitions. [2023-12-03 00:36:43,541 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 2428 transitions. [2023-12-03 00:36:43,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2023-12-03 00:36:43,543 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:43,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:43,638 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-12-03 00:36:44,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:44,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2065 states and 2444 transitions. [2023-12-03 00:36:44,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2065 states and 2444 transitions. [2023-12-03 00:36:44,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2023-12-03 00:36:44,112 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:44,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:44,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:44,403 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 155 proven. 86 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-12-03 00:36:46,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:46,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2491 states to 2102 states and 2491 transitions. [2023-12-03 00:36:46,372 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 2491 transitions. [2023-12-03 00:36:46,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2023-12-03 00:36:46,374 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:46,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:46,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:47,632 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 174 proven. 28 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-12-03 00:36:48,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:48,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2113 states and 2504 transitions. [2023-12-03 00:36:48,965 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 2504 transitions. [2023-12-03 00:36:48,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2023-12-03 00:36:48,967 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:48,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:49,123 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2023-12-03 00:36:49,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:49,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2508 states to 2115 states and 2508 transitions. [2023-12-03 00:36:49,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 2508 transitions. [2023-12-03 00:36:49,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2023-12-03 00:36:49,404 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:49,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:49,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:49,517 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2023-12-03 00:36:49,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:49,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2510 states to 2117 states and 2510 transitions. [2023-12-03 00:36:49,723 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 2510 transitions. [2023-12-03 00:36:49,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2023-12-03 00:36:49,725 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:49,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:49,824 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2023-12-03 00:36:50,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:50,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2510 states to 2118 states and 2510 transitions. [2023-12-03 00:36:50,280 INFO L276 IsEmpty]: Start isEmpty. Operand 2118 states and 2510 transitions. [2023-12-03 00:36:50,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2023-12-03 00:36:50,281 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:50,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:50,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:50,379 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2023-12-03 00:36:50,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:50,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2510 states to 2119 states and 2510 transitions. [2023-12-03 00:36:50,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2119 states and 2510 transitions. [2023-12-03 00:36:50,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2023-12-03 00:36:50,821 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:50,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:50,910 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2023-12-03 00:36:51,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:51,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2526 states to 2135 states and 2526 transitions. [2023-12-03 00:36:51,457 INFO L276 IsEmpty]: Start isEmpty. Operand 2135 states and 2526 transitions. [2023-12-03 00:36:51,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2023-12-03 00:36:51,458 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:51,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:51,798 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 159 proven. 90 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-03 00:36:53,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:53,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2164 states and 2560 transitions. [2023-12-03 00:36:53,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2164 states and 2560 transitions. [2023-12-03 00:36:53,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2023-12-03 00:36:53,690 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:53,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:53,992 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 162 proven. 93 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-03 00:36:54,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:54,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2563 states to 2167 states and 2563 transitions. [2023-12-03 00:36:54,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2167 states and 2563 transitions. [2023-12-03 00:36:54,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2023-12-03 00:36:54,813 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:54,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:55,219 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 192 proven. 59 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-12-03 00:36:55,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:55,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2168 states and 2564 transitions. [2023-12-03 00:36:55,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 2564 transitions. [2023-12-03 00:36:55,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2023-12-03 00:36:55,956 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:55,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:56,263 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 166 proven. 97 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-12-03 00:36:57,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:57,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2579 states to 2182 states and 2579 transitions. [2023-12-03 00:36:57,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 2579 transitions. [2023-12-03 00:36:57,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2023-12-03 00:36:57,253 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:57,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:57,453 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2023-12-03 00:36:57,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:57,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2196 states and 2595 transitions. [2023-12-03 00:36:57,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 2595 transitions. [2023-12-03 00:36:57,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2023-12-03 00:36:57,800 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:57,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:57,947 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 229 proven. 105 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-03 00:36:58,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:58,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2225 states and 2635 transitions. [2023-12-03 00:36:58,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2225 states and 2635 transitions. [2023-12-03 00:36:58,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2023-12-03 00:36:58,810 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:58,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:58,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:36:59,122 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 169 proven. 100 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2023-12-03 00:36:59,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:36:59,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2649 states to 2239 states and 2649 transitions. [2023-12-03 00:36:59,715 INFO L276 IsEmpty]: Start isEmpty. Operand 2239 states and 2649 transitions. [2023-12-03 00:36:59,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2023-12-03 00:36:59,716 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:36:59,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:36:59,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:37:00,053 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 200 proven. 63 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-12-03 00:37:00,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:37:00,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2653 states to 2242 states and 2653 transitions. [2023-12-03 00:37:00,615 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 2653 transitions. [2023-12-03 00:37:00,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2023-12-03 00:37:00,616 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:37:00,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:37:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:37:00,758 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2023-12-03 00:37:01,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:37:01,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2681 states to 2271 states and 2681 transitions. [2023-12-03 00:37:01,421 INFO L276 IsEmpty]: Start isEmpty. Operand 2271 states and 2681 transitions. [2023-12-03 00:37:01,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2023-12-03 00:37:01,422 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:37:01,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:37:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:37:01,972 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 65 proven. 278 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-03 00:37:03,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:37:03,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2753 states to 2341 states and 2753 transitions. [2023-12-03 00:37:03,445 INFO L276 IsEmpty]: Start isEmpty. Operand 2341 states and 2753 transitions. [2023-12-03 00:37:03,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-03 00:37:03,446 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:37:03,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:37:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:37:03,840 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2023-12-03 00:37:04,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:37:04,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2757 states to 2344 states and 2757 transitions. [2023-12-03 00:37:04,132 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 2757 transitions. [2023-12-03 00:37:04,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-03 00:37:04,134 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:37:04,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:37:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:37:04,599 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-03 00:37:09,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:37:09,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2835 states to 2411 states and 2835 transitions. [2023-12-03 00:37:09,433 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 2835 transitions. [2023-12-03 00:37:09,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-03 00:37:09,434 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:37:09,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:37:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:37:09,658 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-03 00:37:10,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:37:10,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2844 states to 2420 states and 2844 transitions. [2023-12-03 00:37:10,407 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 2844 transitions. [2023-12-03 00:37:10,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-03 00:37:10,409 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:37:10,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:37:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:37:10,659 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-03 00:37:11,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:37:11,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2846 states to 2422 states and 2846 transitions. [2023-12-03 00:37:11,119 INFO L276 IsEmpty]: Start isEmpty. Operand 2422 states and 2846 transitions. [2023-12-03 00:37:11,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-03 00:37:11,121 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:37:11,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:37:11,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:37:11,395 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-03 00:37:12,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:37:12,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2428 states and 2852 transitions. [2023-12-03 00:37:12,032 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 2852 transitions. [2023-12-03 00:37:12,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2023-12-03 00:37:12,033 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:37:12,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:37:12,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:37:12,332 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 211 proven. 49 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-12-03 00:37:13,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:37:13,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2859 states to 2434 states and 2859 transitions. [2023-12-03 00:37:13,063 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 2859 transitions. [2023-12-03 00:37:13,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2023-12-03 00:37:13,064 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:37:13,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:37:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:37:13,418 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 179 proven. 104 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-03 00:37:14,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:37:14,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2868 states to 2443 states and 2868 transitions. [2023-12-03 00:37:14,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2443 states and 2868 transitions. [2023-12-03 00:37:14,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2023-12-03 00:37:14,164 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:37:14,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:37:14,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:37:14,490 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 173 proven. 104 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2023-12-03 00:37:16,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:37:16,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2467 states and 2895 transitions. [2023-12-03 00:37:16,234 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 2895 transitions. [2023-12-03 00:37:16,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2023-12-03 00:37:16,235 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:37:16,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:37:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:37:16,722 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-03 00:37:18,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:37:18,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2490 states and 2926 transitions. [2023-12-03 00:37:18,960 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 2926 transitions. [2023-12-03 00:37:18,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2023-12-03 00:37:18,963 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:37:18,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:37:19,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:37:19,387 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-03 00:37:21,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:37:21,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2513 states and 2949 transitions. [2023-12-03 00:37:21,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 2949 transitions. [2023-12-03 00:37:21,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2023-12-03 00:37:21,312 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:37:21,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:37:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:37:21,636 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 175 proven. 106 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-12-03 00:37:22,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:37:22,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2516 states and 2952 transitions. [2023-12-03 00:37:22,346 INFO L276 IsEmpty]: Start isEmpty. Operand 2516 states and 2952 transitions. [2023-12-03 00:37:22,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2023-12-03 00:37:22,347 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:37:22,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:37:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:37:23,303 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 228 proven. 38 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-12-03 00:37:25,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:37:25,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2980 states to 2541 states and 2980 transitions. [2023-12-03 00:37:25,304 INFO L276 IsEmpty]: Start isEmpty. Operand 2541 states and 2980 transitions. [2023-12-03 00:37:25,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2023-12-03 00:37:25,306 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:37:25,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:37:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:37:26,001 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 00:37:31,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:37:31,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3059 states to 2612 states and 3059 transitions. [2023-12-03 00:37:31,724 INFO L276 IsEmpty]: Start isEmpty. Operand 2612 states and 3059 transitions. [2023-12-03 00:37:31,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2023-12-03 00:37:31,725 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:37:31,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:37:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:37:31,865 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 268 proven. 6 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-12-03 00:37:32,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:37:32,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3075 states to 2628 states and 3075 transitions. [2023-12-03 00:37:32,541 INFO L276 IsEmpty]: Start isEmpty. Operand 2628 states and 3075 transitions. [2023-12-03 00:37:32,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2023-12-03 00:37:32,543 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:37:32,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:37:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:37:32,952 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 186 proven. 111 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-03 00:37:33,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:37:33,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3082 states to 2635 states and 3082 transitions. [2023-12-03 00:37:33,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 3082 transitions. [2023-12-03 00:37:33,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2023-12-03 00:37:33,341 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:37:33,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:37:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:37:33,537 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 251 proven. 64 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-12-03 00:37:34,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:37:34,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3094 states to 2643 states and 3094 transitions. [2023-12-03 00:37:34,830 INFO L276 IsEmpty]: Start isEmpty. Operand 2643 states and 3094 transitions. [2023-12-03 00:37:34,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2023-12-03 00:37:34,831 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:37:34,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:37:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:37:35,164 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 185 proven. 152 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-03 00:37:37,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:37:37,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 2674 states and 3127 transitions. [2023-12-03 00:37:37,155 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 3127 transitions. [2023-12-03 00:37:37,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2023-12-03 00:37:37,157 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:37:37,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:37:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 00:37:37,488 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 189 proven. 114 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-03 00:37:37,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 00:37:37,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 2677 states and 3131 transitions. [2023-12-03 00:37:37,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2677 states and 3131 transitions. [2023-12-03 00:37:37,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2023-12-03 00:37:37,821 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 00:37:37,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 00:37:37,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-03 00:37:37,857 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-03 00:37:37,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-03 00:37:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-03 00:37:38,130 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-03 00:37:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-03 00:37:38,313 WARN L476 CodeCheckObserver]: This program is UNSAFE, Check terminated with 133 iterations. [2023-12-03 00:37:38,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 03.12 12:37:38 ImpRootNode [2023-12-03 00:37:38,449 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2023-12-03 00:37:38,449 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-03 00:37:38,449 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-03 00:37:38,450 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-03 00:37:38,450 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 12:35:14" (3/4) ... [2023-12-03 00:37:38,451 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-12-03 00:37:38,774 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2de7d470-ae60-434c-aa94-fcb9372807b5/bin/ukojak-verify-Qdu7aM0XO9/witness.graphml [2023-12-03 00:37:38,775 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-03 00:37:38,775 INFO L158 Benchmark]: Toolchain (without parser) took 146474.21ms. Allocated memory was 121.6MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 89.6MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 384.4MB. Max. memory is 16.1GB. [2023-12-03 00:37:38,775 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 121.6MB. Free memory is still 78.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-03 00:37:38,775 INFO L158 Benchmark]: CACSL2BoogieTranslator took 458.33ms. Allocated memory is still 121.6MB. Free memory was 89.6MB in the beginning and 61.6MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-12-03 00:37:38,776 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.41ms. Allocated memory is still 121.6MB. Free memory was 61.6MB in the beginning and 55.7MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-12-03 00:37:38,776 INFO L158 Benchmark]: Boogie Preprocessor took 86.26ms. Allocated memory was 121.6MB in the beginning and 146.8MB in the end (delta: 25.2MB). Free memory was 55.7MB in the beginning and 114.9MB in the end (delta: -59.2MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2023-12-03 00:37:38,776 INFO L158 Benchmark]: RCFGBuilder took 1308.15ms. Allocated memory is still 146.8MB. Free memory was 114.9MB in the beginning and 83.6MB in the end (delta: 31.3MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2023-12-03 00:37:38,777 INFO L158 Benchmark]: CodeCheck took 144217.98ms. Allocated memory was 146.8MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 83.6MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 325.4MB. Max. memory is 16.1GB. [2023-12-03 00:37:38,777 INFO L158 Benchmark]: Witness Printer took 325.43ms. Allocated memory is still 2.1GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-12-03 00:37:38,778 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 144.1s, OverallIterations: 133, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 387082 SdHoareTripleChecker+Valid, 901.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 386033 mSDsluCounter, 68288 SdHoareTripleChecker+Invalid, 771.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 59076 mSDsCounter, 94881 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 831196 IncrementalHoareTripleChecker+Invalid, 926077 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94881 mSolverCounterUnsat, 9212 mSDtfsCounter, 831196 mSolverCounterSat, 7.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 160897 GetRequests, 153071 SyntacticMatches, 6844 SemanticMatches, 982 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706772 ImplicationChecksByTransitivity, 91.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.9s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 30.6s InterpolantComputationTime, 24802 NumberOfCodeBlocks, 24802 NumberOfCodeBlocksAsserted, 133 NumberOfCheckSat, 24415 ConstructedInterpolants, 0 QuantifiedInterpolants, 151280 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 132 InterpolantComputations, 52 PerfectInterpolantSequences, 21909/26999 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] EXPR input = __VERIFIER_nondet_int() [L598] COND FALSE, EXPR !((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, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L344] a17 = 0 [L345] a16 = 4 [L346] return 21; VAL [\old(input)=3, \result=21, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] EXPR output = calculate_output(input) [L594-L603] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, output=21, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] EXPR input = __VERIFIER_nondet_int() [L598] COND FALSE, EXPR !((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, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L279] a20 = 0 [L280] a17 = 1 [L281] a16 = 6 [L282] return 21; VAL [\old(input)=4, \result=21, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] EXPR output = calculate_output(input) [L594-L603] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, output=21, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] EXPR input = __VERIFIER_nondet_int() [L598] COND FALSE, EXPR !((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, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=4, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=4, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=4, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=4, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L73] a17 = 0 [L74] return 26; VAL [\old(input)=4, \result=26, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] EXPR output = calculate_output(input) [L594-L603] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, output=26, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] EXPR input = __VERIFIER_nondet_int() [L598] COND FALSE, EXPR !((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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=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, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, 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] EXPR output = calculate_output(input) [L594-L603] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, 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 calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [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)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L434] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1)) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L435] reach_error() VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 121.6MB. Free memory is still 78.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 458.33ms. Allocated memory is still 121.6MB. Free memory was 89.6MB in the beginning and 61.6MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.41ms. Allocated memory is still 121.6MB. Free memory was 61.6MB in the beginning and 55.7MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.26ms. Allocated memory was 121.6MB in the beginning and 146.8MB in the end (delta: 25.2MB). Free memory was 55.7MB in the beginning and 114.9MB in the end (delta: -59.2MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * RCFGBuilder took 1308.15ms. Allocated memory is still 146.8MB. Free memory was 114.9MB in the beginning and 83.6MB in the end (delta: 31.3MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * CodeCheck took 144217.98ms. Allocated memory was 146.8MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 83.6MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 325.4MB. Max. memory is 16.1GB. * Witness Printer took 325.43ms. Allocated memory is still 2.1GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2023-12-03 00:37:38,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2de7d470-ae60-434c-aa94-fcb9372807b5/bin/ukojak-verify-Qdu7aM0XO9/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