./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label20.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_15c8cdb1-2cd3-45dc-83f7-ab298324bfbd/bin/ukojak-verify-Qdu7aM0XO9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15c8cdb1-2cd3-45dc-83f7-ab298324bfbd/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_15c8cdb1-2cd3-45dc-83f7-ab298324bfbd/bin/ukojak-verify-Qdu7aM0XO9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15c8cdb1-2cd3-45dc-83f7-ab298324bfbd/bin/ukojak-verify-Qdu7aM0XO9/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label20.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15c8cdb1-2cd3-45dc-83f7-ab298324bfbd/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_15c8cdb1-2cd3-45dc-83f7-ab298324bfbd/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 6d0713a1238e02d0284b255e77b84c086e26fd99d5533d6977fb0509f2ece092 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-03 02:15:10,184 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-03 02:15:10,248 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15c8cdb1-2cd3-45dc-83f7-ab298324bfbd/bin/ukojak-verify-Qdu7aM0XO9/config/svcomp-Reach-32bit-Kojak_Default.epf [2023-12-03 02:15:10,253 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-03 02:15:10,253 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2023-12-03 02:15:10,277 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-03 02:15:10,278 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-03 02:15:10,279 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2023-12-03 02:15:10,279 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-03 02:15:10,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-03 02:15:10,280 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-03 02:15:10,281 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-03 02:15:10,282 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-03 02:15:10,282 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-03 02:15:10,283 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-03 02:15:10,283 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-03 02:15:10,284 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-03 02:15:10,284 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-03 02:15:10,285 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-03 02:15:10,285 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-03 02:15:10,286 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-03 02:15:10,287 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-03 02:15:10,288 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2023-12-03 02:15:10,288 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2023-12-03 02:15:10,289 INFO L153 SettingsManager]: * Theory for external solver=ALL [2023-12-03 02:15:10,289 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-03 02:15:10,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-03 02:15:10,290 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-03 02:15:10,290 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-03 02:15:10,291 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-03 02:15:10,291 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2023-12-03 02:15:10,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-03 02:15:10,292 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-03 02:15:10,292 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_15c8cdb1-2cd3-45dc-83f7-ab298324bfbd/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_15c8cdb1-2cd3-45dc-83f7-ab298324bfbd/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 -> 6d0713a1238e02d0284b255e77b84c086e26fd99d5533d6977fb0509f2ece092 [2023-12-03 02:15:10,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-03 02:15:10,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-03 02:15:10,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-03 02:15:10,534 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-03 02:15:10,535 INFO L274 PluginConnector]: CDTParser initialized [2023-12-03 02:15:10,536 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15c8cdb1-2cd3-45dc-83f7-ab298324bfbd/bin/ukojak-verify-Qdu7aM0XO9/../../sv-benchmarks/c/eca-rers2012/Problem01_label20.c [2023-12-03 02:15:13,308 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-03 02:15:13,601 INFO L384 CDTParser]: Found 1 translation units. [2023-12-03 02:15:13,601 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15c8cdb1-2cd3-45dc-83f7-ab298324bfbd/sv-benchmarks/c/eca-rers2012/Problem01_label20.c [2023-12-03 02:15:13,615 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15c8cdb1-2cd3-45dc-83f7-ab298324bfbd/bin/ukojak-verify-Qdu7aM0XO9/data/cadb8ed02/8461c8c0452145fc85a02b49da15182e/FLAGbb5bfae43 [2023-12-03 02:15:13,630 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15c8cdb1-2cd3-45dc-83f7-ab298324bfbd/bin/ukojak-verify-Qdu7aM0XO9/data/cadb8ed02/8461c8c0452145fc85a02b49da15182e [2023-12-03 02:15:13,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-03 02:15:13,635 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-03 02:15:13,636 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-03 02:15:13,636 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-03 02:15:13,641 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-03 02:15:13,642 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:15:13" (1/1) ... [2023-12-03 02:15:13,643 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6230c55f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:15:13, skipping insertion in model container [2023-12-03 02:15:13,643 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:15:13" (1/1) ... [2023-12-03 02:15:13,693 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-03 02:15:13,935 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_15c8cdb1-2cd3-45dc-83f7-ab298324bfbd/sv-benchmarks/c/eca-rers2012/Problem01_label20.c[14503,14516] [2023-12-03 02:15:13,983 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-03 02:15:13,995 INFO L202 MainTranslator]: Completed pre-run [2023-12-03 02:15:14,083 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_15c8cdb1-2cd3-45dc-83f7-ab298324bfbd/sv-benchmarks/c/eca-rers2012/Problem01_label20.c[14503,14516] [2023-12-03 02:15:14,107 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-03 02:15:14,124 INFO L206 MainTranslator]: Completed translation [2023-12-03 02:15:14,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:15:14 WrapperNode [2023-12-03 02:15:14,125 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-03 02:15:14,126 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-03 02:15:14,126 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-03 02:15:14,127 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-03 02:15:14,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:15:14" (1/1) ... [2023-12-03 02:15:14,158 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:15:14" (1/1) ... [2023-12-03 02:15:14,203 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658 [2023-12-03 02:15:14,203 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-03 02:15:14,204 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-03 02:15:14,204 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-03 02:15:14,204 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-03 02:15:14,214 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:15:14" (1/1) ... [2023-12-03 02:15:14,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:15:14" (1/1) ... [2023-12-03 02:15:14,219 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:15:14" (1/1) ... [2023-12-03 02:15:14,219 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:15:14" (1/1) ... [2023-12-03 02:15:14,241 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:15:14" (1/1) ... [2023-12-03 02:15:14,249 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:15:14" (1/1) ... [2023-12-03 02:15:14,256 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:15:14" (1/1) ... [2023-12-03 02:15:14,261 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:15:14" (1/1) ... [2023-12-03 02:15:14,270 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-03 02:15:14,271 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-03 02:15:14,271 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-03 02:15:14,271 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-03 02:15:14,272 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:15:14" (1/1) ... [2023-12-03 02:15:14,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-03 02:15:14,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15c8cdb1-2cd3-45dc-83f7-ab298324bfbd/bin/ukojak-verify-Qdu7aM0XO9/z3 [2023-12-03 02:15:14,301 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15c8cdb1-2cd3-45dc-83f7-ab298324bfbd/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2023-12-03 02:15:14,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15c8cdb1-2cd3-45dc-83f7-ab298324bfbd/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2023-12-03 02:15:14,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-03 02:15:14,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-03 02:15:14,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-03 02:15:14,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-03 02:15:14,423 INFO L241 CfgBuilder]: Building ICFG [2023-12-03 02:15:14,425 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-03 02:15:15,268 INFO L282 CfgBuilder]: Performing block encoding [2023-12-03 02:15:15,539 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-03 02:15:15,539 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-03 02:15:15,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:15:15 BoogieIcfgContainer [2023-12-03 02:15:15,541 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-03 02:15:15,542 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2023-12-03 02:15:15,542 INFO L270 PluginConnector]: Initializing CodeCheck... [2023-12-03 02:15:15,553 INFO L274 PluginConnector]: CodeCheck initialized [2023-12-03 02:15:15,553 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:15:15" (1/1) ... [2023-12-03 02:15:15,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-03 02:15:15,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:15,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2023-12-03 02:15:15,622 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2023-12-03 02:15:15,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-03 02:15:15,627 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:15,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:16,109 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 02:15:16,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:16,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 145 states and 261 transitions. [2023-12-03 02:15:16,661 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 261 transitions. [2023-12-03 02:15:16,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-03 02:15:16,665 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:16,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:16,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:16,811 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 02:15:17,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:17,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 215 states and 339 transitions. [2023-12-03 02:15:17,560 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 339 transitions. [2023-12-03 02:15:17,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-03 02:15:17,563 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:17,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:17,655 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:15:17,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:17,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 220 states and 346 transitions. [2023-12-03 02:15:17,739 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 346 transitions. [2023-12-03 02:15:17,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-03 02:15:17,742 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:17,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:17,869 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 02:15:18,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:18,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 291 states and 425 transitions. [2023-12-03 02:15:18,392 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 425 transitions. [2023-12-03 02:15:18,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-03 02:15:18,394 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:18,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:18,518 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 02:15:18,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:18,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 307 states and 444 transitions. [2023-12-03 02:15:18,829 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 444 transitions. [2023-12-03 02:15:18,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-03 02:15:18,832 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:18,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:19,000 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-03 02:15:19,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:19,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 317 states and 457 transitions. [2023-12-03 02:15:19,230 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 457 transitions. [2023-12-03 02:15:19,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-03 02:15:19,232 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:19,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:19,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:19,382 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 02:15:19,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:19,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 338 states and 481 transitions. [2023-12-03 02:15:19,809 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 481 transitions. [2023-12-03 02:15:19,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-03 02:15:19,810 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:19,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:20,068 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 02:15:20,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:20,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 349 states and 495 transitions. [2023-12-03 02:15:20,527 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 495 transitions. [2023-12-03 02:15:20,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-03 02:15:20,529 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:20,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:20,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:20,717 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 02:15:21,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:21,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 359 states and 506 transitions. [2023-12-03 02:15:21,061 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 506 transitions. [2023-12-03 02:15:21,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-03 02:15:21,063 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:21,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:21,164 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 02:15:21,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:21,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 365 states and 512 transitions. [2023-12-03 02:15:21,231 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 512 transitions. [2023-12-03 02:15:21,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-03 02:15:21,233 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:21,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:21,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:21,351 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-03 02:15:21,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:21,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 373 states and 525 transitions. [2023-12-03 02:15:21,657 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 525 transitions. [2023-12-03 02:15:21,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-03 02:15:21,658 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:21,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:21,718 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-03 02:15:22,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:22,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 382 states and 537 transitions. [2023-12-03 02:15:22,037 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 537 transitions. [2023-12-03 02:15:22,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-03 02:15:22,039 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:22,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:22,111 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-03 02:15:22,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:22,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 388 states and 544 transitions. [2023-12-03 02:15:22,265 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 544 transitions. [2023-12-03 02:15:22,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-03 02:15:22,266 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:22,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:22,368 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-03 02:15:22,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:22,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 390 states and 546 transitions. [2023-12-03 02:15:22,408 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 546 transitions. [2023-12-03 02:15:22,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-03 02:15:22,409 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:22,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:22,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:22,542 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-03 02:15:22,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:22,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 398 states and 556 transitions. [2023-12-03 02:15:22,885 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 556 transitions. [2023-12-03 02:15:22,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-03 02:15:22,887 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:22,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:23,066 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-03 02:15:23,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:23,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 400 states and 558 transitions. [2023-12-03 02:15:23,122 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 558 transitions. [2023-12-03 02:15:23,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-03 02:15:23,123 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:23,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:23,350 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-03 02:15:23,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:23,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 402 states and 560 transitions. [2023-12-03 02:15:23,422 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 560 transitions. [2023-12-03 02:15:23,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-03 02:15:23,424 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:23,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:23,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:23,641 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-03 02:15:24,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:24,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 413 states and 574 transitions. [2023-12-03 02:15:24,168 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 574 transitions. [2023-12-03 02:15:24,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-03 02:15:24,170 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:24,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:24,312 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-03 02:15:24,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:24,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 423 states and 585 transitions. [2023-12-03 02:15:24,498 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 585 transitions. [2023-12-03 02:15:24,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-03 02:15:24,499 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:24,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:24,648 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-03 02:15:24,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:24,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 440 states and 604 transitions. [2023-12-03 02:15:24,942 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 604 transitions. [2023-12-03 02:15:24,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-03 02:15:24,944 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:24,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:25,023 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-03 02:15:25,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:25,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 454 states and 618 transitions. [2023-12-03 02:15:25,120 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 618 transitions. [2023-12-03 02:15:25,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-03 02:15:25,121 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:25,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:25,247 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 02:15:25,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:25,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 484 states and 655 transitions. [2023-12-03 02:15:25,917 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 655 transitions. [2023-12-03 02:15:25,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-03 02:15:25,919 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:25,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:26,037 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 02:15:26,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:26,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 507 states and 679 transitions. [2023-12-03 02:15:26,608 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 679 transitions. [2023-12-03 02:15:26,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-03 02:15:26,610 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:26,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:26,720 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 02:15:26,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:26,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 536 states and 709 transitions. [2023-12-03 02:15:26,932 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 709 transitions. [2023-12-03 02:15:26,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-03 02:15:26,934 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:26,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:27,064 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 02:15:27,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:27,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 584 states and 761 transitions. [2023-12-03 02:15:27,700 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 761 transitions. [2023-12-03 02:15:27,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-03 02:15:27,702 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:27,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:27,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:27,831 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-03 02:15:27,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:27,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 598 states and 775 transitions. [2023-12-03 02:15:27,971 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 775 transitions. [2023-12-03 02:15:27,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-03 02:15:27,973 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:27,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:28,213 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 02:15:28,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:28,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 627 states and 808 transitions. [2023-12-03 02:15:28,994 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 808 transitions. [2023-12-03 02:15:28,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-03 02:15:28,996 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:28,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:29,145 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 02:15:29,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:29,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 655 states and 837 transitions. [2023-12-03 02:15:29,687 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 837 transitions. [2023-12-03 02:15:29,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-03 02:15:29,688 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:29,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:29,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:29,776 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 02:15:30,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:30,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 694 states and 880 transitions. [2023-12-03 02:15:30,033 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 880 transitions. [2023-12-03 02:15:30,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-03 02:15:30,034 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:30,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:30,252 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:15:31,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:31,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 764 states and 958 transitions. [2023-12-03 02:15:31,010 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 958 transitions. [2023-12-03 02:15:31,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-03 02:15:31,012 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:31,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:31,409 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 02:15:33,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:33,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 833 states and 1048 transitions. [2023-12-03 02:15:33,124 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1048 transitions. [2023-12-03 02:15:33,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-03 02:15:33,126 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:33,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:33,332 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 02:15:34,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:34,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 901 states and 1121 transitions. [2023-12-03 02:15:34,589 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1121 transitions. [2023-12-03 02:15:34,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-03 02:15:34,592 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:34,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:34,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:34,732 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 02:15:34,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:34,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 902 states and 1121 transitions. [2023-12-03 02:15:34,985 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1121 transitions. [2023-12-03 02:15:34,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-03 02:15:34,987 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:34,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:35,160 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 02:15:35,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:35,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 930 states and 1151 transitions. [2023-12-03 02:15:35,719 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1151 transitions. [2023-12-03 02:15:35,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-03 02:15:35,720 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:35,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:35,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:35,937 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 02:15:37,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:37,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 964 states and 1190 transitions. [2023-12-03 02:15:37,066 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1190 transitions. [2023-12-03 02:15:37,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-03 02:15:37,068 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:37,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:37,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:37,254 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 02:15:38,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:38,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 999 states and 1231 transitions. [2023-12-03 02:15:38,030 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1231 transitions. [2023-12-03 02:15:38,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-03 02:15:38,031 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:38,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:38,182 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 02:15:38,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:38,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1009 states and 1242 transitions. [2023-12-03 02:15:38,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1242 transitions. [2023-12-03 02:15:38,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-03 02:15:38,540 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:38,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:38,938 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:15:39,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:39,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1080 states and 1313 transitions. [2023-12-03 02:15:39,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1313 transitions. [2023-12-03 02:15:39,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-03 02:15:39,960 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:39,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:40,191 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 87 proven. 3 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-12-03 02:15:40,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:40,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1095 states and 1330 transitions. [2023-12-03 02:15:40,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1330 transitions. [2023-12-03 02:15:40,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-03 02:15:40,875 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:40,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:40,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:41,096 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 87 proven. 3 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-12-03 02:15:41,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:41,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1098 states and 1334 transitions. [2023-12-03 02:15:41,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1334 transitions. [2023-12-03 02:15:41,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-03 02:15:41,460 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:41,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:41,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:41,590 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 97 proven. 29 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-03 02:15:42,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:42,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1117 states and 1355 transitions. [2023-12-03 02:15:42,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1355 transitions. [2023-12-03 02:15:42,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-03 02:15:42,105 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:42,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:42,240 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 97 proven. 29 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-03 02:15:42,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:42,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1136 states and 1376 transitions. [2023-12-03 02:15:42,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1376 transitions. [2023-12-03 02:15:42,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-12-03 02:15:42,679 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:42,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:42,736 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:15:43,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:43,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1153 states and 1397 transitions. [2023-12-03 02:15:43,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1397 transitions. [2023-12-03 02:15:43,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-03 02:15:43,434 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:43,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:43,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:43,550 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 02:15:43,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:43,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1169 states and 1417 transitions. [2023-12-03 02:15:43,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1417 transitions. [2023-12-03 02:15:43,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-12-03 02:15:43,814 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:43,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:43,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:44,160 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 106 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-03 02:15:44,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:44,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1180 states and 1430 transitions. [2023-12-03 02:15:44,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1430 transitions. [2023-12-03 02:15:44,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-12-03 02:15:44,723 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:44,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:44,954 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 106 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-03 02:15:45,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:45,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1184 states and 1434 transitions. [2023-12-03 02:15:45,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1434 transitions. [2023-12-03 02:15:45,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-12-03 02:15:45,232 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:45,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:45,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:45,395 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 02:15:45,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:45,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1205 states and 1460 transitions. [2023-12-03 02:15:45,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1460 transitions. [2023-12-03 02:15:45,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-12-03 02:15:45,869 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:45,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:45,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:46,037 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 02:15:47,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:47,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1246 states and 1505 transitions. [2023-12-03 02:15:47,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1246 states and 1505 transitions. [2023-12-03 02:15:47,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-12-03 02:15:47,232 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:47,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:47,389 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 02:15:48,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:48,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1284 states and 1546 transitions. [2023-12-03 02:15:48,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1546 transitions. [2023-12-03 02:15:48,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2023-12-03 02:15:48,241 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:48,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:48,764 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 02:15:49,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:49,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1299 states and 1569 transitions. [2023-12-03 02:15:49,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1569 transitions. [2023-12-03 02:15:49,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2023-12-03 02:15:49,445 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:49,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:49,679 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 02:15:50,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:50,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1350 states and 1624 transitions. [2023-12-03 02:15:50,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1624 transitions. [2023-12-03 02:15:50,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2023-12-03 02:15:50,505 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:50,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:50,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:50,596 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 02:15:50,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:50,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1366 states and 1641 transitions. [2023-12-03 02:15:50,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1641 transitions. [2023-12-03 02:15:50,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2023-12-03 02:15:50,909 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:50,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:50,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:50,992 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-03 02:15:51,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:51,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1367 states and 1644 transitions. [2023-12-03 02:15:51,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1644 transitions. [2023-12-03 02:15:51,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-03 02:15:51,265 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:51,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:51,450 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-12-03 02:15:51,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:51,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1370 states and 1647 transitions. [2023-12-03 02:15:51,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1647 transitions. [2023-12-03 02:15:51,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-03 02:15:51,680 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:51,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:51,845 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-12-03 02:15:52,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:52,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1373 states and 1650 transitions. [2023-12-03 02:15:52,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 1650 transitions. [2023-12-03 02:15:52,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2023-12-03 02:15:52,031 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:52,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:52,117 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 02:15:52,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:52,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1398 states and 1676 transitions. [2023-12-03 02:15:52,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 1676 transitions. [2023-12-03 02:15:52,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2023-12-03 02:15:52,402 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:52,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:52,518 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 02:15:52,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:52,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1422 states and 1700 transitions. [2023-12-03 02:15:52,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 1700 transitions. [2023-12-03 02:15:52,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-12-03 02:15:52,822 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:52,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:53,271 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 02:15:54,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:54,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1453 states and 1743 transitions. [2023-12-03 02:15:54,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 1743 transitions. [2023-12-03 02:15:54,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-12-03 02:15:54,905 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:54,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:55,161 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 02:15:57,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:57,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1511 states and 1807 transitions. [2023-12-03 02:15:57,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 1807 transitions. [2023-12-03 02:15:57,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-12-03 02:15:57,536 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:57,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:57,777 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 02:15:58,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:58,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1823 states to 1527 states and 1823 transitions. [2023-12-03 02:15:58,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 1823 transitions. [2023-12-03 02:15:58,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-12-03 02:15:58,158 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:58,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:58,428 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 02:15:58,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:58,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1825 states to 1529 states and 1825 transitions. [2023-12-03 02:15:58,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 1825 transitions. [2023-12-03 02:15:58,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-12-03 02:15:58,746 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:58,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:58,987 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 02:15:59,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:15:59,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1533 states and 1829 transitions. [2023-12-03 02:15:59,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 1829 transitions. [2023-12-03 02:15:59,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2023-12-03 02:15:59,405 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:15:59,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:15:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:15:59,619 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-12-03 02:16:00,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:16:00,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1565 states and 1866 transitions. [2023-12-03 02:16:00,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 1866 transitions. [2023-12-03 02:16:00,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2023-12-03 02:16:00,343 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:16:00,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:16:00,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:16:00,443 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-12-03 02:16:01,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:16:01,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1582 states and 1888 transitions. [2023-12-03 02:16:01,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1888 transitions. [2023-12-03 02:16:01,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2023-12-03 02:16:01,093 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:16:01,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:16:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:16:01,341 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 120 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-03 02:16:01,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:16:01,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1583 states and 1889 transitions. [2023-12-03 02:16:01,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 1889 transitions. [2023-12-03 02:16:01,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2023-12-03 02:16:01,518 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:16:01,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:16:01,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:16:01,604 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-03 02:16:02,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:16:02,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1612 states and 1922 transitions. [2023-12-03 02:16:02,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 1922 transitions. [2023-12-03 02:16:02,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-12-03 02:16:02,157 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:16:02,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:16:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:16:02,333 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 188 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-12-03 02:16:03,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:16:03,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1631 states and 1941 transitions. [2023-12-03 02:16:03,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 1941 transitions. [2023-12-03 02:16:03,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-12-03 02:16:03,321 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:16:03,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:16:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:16:03,569 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 188 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-12-03 02:16:04,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:16:04,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1650 states and 1960 transitions. [2023-12-03 02:16:04,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 1960 transitions. [2023-12-03 02:16:04,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-12-03 02:16:04,605 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:16:04,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:16:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:16:04,844 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 02:16:05,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:16:05,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1659 states and 1969 transitions. [2023-12-03 02:16:05,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 1969 transitions. [2023-12-03 02:16:05,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-12-03 02:16:05,454 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:16:05,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:16:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:16:05,789 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 02:16:06,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:16:06,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2003 states to 1689 states and 2003 transitions. [2023-12-03 02:16:06,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 2003 transitions. [2023-12-03 02:16:06,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-12-03 02:16:06,966 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:16:06,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:16:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:16:07,208 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 02:16:07,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:16:07,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 1715 states and 2030 transitions. [2023-12-03 02:16:07,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2030 transitions. [2023-12-03 02:16:07,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2023-12-03 02:16:07,932 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:16:07,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:16:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:16:08,021 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-12-03 02:16:08,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:16:08,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 1717 states and 2033 transitions. [2023-12-03 02:16:08,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 2033 transitions. [2023-12-03 02:16:08,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2023-12-03 02:16:08,269 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:16:08,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:16:08,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:16:08,366 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-12-03 02:16:08,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:16:08,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2036 states to 1719 states and 2036 transitions. [2023-12-03 02:16:08,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2036 transitions. [2023-12-03 02:16:08,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2023-12-03 02:16:08,598 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:16:08,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:16:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:16:09,245 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 191 proven. 38 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-12-03 02:16:10,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:16:10,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2078 states to 1754 states and 2078 transitions. [2023-12-03 02:16:10,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 2078 transitions. [2023-12-03 02:16:10,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2023-12-03 02:16:10,875 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:16:10,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:16:10,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:16:11,198 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 02:16:11,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:16:11,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 1761 states and 2085 transitions. [2023-12-03 02:16:11,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 2085 transitions. [2023-12-03 02:16:11,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2023-12-03 02:16:11,689 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:16:11,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:16:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:16:12,177 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 02:16:15,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:16:15,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 1811 states and 2140 transitions. [2023-12-03 02:16:15,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2140 transitions. [2023-12-03 02:16:15,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2023-12-03 02:16:15,336 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:16:15,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:16:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:16:15,676 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 02:16:17,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:16:17,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 1844 states and 2176 transitions. [2023-12-03 02:16:17,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 2176 transitions. [2023-12-03 02:16:17,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2023-12-03 02:16:17,955 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:16:17,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:16:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:16:18,233 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 02:16:18,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:16:18,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2177 states to 1846 states and 2177 transitions. [2023-12-03 02:16:18,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 2177 transitions. [2023-12-03 02:16:18,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2023-12-03 02:16:18,616 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:16:18,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:16:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:16:18,824 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 159 proven. 46 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-03 02:16:20,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:16:20,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2222 states to 1888 states and 2222 transitions. [2023-12-03 02:16:20,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 2222 transitions. [2023-12-03 02:16:20,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-12-03 02:16:20,104 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:16:20,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:16:20,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:16:20,357 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 02:16:20,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:16:20,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2226 states to 1891 states and 2226 transitions. [2023-12-03 02:16:20,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 2226 transitions. [2023-12-03 02:16:20,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-12-03 02:16:20,648 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:16:20,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:16:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:16:21,078 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 02:16:23,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:16:23,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2286 states to 1946 states and 2286 transitions. [2023-12-03 02:16:23,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2286 transitions. [2023-12-03 02:16:23,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-12-03 02:16:23,896 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:16:23,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:16:23,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:16:24,222 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 02:16:24,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:16:24,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 1960 states and 2302 transitions. [2023-12-03 02:16:24,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 2302 transitions. [2023-12-03 02:16:24,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2023-12-03 02:16:24,870 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:16:24,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:16:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:16:25,328 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:16:26,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:16:26,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 1973 states and 2318 transitions. [2023-12-03 02:16:26,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1973 states and 2318 transitions. [2023-12-03 02:16:26,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2023-12-03 02:16:26,856 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:16:26,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:16:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:16:27,134 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:16:28,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:16:28,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2324 states to 1980 states and 2324 transitions. [2023-12-03 02:16:28,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1980 states and 2324 transitions. [2023-12-03 02:16:28,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2023-12-03 02:16:28,112 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:16:28,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:16:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:16:28,691 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 02:16:32,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:16:32,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2044 states and 2396 transitions. [2023-12-03 02:16:32,759 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2396 transitions. [2023-12-03 02:16:32,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2023-12-03 02:16:32,761 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:16:32,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:16:32,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:16:33,040 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 02:16:35,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:16:35,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2107 states and 2465 transitions. [2023-12-03 02:16:35,965 INFO L276 IsEmpty]: Start isEmpty. Operand 2107 states and 2465 transitions. [2023-12-03 02:16:35,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-12-03 02:16:35,966 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:16:35,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:16:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:16:36,392 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 147 proven. 26 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-12-03 02:16:37,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:16:37,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2120 states and 2481 transitions. [2023-12-03 02:16:37,994 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 2481 transitions. [2023-12-03 02:16:37,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-12-03 02:16:37,995 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:16:37,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:16:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:16:38,302 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 40 proven. 220 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-03 02:16:38,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:16:38,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2190 states and 2553 transitions. [2023-12-03 02:16:38,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2190 states and 2553 transitions. [2023-12-03 02:16:38,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2023-12-03 02:16:38,952 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:16:38,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:16:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:16:39,242 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2023-12-03 02:16:40,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:16:40,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2625 states to 2260 states and 2625 transitions. [2023-12-03 02:16:40,086 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 2625 transitions. [2023-12-03 02:16:40,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2023-12-03 02:16:40,088 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:16:40,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:16:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:16:40,262 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2023-12-03 02:16:40,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:16:40,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2262 states and 2627 transitions. [2023-12-03 02:16:40,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 2627 transitions. [2023-12-03 02:16:40,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2023-12-03 02:16:40,888 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:16:40,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:16:40,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:16:41,528 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 184 proven. 36 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-12-03 02:16:44,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:16:44,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2676 states to 2298 states and 2676 transitions. [2023-12-03 02:16:44,527 INFO L276 IsEmpty]: Start isEmpty. Operand 2298 states and 2676 transitions. [2023-12-03 02:16:44,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2023-12-03 02:16:44,529 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:16:44,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:16:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:16:45,071 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 02:16:45,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:16:45,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2691 states to 2309 states and 2691 transitions. [2023-12-03 02:16:45,958 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 2691 transitions. [2023-12-03 02:16:45,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2023-12-03 02:16:45,959 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:16:45,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:16:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:16:46,316 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 02:16:47,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:16:47,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2732 states to 2346 states and 2732 transitions. [2023-12-03 02:16:47,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 2732 transitions. [2023-12-03 02:16:47,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2023-12-03 02:16:47,903 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:16:47,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:16:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:16:48,050 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 02:16:48,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:16:48,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2749 states to 2360 states and 2749 transitions. [2023-12-03 02:16:48,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 2749 transitions. [2023-12-03 02:16:48,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2023-12-03 02:16:48,313 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:16:48,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:16:48,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:16:48,409 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2023-12-03 02:16:49,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:16:49,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2434 states and 2825 transitions. [2023-12-03 02:16:49,175 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 2825 transitions. [2023-12-03 02:16:49,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2023-12-03 02:16:49,177 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:16:49,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:16:49,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:16:50,211 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-03 02:16:55,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:16:55,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2544 states and 2965 transitions. [2023-12-03 02:16:55,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 2965 transitions. [2023-12-03 02:16:56,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2023-12-03 02:16:56,001 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:16:56,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:16:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:16:56,168 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2023-12-03 02:16:56,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:16:56,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2545 states and 2965 transitions. [2023-12-03 02:16:56,519 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 2965 transitions. [2023-12-03 02:16:56,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2023-12-03 02:16:56,521 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:16:56,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:16:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-03 02:16:56,563 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-03 02:16:56,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-03 02:16:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-03 02:16:56,832 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-03 02:16:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-03 02:16:56,980 WARN L476 CodeCheckObserver]: This program is UNSAFE, Check terminated with 98 iterations. [2023-12-03 02:16:57,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 03.12 02:16:57 ImpRootNode [2023-12-03 02:16:57,130 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2023-12-03 02:16:57,131 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-03 02:16:57,131 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-03 02:16:57,131 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-03 02:16:57,131 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:15:15" (3/4) ... [2023-12-03 02:16:57,132 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-12-03 02:16:57,453 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15c8cdb1-2cd3-45dc-83f7-ab298324bfbd/bin/ukojak-verify-Qdu7aM0XO9/witness.graphml [2023-12-03 02:16:57,453 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-03 02:16:57,453 INFO L158 Benchmark]: Toolchain (without parser) took 103819.10ms. Allocated memory was 136.3MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 103.4MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 392.1MB. Max. memory is 16.1GB. [2023-12-03 02:16:57,454 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 100.7MB. Free memory is still 54.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-03 02:16:57,454 INFO L158 Benchmark]: CACSL2BoogieTranslator took 489.52ms. Allocated memory is still 136.3MB. Free memory was 103.0MB in the beginning and 75.1MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-12-03 02:16:57,454 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.09ms. Allocated memory is still 136.3MB. Free memory was 75.1MB in the beginning and 69.4MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-12-03 02:16:57,454 INFO L158 Benchmark]: Boogie Preprocessor took 66.19ms. Allocated memory is still 136.3MB. Free memory was 69.4MB in the beginning and 64.6MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-03 02:16:57,455 INFO L158 Benchmark]: RCFGBuilder took 1270.06ms. Allocated memory was 136.3MB in the beginning and 167.8MB in the end (delta: 31.5MB). Free memory was 64.6MB in the beginning and 81.6MB in the end (delta: -17.0MB). Peak memory consumption was 34.0MB. Max. memory is 16.1GB. [2023-12-03 02:16:57,455 INFO L158 Benchmark]: CodeCheck took 101588.65ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 81.6MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 311.1MB. Max. memory is 16.1GB. [2023-12-03 02:16:57,455 INFO L158 Benchmark]: Witness Printer took 322.09ms. Allocated memory is still 1.5GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2023-12-03 02:16:57,457 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: 101.4s, OverallIterations: 98, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 240605 SdHoareTripleChecker+Valid, 614.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 239169 mSDsluCounter, 37086 SdHoareTripleChecker+Invalid, 519.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31423 mSDsCounter, 80124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 545232 IncrementalHoareTripleChecker+Invalid, 625356 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80124 mSolverCounterUnsat, 5663 mSDtfsCounter, 545232 mSolverCounterSat, 4.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 109893 GetRequests, 105444 SyntacticMatches, 3605 SemanticMatches, 844 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516685 ImplicationChecksByTransitivity, 63.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.6s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 19.7s InterpolantComputationTime, 16373 NumberOfCodeBlocks, 16373 NumberOfCodeBlocksAsserted, 98 NumberOfCheckSat, 15993 ConstructedInterpolants, 0 QuantifiedInterpolants, 82530 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 97 InterpolantComputations, 42 PerfectInterpolantSequences, 13182/15332 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: 402]: 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)=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L83] a7 = 1 [L84] a17 = 1 [L85] a21 = 0 [L86] a20 = 1 [L87] a8 = 13 [L88] a16 = 5 [L89] return 26; VAL [\old(input)=1, \result=26, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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=1, a20=1, a21=0, a7=1, a8=13, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND TRUE ((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5)) [L272] a16 = 4 [L273] a20 = 0 [L274] return 25; VAL [\old(input)=6, \result=25, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, output=25, 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)=6, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND TRUE ((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1))))))))) [L249] a20 = 0 [L250] a21 = 1 [L251] a17 = 0 [L252] a8 = 14 [L253] a16 = 4 [L254] return -1; VAL [\old(input)=6, \result=-1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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)))))))) VAL [\old(input)=1, a12=8, a16=4, 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] [L401] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [\old(input)=1, a12=8, a16=4, 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] [L402] reach_error() VAL [\old(input)=1, a12=8, a16=4, 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.32ms. Allocated memory is still 100.7MB. Free memory is still 54.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 489.52ms. Allocated memory is still 136.3MB. Free memory was 103.0MB in the beginning and 75.1MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.09ms. Allocated memory is still 136.3MB. Free memory was 75.1MB in the beginning and 69.4MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.19ms. Allocated memory is still 136.3MB. Free memory was 69.4MB in the beginning and 64.6MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1270.06ms. Allocated memory was 136.3MB in the beginning and 167.8MB in the end (delta: 31.5MB). Free memory was 64.6MB in the beginning and 81.6MB in the end (delta: -17.0MB). Peak memory consumption was 34.0MB. Max. memory is 16.1GB. * CodeCheck took 101588.65ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 81.6MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 311.1MB. Max. memory is 16.1GB. * Witness Printer took 322.09ms. Allocated memory is still 1.5GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2023-12-03 02:16:57,481 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15c8cdb1-2cd3-45dc-83f7-ab298324bfbd/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