./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label44.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf2722f-e039-418a-baa3-c139e80d45e6/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf2722f-e039-418a-baa3-c139e80d45e6/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf2722f-e039-418a-baa3-c139e80d45e6/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf2722f-e039-418a-baa3-c139e80d45e6/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label44.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf2722f-e039-418a-baa3-c139e80d45e6/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf2722f-e039-418a-baa3-c139e80d45e6/bin/ukojak-verify-CZk0znPC7b --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 19f6a4e9c4337065cd35355f350ba61e20d7c158a393782dbdfa17548177e415 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 06:09:01,125 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 06:09:01,183 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf2722f-e039-418a-baa3-c139e80d45e6/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 06:09:01,187 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 06:09:01,187 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 06:09:01,206 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 06:09:01,207 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 06:09:01,207 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 06:09:01,208 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 06:09:01,208 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 06:09:01,208 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 06:09:01,208 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 06:09:01,208 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 06:09:01,209 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 06:09:01,209 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 06:09:01,209 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 06:09:01,209 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 06:09:01,209 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 06:09:01,209 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 06:09:01,209 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 06:09:01,210 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 06:09:01,210 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 06:09:01,210 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 06:09:01,210 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 06:09:01,210 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 06:09:01,210 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 06:09:01,210 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 06:09:01,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 06:09:01,210 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 06:09:01,210 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 06:09:01,211 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 06:09:01,211 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 06:09:01,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 06:09:01,211 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf2722f-e039-418a-baa3-c139e80d45e6/bin/ukojak-verify-CZk0znPC7b 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 -> 19f6a4e9c4337065cd35355f350ba61e20d7c158a393782dbdfa17548177e415 [2024-12-06 06:09:01,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 06:09:01,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 06:09:01,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 06:09:01,459 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 06:09:01,459 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 06:09:01,461 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf2722f-e039-418a-baa3-c139e80d45e6/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/eca-rers2012/Problem01_label44.c [2024-12-06 06:09:04,062 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf2722f-e039-418a-baa3-c139e80d45e6/bin/ukojak-verify-CZk0znPC7b/data/d156652b4/da38169a84ca4b809e34a3bfd716892b/FLAGddb1665bb [2024-12-06 06:09:04,317 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 06:09:04,317 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf2722f-e039-418a-baa3-c139e80d45e6/sv-benchmarks/c/eca-rers2012/Problem01_label44.c [2024-12-06 06:09:04,329 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf2722f-e039-418a-baa3-c139e80d45e6/bin/ukojak-verify-CZk0znPC7b/data/d156652b4/da38169a84ca4b809e34a3bfd716892b/FLAGddb1665bb [2024-12-06 06:09:04,642 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf2722f-e039-418a-baa3-c139e80d45e6/bin/ukojak-verify-CZk0znPC7b/data/d156652b4/da38169a84ca4b809e34a3bfd716892b [2024-12-06 06:09:04,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 06:09:04,645 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 06:09:04,646 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 06:09:04,646 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 06:09:04,649 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 06:09:04,649 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:09:04" (1/1) ... [2024-12-06 06:09:04,650 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a09893f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:09:04, skipping insertion in model container [2024-12-06 06:09:04,650 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:09:04" (1/1) ... [2024-12-06 06:09:04,674 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 06:09:04,870 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf2722f-e039-418a-baa3-c139e80d45e6/sv-benchmarks/c/eca-rers2012/Problem01_label44.c[16002,16015] [2024-12-06 06:09:04,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 06:09:04,912 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 06:09:04,973 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf2722f-e039-418a-baa3-c139e80d45e6/sv-benchmarks/c/eca-rers2012/Problem01_label44.c[16002,16015] [2024-12-06 06:09:04,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 06:09:05,004 INFO L204 MainTranslator]: Completed translation [2024-12-06 06:09:05,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:09:05 WrapperNode [2024-12-06 06:09:05,005 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 06:09:05,006 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 06:09:05,006 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 06:09:05,006 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 06:09:05,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:09:05" (1/1) ... [2024-12-06 06:09:05,026 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:09:05" (1/1) ... [2024-12-06 06:09:05,059 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-12-06 06:09:05,059 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 06:09:05,060 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 06:09:05,060 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 06:09:05,060 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 06:09:05,068 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:09:05" (1/1) ... [2024-12-06 06:09:05,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:09:05" (1/1) ... [2024-12-06 06:09:05,072 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:09:05" (1/1) ... [2024-12-06 06:09:05,072 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:09:05" (1/1) ... [2024-12-06 06:09:05,090 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:09:05" (1/1) ... [2024-12-06 06:09:05,092 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:09:05" (1/1) ... [2024-12-06 06:09:05,099 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:09:05" (1/1) ... [2024-12-06 06:09:05,104 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:09:05" (1/1) ... [2024-12-06 06:09:05,107 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:09:05" (1/1) ... [2024-12-06 06:09:05,112 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 06:09:05,113 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 06:09:05,113 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 06:09:05,113 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 06:09:05,114 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:09:05" (1/1) ... [2024-12-06 06:09:05,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 06:09:05,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf2722f-e039-418a-baa3-c139e80d45e6/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 06:09:05,143 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf2722f-e039-418a-baa3-c139e80d45e6/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 06:09:05,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf2722f-e039-418a-baa3-c139e80d45e6/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 06:09:05,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 06:09:05,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 06:09:05,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 06:09:05,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 06:09:05,236 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 06:09:05,238 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 06:09:06,088 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-12-06 06:09:06,088 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 06:09:06,277 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 06:09:06,278 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-06 06:09:06,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:09:06 BoogieIcfgContainer [2024-12-06 06:09:06,278 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 06:09:06,279 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 06:09:06,279 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 06:09:06,286 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 06:09:06,287 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:09:06" (1/1) ... [2024-12-06 06:09:06,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 06:09:06,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:06,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-12-06 06:09:06,333 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-12-06 06:09:06,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-12-06 06:09:06,336 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:06,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:06,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:06,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:09:07,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:07,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 145 states and 237 transitions. [2024-12-06 06:09:07,243 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 237 transitions. [2024-12-06 06:09:07,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-06 06:09:07,246 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:07,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:07,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:07,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 06:09:07,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:07,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 146 states and 238 transitions. [2024-12-06 06:09:07,622 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 238 transitions. [2024-12-06 06:09:07,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-12-06 06:09:07,623 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:07,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:07,721 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:09:07,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:07,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 150 states and 244 transitions. [2024-12-06 06:09:07,804 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 244 transitions. [2024-12-06 06:09:07,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-12-06 06:09:07,805 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:07,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:07,900 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 06:09:08,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:08,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 151 states and 245 transitions. [2024-12-06 06:09:08,050 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 245 transitions. [2024-12-06 06:09:08,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-12-06 06:09:08,051 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:08,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:08,177 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:09:08,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:08,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 159 states and 258 transitions. [2024-12-06 06:09:08,353 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 258 transitions. [2024-12-06 06:09:08,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-12-06 06:09:08,354 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:08,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:08,446 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:09:08,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:08,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 160 states and 259 transitions. [2024-12-06 06:09:08,566 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 259 transitions. [2024-12-06 06:09:08,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-12-06 06:09:08,568 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:08,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:08,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:08,676 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:09:08,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:08,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 168 states and 268 transitions. [2024-12-06 06:09:08,795 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 268 transitions. [2024-12-06 06:09:08,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-12-06 06:09:08,796 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:08,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:08,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:08,952 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:09:09,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:09,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 182 states and 286 transitions. [2024-12-06 06:09:09,228 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 286 transitions. [2024-12-06 06:09:09,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-12-06 06:09:09,229 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:09,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:09,341 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:09:09,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:09,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 197 states and 306 transitions. [2024-12-06 06:09:09,740 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 306 transitions. [2024-12-06 06:09:09,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-06 06:09:09,740 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:09,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:09,929 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:09:10,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:10,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 212 states and 327 transitions. [2024-12-06 06:09:10,520 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 327 transitions. [2024-12-06 06:09:10,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-06 06:09:10,520 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:10,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:10,641 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:09:11,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:11,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 230 states and 356 transitions. [2024-12-06 06:09:11,264 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2024-12-06 06:09:11,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-12-06 06:09:11,265 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:11,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:11,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:11,400 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:09:11,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:11,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 232 states and 359 transitions. [2024-12-06 06:09:11,577 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 359 transitions. [2024-12-06 06:09:11,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-12-06 06:09:11,578 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:11,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:11,648 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:09:11,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:11,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 237 states and 365 transitions. [2024-12-06 06:09:11,758 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 365 transitions. [2024-12-06 06:09:11,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-12-06 06:09:11,759 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:11,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:11,876 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 06:09:12,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:12,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 238 states and 366 transitions. [2024-12-06 06:09:12,030 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 366 transitions. [2024-12-06 06:09:12,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-12-06 06:09:12,031 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:12,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:12,117 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:09:12,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:12,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 257 states and 395 transitions. [2024-12-06 06:09:12,855 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 395 transitions. [2024-12-06 06:09:12,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-12-06 06:09:12,856 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:12,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:12,911 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:09:13,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:13,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 258 states and 396 transitions. [2024-12-06 06:09:13,061 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 396 transitions. [2024-12-06 06:09:13,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-12-06 06:09:13,062 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:13,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:13,169 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:09:13,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:13,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 273 states and 415 transitions. [2024-12-06 06:09:13,578 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 415 transitions. [2024-12-06 06:09:13,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-12-06 06:09:13,579 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:13,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:13,646 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 06:09:14,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:14,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 291 states and 435 transitions. [2024-12-06 06:09:14,218 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 435 transitions. [2024-12-06 06:09:14,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-12-06 06:09:14,219 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:14,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:14,284 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:09:14,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:14,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 295 states and 439 transitions. [2024-12-06 06:09:14,328 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 439 transitions. [2024-12-06 06:09:14,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-12-06 06:09:14,329 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:14,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:14,420 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 06:09:14,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:14,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 299 states and 444 transitions. [2024-12-06 06:09:14,693 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 444 transitions. [2024-12-06 06:09:14,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-06 06:09:14,694 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:14,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:14,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:14,753 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 06:09:15,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:15,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 307 states and 459 transitions. [2024-12-06 06:09:15,114 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 459 transitions. [2024-12-06 06:09:15,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-06 06:09:15,115 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:15,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:15,163 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 06:09:15,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:15,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 313 states and 467 transitions. [2024-12-06 06:09:15,459 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 467 transitions. [2024-12-06 06:09:15,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-06 06:09:15,459 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:15,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:15,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:15,512 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 06:09:15,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:15,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 316 states and 471 transitions. [2024-12-06 06:09:15,679 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 471 transitions. [2024-12-06 06:09:15,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-06 06:09:15,680 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:15,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:15,720 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:09:16,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:16,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 331 states and 491 transitions. [2024-12-06 06:09:16,100 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 491 transitions. [2024-12-06 06:09:16,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-12-06 06:09:16,101 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:16,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:16,172 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:09:16,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:16,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 345 states and 508 transitions. [2024-12-06 06:09:16,422 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 508 transitions. [2024-12-06 06:09:16,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-12-06 06:09:16,423 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:16,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:16,541 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:09:16,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:16,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 347 states and 510 transitions. [2024-12-06 06:09:16,763 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 510 transitions. [2024-12-06 06:09:16,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-06 06:09:16,764 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:16,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:16,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:16,800 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 06:09:17,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:17,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 353 states and 516 transitions. [2024-12-06 06:09:17,032 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 516 transitions. [2024-12-06 06:09:17,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-06 06:09:17,033 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:17,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:17,081 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 06:09:17,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:17,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 357 states and 519 transitions. [2024-12-06 06:09:17,121 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 519 transitions. [2024-12-06 06:09:17,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-06 06:09:17,122 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:17,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:17,191 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:09:17,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:17,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 359 states and 522 transitions. [2024-12-06 06:09:17,234 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 522 transitions. [2024-12-06 06:09:17,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-12-06 06:09:17,234 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:17,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:17,325 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:09:17,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:17,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 373 states and 540 transitions. [2024-12-06 06:09:17,696 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 540 transitions. [2024-12-06 06:09:17,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-12-06 06:09:17,697 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:17,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:17,772 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:09:17,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:17,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 377 states and 545 transitions. [2024-12-06 06:09:17,986 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 545 transitions. [2024-12-06 06:09:17,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-06 06:09:17,987 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:17,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:18,106 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 06:09:18,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:18,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 379 states and 548 transitions. [2024-12-06 06:09:18,238 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 548 transitions. [2024-12-06 06:09:18,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-06 06:09:18,239 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:18,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:18,416 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 35 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:09:18,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:18,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 386 states and 555 transitions. [2024-12-06 06:09:18,711 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 555 transitions. [2024-12-06 06:09:18,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-06 06:09:18,712 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:18,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:18,838 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 06:09:19,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:19,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 395 states and 564 transitions. [2024-12-06 06:09:19,178 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 564 transitions. [2024-12-06 06:09:19,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-06 06:09:19,179 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:19,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:19,285 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 06:09:19,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:19,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 399 states and 567 transitions. [2024-12-06 06:09:19,504 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 567 transitions. [2024-12-06 06:09:19,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-06 06:09:19,505 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:19,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:19,608 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 06:09:19,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:19,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 402 states and 569 transitions. [2024-12-06 06:09:19,786 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 569 transitions. [2024-12-06 06:09:19,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-06 06:09:19,786 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:19,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:19,833 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-12-06 06:09:20,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:20,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 477 states and 646 transitions. [2024-12-06 06:09:20,268 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 646 transitions. [2024-12-06 06:09:20,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-12-06 06:09:20,268 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:20,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:20,310 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:09:20,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:20,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 491 states and 662 transitions. [2024-12-06 06:09:20,395 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 662 transitions. [2024-12-06 06:09:20,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-12-06 06:09:20,396 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:20,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:20,446 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:09:20,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:20,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 502 states and 675 transitions. [2024-12-06 06:09:20,578 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 675 transitions. [2024-12-06 06:09:20,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-06 06:09:20,579 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:20,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:20,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:20,614 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 06:09:20,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:20,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 507 states and 682 transitions. [2024-12-06 06:09:20,786 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 682 transitions. [2024-12-06 06:09:20,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-12-06 06:09:20,786 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:20,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:20,844 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 42 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:09:20,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:20,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 509 states and 685 transitions. [2024-12-06 06:09:20,870 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 685 transitions. [2024-12-06 06:09:20,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-12-06 06:09:20,871 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:20,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:20,919 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 06:09:21,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:21,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 516 states and 693 transitions. [2024-12-06 06:09:21,044 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 693 transitions. [2024-12-06 06:09:21,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-12-06 06:09:21,045 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:21,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:21,081 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 06:09:21,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:21,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 518 states and 694 transitions. [2024-12-06 06:09:21,183 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 694 transitions. [2024-12-06 06:09:21,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-06 06:09:21,183 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:21,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:21,229 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:09:21,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:21,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 556 states and 738 transitions. [2024-12-06 06:09:21,939 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 738 transitions. [2024-12-06 06:09:21,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-06 06:09:21,940 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:21,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:21,995 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:09:22,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:22,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 559 states and 740 transitions. [2024-12-06 06:09:22,183 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 740 transitions. [2024-12-06 06:09:22,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-06 06:09:22,184 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:22,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:22,229 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:09:22,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:22,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 562 states and 742 transitions. [2024-12-06 06:09:22,433 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 742 transitions. [2024-12-06 06:09:22,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-06 06:09:22,433 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:22,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:22,467 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:09:22,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:22,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 571 states and 752 transitions. [2024-12-06 06:09:22,515 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 752 transitions. [2024-12-06 06:09:22,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-12-06 06:09:22,516 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:22,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:22,563 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 06:09:22,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:22,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 580 states and 760 transitions. [2024-12-06 06:09:22,614 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 760 transitions. [2024-12-06 06:09:22,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-12-06 06:09:22,615 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:22,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:22,671 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-12-06 06:09:23,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:23,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 669 states and 852 transitions. [2024-12-06 06:09:23,341 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 852 transitions. [2024-12-06 06:09:23,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-06 06:09:23,342 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:23,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:23,411 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:09:23,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:23,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 696 states and 880 transitions. [2024-12-06 06:09:23,590 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 880 transitions. [2024-12-06 06:09:23,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-12-06 06:09:23,591 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:23,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:23,696 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:09:23,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:23,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 724 states and 909 transitions. [2024-12-06 06:09:23,988 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 909 transitions. [2024-12-06 06:09:23,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-06 06:09:23,989 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:23,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:24,043 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 06:09:24,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:24,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 725 states and 909 transitions. [2024-12-06 06:09:24,077 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 909 transitions. [2024-12-06 06:09:24,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-12-06 06:09:24,077 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:24,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:24,472 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:09:26,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:26,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 797 states and 1003 transitions. [2024-12-06 06:09:26,783 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1003 transitions. [2024-12-06 06:09:26,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-12-06 06:09:26,784 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:26,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:26,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:26,969 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:09:27,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:27,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 801 states and 1008 transitions. [2024-12-06 06:09:27,498 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1008 transitions. [2024-12-06 06:09:27,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-12-06 06:09:27,499 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:27,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:27,555 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:09:27,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:27,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 828 states and 1039 transitions. [2024-12-06 06:09:27,895 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1039 transitions. [2024-12-06 06:09:27,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-12-06 06:09:27,896 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:27,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:28,045 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:09:29,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:29,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 893 states and 1111 transitions. [2024-12-06 06:09:29,716 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1111 transitions. [2024-12-06 06:09:29,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-12-06 06:09:29,717 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:29,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:29,826 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:09:29,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:29,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 908 states and 1126 transitions. [2024-12-06 06:09:29,908 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1126 transitions. [2024-12-06 06:09:29,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-12-06 06:09:29,909 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:29,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:30,034 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-12-06 06:09:30,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:30,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 911 states and 1129 transitions. [2024-12-06 06:09:30,215 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1129 transitions. [2024-12-06 06:09:30,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-12-06 06:09:30,216 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:30,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:30,271 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-12-06 06:09:30,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:30,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 947 states and 1165 transitions. [2024-12-06 06:09:30,449 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1165 transitions. [2024-12-06 06:09:30,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-12-06 06:09:30,450 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:30,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:09:30,648 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 124 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-12-06 06:09:31,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:09:31,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 987 states and 1211 transitions. [2024-12-06 06:09:31,838 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1211 transitions. [2024-12-06 06:09:31,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-12-06 06:09:31,839 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:09:31,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:09:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 06:09:31,864 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-06 06:09:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 06:09:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 06:09:32,048 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-06 06:09:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 06:09:32,143 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 61 iterations. [2024-12-06 06:09:32,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 06:09:32 ImpRootNode [2024-12-06 06:09:32,237 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 06:09:32,238 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 06:09:32,238 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 06:09:32,238 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 06:09:32,239 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:09:06" (3/4) ... [2024-12-06 06:09:32,240 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-06 06:09:32,364 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 186. [2024-12-06 06:09:32,475 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf2722f-e039-418a-baa3-c139e80d45e6/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 06:09:32,476 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf2722f-e039-418a-baa3-c139e80d45e6/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 06:09:32,476 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 06:09:32,477 INFO L158 Benchmark]: Toolchain (without parser) took 27831.83ms. Allocated memory was 142.6MB in the beginning and 503.3MB in the end (delta: 360.7MB). Free memory was 114.0MB in the beginning and 285.0MB in the end (delta: -171.0MB). Peak memory consumption was 192.0MB. Max. memory is 16.1GB. [2024-12-06 06:09:32,477 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 142.6MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 06:09:32,478 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.28ms. Allocated memory is still 142.6MB. Free memory was 114.0MB in the beginning and 86.9MB in the end (delta: 27.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-06 06:09:32,478 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.81ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 81.5MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 06:09:32,478 INFO L158 Benchmark]: Boogie Preprocessor took 52.52ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 77.6MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 06:09:32,478 INFO L158 Benchmark]: RCFGBuilder took 1164.83ms. Allocated memory is still 142.6MB. Free memory was 77.4MB in the beginning and 62.7MB in the end (delta: 14.7MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. [2024-12-06 06:09:32,479 INFO L158 Benchmark]: CodeCheck took 25958.62ms. Allocated memory was 142.6MB in the beginning and 503.3MB in the end (delta: 360.7MB). Free memory was 62.7MB in the beginning and 314.3MB in the end (delta: -251.7MB). Peak memory consumption was 106.5MB. Max. memory is 16.1GB. [2024-12-06 06:09:32,479 INFO L158 Benchmark]: Witness Printer took 238.06ms. Allocated memory is still 503.3MB. Free memory was 314.3MB in the beginning and 285.0MB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-12-06 06:09:32,481 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: 25.8s, OverallIterations: 61, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48342 SdHoareTripleChecker+Valid, 130.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46451 mSDsluCounter, 8904 SdHoareTripleChecker+Invalid, 109.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7378 mSDsCounter, 23330 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 115377 IncrementalHoareTripleChecker+Invalid, 138707 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23330 mSolverCounterUnsat, 1526 mSDtfsCounter, 115377 mSolverCounterSat, 1.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48481 GetRequests, 47392 SyntacticMatches, 707 SemanticMatches, 382 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83763 ImplicationChecksByTransitivity, 14.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 6683 NumberOfCodeBlocks, 6683 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 6448 ConstructedInterpolants, 0 QuantifiedInterpolants, 14943 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 60 InterpolantComputations, 53 PerfectInterpolantSequences, 2471/2495 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, ConComCheckerStatistics: No data available - CounterExampleResult [Line: 438]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int d= 4; [L19] int e= 5; [L20] int f= 6; [L21] int c= 3; [L22] int b= 2; [L25] int u = 21; [L26] int v = 22; [L27] int w = 23; [L28] int x = 24; [L29] int y = 25; [L30] int z = 26; [L32] int a17 = 1; [L33] int a7 = 0; [L34] int a20 = 1; [L35] int a8 = 15; [L36] int a12 = 8; [L37] int a16 = 5; [L38] int a21 = 1; [L590] int output = -1; VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND TRUE (((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8)) [L42] a16 = 5 [L43] a20 = 0 [L44] return 24; VAL [\result=24, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND TRUE ((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15))) [L276] a17 = 0 [L277] return 24; VAL [\result=24, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, 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 TRUE ((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5)) [L323] a8 = 13 [L324] a16 = 4 [L325] return -1; VAL [\result=-1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L410] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L413] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L416] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L419] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L422] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L425] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L428] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L431] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L434] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L437] COND TRUE ((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L438] reach_error() VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 142.6MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.28ms. Allocated memory is still 142.6MB. Free memory was 114.0MB in the beginning and 86.9MB in the end (delta: 27.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.81ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 81.5MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.52ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 77.6MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1164.83ms. Allocated memory is still 142.6MB. Free memory was 77.4MB in the beginning and 62.7MB in the end (delta: 14.7MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. * CodeCheck took 25958.62ms. Allocated memory was 142.6MB in the beginning and 503.3MB in the end (delta: 360.7MB). Free memory was 62.7MB in the beginning and 314.3MB in the end (delta: -251.7MB). Peak memory consumption was 106.5MB. Max. memory is 16.1GB. * Witness Printer took 238.06ms. Allocated memory is still 503.3MB. Free memory was 314.3MB in the beginning and 285.0MB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-12-06 06:09:32,504 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf2722f-e039-418a-baa3-c139e80d45e6/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE