./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b76eb659-87de-4268-a2c8-5f81e02c6826/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b76eb659-87de-4268-a2c8-5f81e02c6826/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b76eb659-87de-4268-a2c8-5f81e02c6826/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b76eb659-87de-4268-a2c8-5f81e02c6826/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label20.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b76eb659-87de-4268-a2c8-5f81e02c6826/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b76eb659-87de-4268-a2c8-5f81e02c6826/bin/ukojak-verify-EEHR8qb7sm --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6d0713a1238e02d0284b255e77b84c086e26fd99d5533d6977fb0509f2ece092 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 22:19:36,809 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 22:19:36,895 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b76eb659-87de-4268-a2c8-5f81e02c6826/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 22:19:36,904 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 22:19:36,908 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 22:19:36,941 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 22:19:36,942 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 22:19:36,942 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 22:19:36,943 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 22:19:36,943 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 22:19:36,943 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 22:19:36,943 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 22:19:36,943 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 22:19:36,943 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 22:19:36,943 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 22:19:36,943 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 22:19:36,943 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 22:19:36,944 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 22:19:36,944 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 22:19:36,944 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 22:19:36,944 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 22:19:36,944 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 22:19:36,944 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 22:19:36,946 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 22:19:36,946 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 22:19:36,946 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 22:19:36,947 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 22:19:36,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 22:19:36,947 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 22:19:36,947 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 22:19:36,947 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 22:19:36,947 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 22:19:36,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 22:19:36,947 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_b76eb659-87de-4268-a2c8-5f81e02c6826/bin/ukojak-verify-EEHR8qb7sm Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6d0713a1238e02d0284b255e77b84c086e26fd99d5533d6977fb0509f2ece092 [2024-11-13 22:19:37,278 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 22:19:37,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 22:19:37,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 22:19:37,294 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 22:19:37,295 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 22:19:37,296 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b76eb659-87de-4268-a2c8-5f81e02c6826/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/eca-rers2012/Problem01_label20.c Unable to find full path for "g++" [2024-11-13 22:19:39,293 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 22:19:39,651 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 22:19:39,652 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b76eb659-87de-4268-a2c8-5f81e02c6826/sv-benchmarks/c/eca-rers2012/Problem01_label20.c [2024-11-13 22:19:39,664 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b76eb659-87de-4268-a2c8-5f81e02c6826/bin/ukojak-verify-EEHR8qb7sm/data/4562f584d/0686a640227b499bb9bafda950a6a651/FLAG63c825d7e [2024-11-13 22:19:39,879 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b76eb659-87de-4268-a2c8-5f81e02c6826/bin/ukojak-verify-EEHR8qb7sm/data/4562f584d/0686a640227b499bb9bafda950a6a651 [2024-11-13 22:19:39,883 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 22:19:39,884 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 22:19:39,887 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 22:19:39,887 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 22:19:39,891 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 22:19:39,892 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 10:19:39" (1/1) ... [2024-11-13 22:19:39,894 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38e74021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:19:39, skipping insertion in model container [2024-11-13 22:19:39,896 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 10:19:39" (1/1) ... [2024-11-13 22:19:39,951 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 22:19:40,325 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_b76eb659-87de-4268-a2c8-5f81e02c6826/sv-benchmarks/c/eca-rers2012/Problem01_label20.c[14503,14516] [2024-11-13 22:19:40,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 22:19:40,394 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 22:19:40,460 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_b76eb659-87de-4268-a2c8-5f81e02c6826/sv-benchmarks/c/eca-rers2012/Problem01_label20.c[14503,14516] [2024-11-13 22:19:40,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 22:19:40,503 INFO L204 MainTranslator]: Completed translation [2024-11-13 22:19:40,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:19:40 WrapperNode [2024-11-13 22:19:40,504 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 22:19:40,505 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 22:19:40,505 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 22:19:40,505 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 22:19:40,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:19:40" (1/1) ... [2024-11-13 22:19:40,532 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:19:40" (1/1) ... [2024-11-13 22:19:40,604 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-13 22:19:40,605 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 22:19:40,606 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 22:19:40,606 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 22:19:40,606 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 22:19:40,613 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:19:40" (1/1) ... [2024-11-13 22:19:40,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:19:40" (1/1) ... [2024-11-13 22:19:40,617 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:19:40" (1/1) ... [2024-11-13 22:19:40,618 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:19:40" (1/1) ... [2024-11-13 22:19:40,634 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:19:40" (1/1) ... [2024-11-13 22:19:40,641 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:19:40" (1/1) ... [2024-11-13 22:19:40,649 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:19:40" (1/1) ... [2024-11-13 22:19:40,655 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:19:40" (1/1) ... [2024-11-13 22:19:40,665 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 22:19:40,669 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 22:19:40,669 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 22:19:40,669 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 22:19:40,670 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:19:40" (1/1) ... [2024-11-13 22:19:40,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 22:19:40,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b76eb659-87de-4268-a2c8-5f81e02c6826/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 22:19:40,718 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b76eb659-87de-4268-a2c8-5f81e02c6826/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 22:19:40,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b76eb659-87de-4268-a2c8-5f81e02c6826/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 22:19:40,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 22:19:40,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 22:19:40,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 22:19:40,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 22:19:40,850 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 22:19:40,852 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 22:19:42,198 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-13 22:19:42,198 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 22:19:42,489 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 22:19:42,489 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 22:19:42,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:19:42 BoogieIcfgContainer [2024-11-13 22:19:42,490 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 22:19:42,491 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 22:19:42,491 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 22:19:42,500 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 22:19:42,501 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:19:42" (1/1) ... [2024-11-13 22:19:42,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 22:19:42,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:19:42,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-13 22:19:42,573 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-13 22:19:42,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 22:19:42,577 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:19:42,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:19:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:19:43,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:19:43,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:19:43,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 145 states and 261 transitions. [2024-11-13 22:19:43,842 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 261 transitions. [2024-11-13 22:19:43,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 22:19:43,845 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:19:43,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:19:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:19:44,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:19:44,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:19:44,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 215 states and 339 transitions. [2024-11-13 22:19:44,997 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 339 transitions. [2024-11-13 22:19:44,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-13 22:19:44,999 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:19:44,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:19:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:19:45,119 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:19:45,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:19:45,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 220 states and 346 transitions. [2024-11-13 22:19:45,217 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 346 transitions. [2024-11-13 22:19:45,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-13 22:19:45,219 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:19:45,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:19:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:19:45,400 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 22:19:46,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:19:46,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 291 states and 425 transitions. [2024-11-13 22:19:46,052 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 425 transitions. [2024-11-13 22:19:46,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 22:19:46,054 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:19:46,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:19:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:19:46,206 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:19:46,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:19:46,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 307 states and 444 transitions. [2024-11-13 22:19:46,543 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 444 transitions. [2024-11-13 22:19:46,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-13 22:19:46,546 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:19:46,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:19:46,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:19:46,782 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 22:19:47,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:19:47,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 317 states and 457 transitions. [2024-11-13 22:19:47,054 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 457 transitions. [2024-11-13 22:19:47,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 22:19:47,055 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:19:47,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:19:47,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:19:47,261 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 22:19:47,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:19:47,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 338 states and 481 transitions. [2024-11-13 22:19:47,702 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 481 transitions. [2024-11-13 22:19:47,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 22:19:47,703 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:19:47,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:19:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:19:48,052 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 22:19:48,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:19:48,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 349 states and 495 transitions. [2024-11-13 22:19:48,693 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 495 transitions. [2024-11-13 22:19:48,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 22:19:48,694 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:19:48,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:19:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:19:48,964 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 22:19:49,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:19:49,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 359 states and 506 transitions. [2024-11-13 22:19:49,166 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 506 transitions. [2024-11-13 22:19:49,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 22:19:49,169 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:19:49,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:19:49,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:19:49,269 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 22:19:49,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:19:49,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 365 states and 512 transitions. [2024-11-13 22:19:49,335 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 512 transitions. [2024-11-13 22:19:49,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 22:19:49,339 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:19:49,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:19:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:19:49,489 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-13 22:19:49,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:19:49,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 373 states and 525 transitions. [2024-11-13 22:19:49,813 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 525 transitions. [2024-11-13 22:19:49,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 22:19:49,816 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:19:49,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:19:49,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:19:49,937 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-13 22:19:50,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:19:50,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 380 states and 535 transitions. [2024-11-13 22:19:50,315 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 535 transitions. [2024-11-13 22:19:50,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 22:19:50,316 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:19:50,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:19:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:19:50,435 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-13 22:19:50,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:19:50,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 388 states and 544 transitions. [2024-11-13 22:19:50,653 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 544 transitions. [2024-11-13 22:19:50,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 22:19:50,654 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:19:50,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:19:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:19:50,782 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-13 22:19:50,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:19:50,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 390 states and 546 transitions. [2024-11-13 22:19:50,857 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 546 transitions. [2024-11-13 22:19:50,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 22:19:50,858 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:19:50,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:19:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:19:51,043 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-13 22:19:51,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:19:51,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 398 states and 556 transitions. [2024-11-13 22:19:51,431 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 556 transitions. [2024-11-13 22:19:51,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 22:19:51,432 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:19:51,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:19:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:19:51,649 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-13 22:19:51,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:19:51,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 400 states and 558 transitions. [2024-11-13 22:19:51,704 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 558 transitions. [2024-11-13 22:19:51,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 22:19:51,705 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:19:51,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:19:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:19:51,920 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-13 22:19:51,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:19:51,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 402 states and 560 transitions. [2024-11-13 22:19:51,971 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 560 transitions. [2024-11-13 22:19:51,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 22:19:51,972 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:19:51,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:19:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:19:52,222 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 22:19:52,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:19:52,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 407 states and 568 transitions. [2024-11-13 22:19:52,762 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 568 transitions. [2024-11-13 22:19:52,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 22:19:52,764 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:19:52,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:19:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:19:52,954 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 22:19:53,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:19:53,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 417 states and 579 transitions. [2024-11-13 22:19:53,218 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 579 transitions. [2024-11-13 22:19:53,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 22:19:53,220 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:19:53,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:19:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:19:53,402 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 22:19:53,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:19:53,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 423 states and 585 transitions. [2024-11-13 22:19:53,606 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 585 transitions. [2024-11-13 22:19:53,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 22:19:53,608 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:19:53,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:19:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:19:53,788 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 22:19:54,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:19:54,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 440 states and 604 transitions. [2024-11-13 22:19:54,137 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 604 transitions. [2024-11-13 22:19:54,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 22:19:54,139 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:19:54,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:19:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:19:54,217 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 22:19:54,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:19:54,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 454 states and 618 transitions. [2024-11-13 22:19:54,319 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 618 transitions. [2024-11-13 22:19:54,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 22:19:54,321 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:19:54,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:19:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:19:54,474 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 22:19:55,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:19:55,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 484 states and 655 transitions. [2024-11-13 22:19:55,351 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 655 transitions. [2024-11-13 22:19:55,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 22:19:55,353 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:19:55,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:19:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:19:55,505 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 22:19:56,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:19:56,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 507 states and 679 transitions. [2024-11-13 22:19:56,194 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 679 transitions. [2024-11-13 22:19:56,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-13 22:19:56,196 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:19:56,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:19:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:19:56,290 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:19:56,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:19:56,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 536 states and 709 transitions. [2024-11-13 22:19:56,546 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 709 transitions. [2024-11-13 22:19:56,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-13 22:19:56,547 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:19:56,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:19:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:19:56,681 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 22:19:57,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:19:57,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 584 states and 761 transitions. [2024-11-13 22:19:57,478 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 761 transitions. [2024-11-13 22:19:57,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-13 22:19:57,482 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:19:57,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:19:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:19:57,630 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-13 22:19:57,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:19:57,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 598 states and 775 transitions. [2024-11-13 22:19:57,836 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 775 transitions. [2024-11-13 22:19:57,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-13 22:19:57,838 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:19:57,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:19:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:19:58,159 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 22:19:58,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:19:58,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 609 states and 789 transitions. [2024-11-13 22:19:58,918 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 789 transitions. [2024-11-13 22:19:58,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-13 22:19:58,920 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:19:58,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:19:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:19:59,129 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 22:19:59,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:19:59,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 619 states and 800 transitions. [2024-11-13 22:19:59,430 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 800 transitions. [2024-11-13 22:19:59,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-13 22:19:59,432 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:19:59,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:19:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:19:59,701 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-13 22:20:00,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:00,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 634 states and 819 transitions. [2024-11-13 22:20:00,738 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 819 transitions. [2024-11-13 22:20:00,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-13 22:20:00,740 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:00,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:00,908 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-13 22:20:01,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:01,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 648 states and 834 transitions. [2024-11-13 22:20:01,380 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 834 transitions. [2024-11-13 22:20:01,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-13 22:20:01,382 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:01,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:01,520 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:20:01,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:01,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 687 states and 877 transitions. [2024-11-13 22:20:01,821 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 877 transitions. [2024-11-13 22:20:01,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-13 22:20:01,824 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:01,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:02,155 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:20:03,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:03,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 757 states and 955 transitions. [2024-11-13 22:20:03,140 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 955 transitions. [2024-11-13 22:20:03,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 22:20:03,142 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:03,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:03,631 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:20:05,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:05,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 826 states and 1044 transitions. [2024-11-13 22:20:05,804 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1044 transitions. [2024-11-13 22:20:05,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 22:20:05,806 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:05,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:06,097 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:20:07,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:07,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 894 states and 1116 transitions. [2024-11-13 22:20:07,677 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1116 transitions. [2024-11-13 22:20:07,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-13 22:20:07,679 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:07,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:07,788 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-13 22:20:08,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:08,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 895 states and 1116 transitions. [2024-11-13 22:20:08,094 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1116 transitions. [2024-11-13 22:20:08,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-13 22:20:08,097 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:08,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:08,365 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:20:09,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:09,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 923 states and 1146 transitions. [2024-11-13 22:20:09,007 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1146 transitions. [2024-11-13 22:20:09,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-13 22:20:09,008 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:09,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:09,315 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 101 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 22:20:10,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:10,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 963 states and 1191 transitions. [2024-11-13 22:20:10,655 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1191 transitions. [2024-11-13 22:20:10,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-13 22:20:10,656 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:10,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:10,879 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 101 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 22:20:12,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:12,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1002 states and 1237 transitions. [2024-11-13 22:20:12,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1237 transitions. [2024-11-13 22:20:12,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-13 22:20:12,019 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:12,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:12,424 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:20:13,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:13,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1073 states and 1308 transitions. [2024-11-13 22:20:13,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1308 transitions. [2024-11-13 22:20:13,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-13 22:20:13,793 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:13,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:13,999 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 126 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 22:20:14,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:14,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1092 states and 1330 transitions. [2024-11-13 22:20:14,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1330 transitions. [2024-11-13 22:20:14,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-13 22:20:14,808 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:14,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:15,003 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 126 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 22:20:15,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:15,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1111 states and 1351 transitions. [2024-11-13 22:20:15,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1351 transitions. [2024-11-13 22:20:15,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 22:20:15,817 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:15,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:16,121 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 87 proven. 3 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-13 22:20:16,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:16,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1126 states and 1368 transitions. [2024-11-13 22:20:16,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1368 transitions. [2024-11-13 22:20:16,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 22:20:16,801 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:16,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:16,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:17,026 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 87 proven. 3 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-13 22:20:17,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:17,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1141 states and 1385 transitions. [2024-11-13 22:20:17,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1385 transitions. [2024-11-13 22:20:17,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-13 22:20:17,705 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:17,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:17,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:17,889 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 97 proven. 29 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 22:20:18,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:18,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1160 states and 1406 transitions. [2024-11-13 22:20:18,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1406 transitions. [2024-11-13 22:20:18,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-13 22:20:18,741 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:18,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:18,857 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 97 proven. 29 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 22:20:19,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:19,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1179 states and 1427 transitions. [2024-11-13 22:20:19,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1427 transitions. [2024-11-13 22:20:19,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-13 22:20:19,676 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:19,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:19,751 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 22:20:20,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:20,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1196 states and 1448 transitions. [2024-11-13 22:20:20,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1448 transitions. [2024-11-13 22:20:20,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-13 22:20:20,716 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:20,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:20,852 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 127 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-13 22:20:21,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:21,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1212 states and 1468 transitions. [2024-11-13 22:20:21,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1468 transitions. [2024-11-13 22:20:21,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-13 22:20:21,233 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:21,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:21,667 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 106 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 22:20:22,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:22,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1223 states and 1481 transitions. [2024-11-13 22:20:22,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1481 transitions. [2024-11-13 22:20:22,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-13 22:20:22,512 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:22,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:22,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:22,863 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 106 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 22:20:23,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:23,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1227 states and 1485 transitions. [2024-11-13 22:20:23,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1485 transitions. [2024-11-13 22:20:23,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-13 22:20:23,171 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:23,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:23,411 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 22:20:24,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:24,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1248 states and 1511 transitions. [2024-11-13 22:20:24,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1511 transitions. [2024-11-13 22:20:24,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-13 22:20:24,064 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:24,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:24,360 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 114 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-13 22:20:25,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:25,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1289 states and 1556 transitions. [2024-11-13 22:20:25,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1556 transitions. [2024-11-13 22:20:25,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-13 22:20:25,960 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:25,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:25,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:26,201 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 114 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-13 22:20:27,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:27,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1327 states and 1597 transitions. [2024-11-13 22:20:27,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1597 transitions. [2024-11-13 22:20:27,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 22:20:27,187 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:27,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:27,756 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:20:29,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:29,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1360 states and 1638 transitions. [2024-11-13 22:20:29,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1638 transitions. [2024-11-13 22:20:29,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 22:20:29,052 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:29,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:29,354 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:20:29,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:29,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1370 states and 1649 transitions. [2024-11-13 22:20:29,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1649 transitions. [2024-11-13 22:20:29,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 22:20:29,932 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:29,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:30,270 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:20:31,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:31,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1389 states and 1670 transitions. [2024-11-13 22:20:31,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1670 transitions. [2024-11-13 22:20:31,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 22:20:31,132 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:31,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:31,481 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:20:31,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:31,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1393 states and 1675 transitions. [2024-11-13 22:20:31,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1675 transitions. [2024-11-13 22:20:31,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-13 22:20:31,899 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:31,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:31,966 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 22:20:32,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:32,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1409 states and 1692 transitions. [2024-11-13 22:20:32,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1409 states and 1692 transitions. [2024-11-13 22:20:32,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-13 22:20:32,291 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:32,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:32,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:32,383 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 22:20:32,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:32,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1410 states and 1695 transitions. [2024-11-13 22:20:32,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 1695 transitions. [2024-11-13 22:20:32,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-13 22:20:32,748 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:32,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:32,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:33,019 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 22:20:33,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:33,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1413 states and 1698 transitions. [2024-11-13 22:20:33,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 1698 transitions. [2024-11-13 22:20:33,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-13 22:20:33,287 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:33,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:33,512 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 22:20:33,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:33,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1416 states and 1701 transitions. [2024-11-13 22:20:33,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 1701 transitions. [2024-11-13 22:20:33,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-13 22:20:33,715 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:33,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:33,838 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-13 22:20:34,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:34,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1727 states to 1441 states and 1727 transitions. [2024-11-13 22:20:34,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 1727 transitions. [2024-11-13 22:20:34,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-13 22:20:34,219 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:34,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:34,344 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-13 22:20:34,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:34,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1465 states and 1751 transitions. [2024-11-13 22:20:34,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 1751 transitions. [2024-11-13 22:20:34,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 22:20:34,728 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:34,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:35,353 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:20:37,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:37,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1496 states and 1794 transitions. [2024-11-13 22:20:37,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 1794 transitions. [2024-11-13 22:20:37,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 22:20:37,709 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:37,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:37,954 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:20:41,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:41,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1541 states and 1847 transitions. [2024-11-13 22:20:41,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 1847 transitions. [2024-11-13 22:20:41,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 22:20:41,544 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:41,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:41,923 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:20:42,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:42,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1543 states and 1848 transitions. [2024-11-13 22:20:42,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 1848 transitions. [2024-11-13 22:20:42,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 22:20:42,338 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:42,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:42,787 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:20:43,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:43,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1560 states and 1865 transitions. [2024-11-13 22:20:43,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 1865 transitions. [2024-11-13 22:20:43,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 22:20:43,377 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:43,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:43,619 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:20:44,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:44,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1562 states and 1867 transitions. [2024-11-13 22:20:44,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 1867 transitions. [2024-11-13 22:20:44,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-13 22:20:44,015 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:44,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:44,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:44,343 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-13 22:20:45,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:45,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1579 states and 1889 transitions. [2024-11-13 22:20:45,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 1889 transitions. [2024-11-13 22:20:45,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-13 22:20:45,285 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:45,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:45,401 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-13 22:20:46,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:46,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1611 states and 1926 transitions. [2024-11-13 22:20:46,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 1926 transitions. [2024-11-13 22:20:46,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-13 22:20:46,191 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:46,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:46,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:46,438 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 120 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 22:20:46,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:46,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1612 states and 1927 transitions. [2024-11-13 22:20:46,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 1927 transitions. [2024-11-13 22:20:46,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-13 22:20:46,672 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:46,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:46,793 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 22:20:47,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:47,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1641 states and 1960 transitions. [2024-11-13 22:20:47,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 1960 transitions. [2024-11-13 22:20:47,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 22:20:47,481 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:47,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:47,685 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 188 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-13 22:20:48,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:48,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1660 states and 1978 transitions. [2024-11-13 22:20:48,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 1978 transitions. [2024-11-13 22:20:48,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 22:20:48,863 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:48,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:49,222 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 188 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-13 22:20:50,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:50,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1677 states and 1995 transitions. [2024-11-13 22:20:50,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 1995 transitions. [2024-11-13 22:20:50,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 22:20:50,455 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:50,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:50,677 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 188 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-13 22:20:51,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:51,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1679 states and 1996 transitions. [2024-11-13 22:20:51,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 1996 transitions. [2024-11-13 22:20:51,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 22:20:51,043 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:51,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:51,311 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 127 proven. 44 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 22:20:52,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:52,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 1688 states and 2005 transitions. [2024-11-13 22:20:52,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1688 states and 2005 transitions. [2024-11-13 22:20:52,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 22:20:52,009 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:52,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:52,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:52,377 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:20:54,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:54,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 1715 states and 2035 transitions. [2024-11-13 22:20:54,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2035 transitions. [2024-11-13 22:20:54,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 22:20:54,028 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:54,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:54,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:54,365 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:20:55,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:55,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 1737 states and 2058 transitions. [2024-11-13 22:20:55,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 2058 transitions. [2024-11-13 22:20:55,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 22:20:55,389 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:55,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:55,625 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:20:56,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:56,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2078 states to 1756 states and 2078 transitions. [2024-11-13 22:20:56,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2078 transitions. [2024-11-13 22:20:56,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-13 22:20:56,540 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:56,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:57,247 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 191 proven. 38 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-13 22:20:58,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:58,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 1771 states and 2094 transitions. [2024-11-13 22:20:58,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2094 transitions. [2024-11-13 22:20:58,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 22:20:58,411 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:58,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:58,804 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 134 proven. 51 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 22:20:59,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:20:59,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 1778 states and 2101 transitions. [2024-11-13 22:20:59,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 2101 transitions. [2024-11-13 22:20:59,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 22:20:59,401 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:20:59,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:20:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:20:59,716 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 159 proven. 46 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-13 22:21:01,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:01,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 1820 states and 2146 transitions. [2024-11-13 22:21:01,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 2146 transitions. [2024-11-13 22:21:01,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 22:21:01,414 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:01,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:01,797 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 22:21:04,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:04,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 1870 states and 2202 transitions. [2024-11-13 22:21:04,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2202 transitions. [2024-11-13 22:21:04,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 22:21:04,767 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:04,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:04,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:05,116 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 22:21:07,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:07,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2240 states to 1905 states and 2240 transitions. [2024-11-13 22:21:07,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1905 states and 2240 transitions. [2024-11-13 22:21:07,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 22:21:07,222 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:07,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:07,467 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 137 proven. 54 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 22:21:07,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:07,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 1908 states and 2244 transitions. [2024-11-13 22:21:07,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 2244 transitions. [2024-11-13 22:21:07,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 22:21:07,804 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:07,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:07,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:08,264 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 22:21:09,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:09,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2266 states to 1926 states and 2266 transitions. [2024-11-13 22:21:09,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 2266 transitions. [2024-11-13 22:21:09,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 22:21:09,953 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:09,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:10,239 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 22:21:13,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:13,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 1977 states and 2320 transitions. [2024-11-13 22:21:13,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2320 transitions. [2024-11-13 22:21:13,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-13 22:21:13,912 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:13,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:14,359 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:21:16,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:16,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 1990 states and 2336 transitions. [2024-11-13 22:21:16,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 2336 transitions. [2024-11-13 22:21:16,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-13 22:21:16,184 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:16,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:16,520 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:21:17,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:17,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2342 states to 1997 states and 2342 transitions. [2024-11-13 22:21:17,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 2342 transitions. [2024-11-13 22:21:17,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 22:21:17,725 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:17,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:17,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:18,324 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 22:21:23,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:23,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2413 states to 2061 states and 2413 transitions. [2024-11-13 22:21:23,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2061 states and 2413 transitions. [2024-11-13 22:21:23,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 22:21:23,816 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:23,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:24,078 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 22:21:27,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:27,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2480 states to 2124 states and 2480 transitions. [2024-11-13 22:21:27,852 INFO L276 IsEmpty]: Start isEmpty. Operand 2124 states and 2480 transitions. [2024-11-13 22:21:27,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-13 22:21:27,854 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:27,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:28,121 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2024-11-13 22:21:28,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:28,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2194 states and 2552 transitions. [2024-11-13 22:21:28,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2194 states and 2552 transitions. [2024-11-13 22:21:28,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-13 22:21:28,790 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:28,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:29,128 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2024-11-13 22:21:30,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:30,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2264 states and 2624 transitions. [2024-11-13 22:21:30,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 2624 transitions. [2024-11-13 22:21:30,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-13 22:21:30,145 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:30,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:30,350 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-13 22:21:31,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:31,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2266 states and 2626 transitions. [2024-11-13 22:21:31,001 INFO L276 IsEmpty]: Start isEmpty. Operand 2266 states and 2626 transitions. [2024-11-13 22:21:31,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-13 22:21:31,003 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:31,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:31,922 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 184 proven. 36 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-13 22:21:35,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:35,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2302 states and 2674 transitions. [2024-11-13 22:21:35,681 INFO L276 IsEmpty]: Start isEmpty. Operand 2302 states and 2674 transitions. [2024-11-13 22:21:35,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-13 22:21:35,683 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:35,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:35,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:36,335 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 172 proven. 137 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 22:21:38,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:38,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2327 states and 2704 transitions. [2024-11-13 22:21:38,184 INFO L276 IsEmpty]: Start isEmpty. Operand 2327 states and 2704 transitions. [2024-11-13 22:21:38,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-13 22:21:38,187 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:38,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:38,656 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 172 proven. 137 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 22:21:39,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:39,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2709 states to 2332 states and 2709 transitions. [2024-11-13 22:21:39,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 2709 transitions. [2024-11-13 22:21:39,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 22:21:39,331 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:39,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:39,500 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-13 22:21:39,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:39,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2726 states to 2346 states and 2726 transitions. [2024-11-13 22:21:39,837 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 2726 transitions. [2024-11-13 22:21:39,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-13 22:21:39,838 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:39,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:39,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:39,935 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-11-13 22:21:40,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:40,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2802 states to 2420 states and 2802 transitions. [2024-11-13 22:21:40,964 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 2802 transitions. [2024-11-13 22:21:40,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-13 22:21:40,965 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:40,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:40,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:42,292 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 22:21:49,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:49,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2930 states to 2524 states and 2930 transitions. [2024-11-13 22:21:49,199 INFO L276 IsEmpty]: Start isEmpty. Operand 2524 states and 2930 transitions. [2024-11-13 22:21:49,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-13 22:21:49,201 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:49,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:21:49,306 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2024-11-13 22:21:49,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:21:49,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2930 states to 2525 states and 2930 transitions. [2024-11-13 22:21:49,768 INFO L276 IsEmpty]: Start isEmpty. Operand 2525 states and 2930 transitions. [2024-11-13 22:21:49,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-13 22:21:49,769 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:21:49,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:21:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 22:21:49,813 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 22:21:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 22:21:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 22:21:50,170 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 22:21:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 22:21:50,339 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 102 iterations. [2024-11-13 22:21:50,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 10:21:50 ImpRootNode [2024-11-13 22:21:50,546 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 22:21:50,547 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 22:21:50,547 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 22:21:50,548 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 22:21:50,548 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:19:42" (3/4) ... [2024-11-13 22:21:50,549 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 22:21:50,762 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b76eb659-87de-4268-a2c8-5f81e02c6826/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 22:21:50,762 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 22:21:50,764 INFO L158 Benchmark]: Toolchain (without parser) took 130879.21ms. Allocated memory was 117.4MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 91.2MB in the beginning and 1.0GB in the end (delta: -909.2MB). Peak memory consumption was 765.7MB. Max. memory is 16.1GB. [2024-11-13 22:21:50,764 INFO L158 Benchmark]: CDTParser took 1.74ms. Allocated memory is still 117.4MB. Free memory was 75.2MB in the beginning and 75.0MB in the end (delta: 195.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 22:21:50,765 INFO L158 Benchmark]: CACSL2BoogieTranslator took 617.83ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 64.3MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 22:21:50,765 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.93ms. Allocated memory is still 117.4MB. Free memory was 64.3MB in the beginning and 58.8MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 22:21:50,765 INFO L158 Benchmark]: Boogie Preprocessor took 62.73ms. Allocated memory is still 117.4MB. Free memory was 58.8MB in the beginning and 54.9MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 22:21:50,766 INFO L158 Benchmark]: RCFGBuilder took 1820.83ms. Allocated memory is still 117.4MB. Free memory was 54.9MB in the beginning and 73.2MB in the end (delta: -18.3MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. [2024-11-13 22:21:50,766 INFO L158 Benchmark]: CodeCheck took 128056.09ms. Allocated memory was 117.4MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 73.2MB in the beginning and 1.0GB in the end (delta: -960.7MB). Peak memory consumption was 712.6MB. Max. memory is 16.1GB. [2024-11-13 22:21:50,767 INFO L158 Benchmark]: Witness Printer took 215.24ms. Allocated memory is still 1.8GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-13 22:21:50,769 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: 127.8s, OverallIterations: 102, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 246320 SdHoareTripleChecker+Valid, 738.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 244824 mSDsluCounter, 40053 SdHoareTripleChecker+Invalid, 631.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33974 mSDsCounter, 84296 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 558468 IncrementalHoareTripleChecker+Invalid, 642764 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84296 mSolverCounterUnsat, 6079 mSDtfsCounter, 558468 mSolverCounterSat, 6.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112582 GetRequests, 108078 SyntacticMatches, 3656 SemanticMatches, 848 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541928 ImplicationChecksByTransitivity, 82.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.7s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 24.8s InterpolantComputationTime, 16843 NumberOfCodeBlocks, 16843 NumberOfCodeBlocksAsserted, 102 NumberOfCheckSat, 16459 ConstructedInterpolants, 0 QuantifiedInterpolants, 84079 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 101 InterpolantComputations, 41 PerfectInterpolantSequences, 13657/15656 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 402]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int d= 4; [L19] int e= 5; [L20] int f= 6; [L21] int c= 3; [L22] int b= 2; [L25] int u = 21; [L26] int v = 22; [L27] int w = 23; [L28] int x = 24; [L29] int y = 25; [L30] int z = 26; [L32] int a17 = 1; [L33] int a7 = 0; [L34] int a20 = 1; [L35] int a8 = 15; [L36] int a12 = 8; [L37] int a16 = 5; [L38] int a21 = 1; [L590] int output = -1; VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L344] a17 = 0 [L345] a16 = 4 [L346] return 21; VAL [\result=21, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L279] a20 = 0 [L280] a17 = 1 [L281] a16 = 6 [L282] return 21; VAL [\result=21, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L73] a17 = 0 [L74] return 26; VAL [\result=26, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L83] a7 = 1 [L84] a17 = 1 [L85] a21 = 0 [L86] a20 = 1 [L87] a8 = 13 [L88] a16 = 5 [L89] return 26; VAL [\result=26, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND TRUE ((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5)) [L272] a16 = 4 [L273] a20 = 0 [L274] return 25; VAL [\result=25, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND TRUE ((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1))))))))) [L249] a20 = 0 [L250] a21 = 1 [L251] a17 = 0 [L252] a8 = 14 [L253] a16 = 4 [L254] return -1; VAL [\result=-1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L401] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L402] reach_error() VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, 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 1.74ms. Allocated memory is still 117.4MB. Free memory was 75.2MB in the beginning and 75.0MB in the end (delta: 195.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 617.83ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 64.3MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.93ms. Allocated memory is still 117.4MB. Free memory was 64.3MB in the beginning and 58.8MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.73ms. Allocated memory is still 117.4MB. Free memory was 58.8MB in the beginning and 54.9MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1820.83ms. Allocated memory is still 117.4MB. Free memory was 54.9MB in the beginning and 73.2MB in the end (delta: -18.3MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. * CodeCheck took 128056.09ms. Allocated memory was 117.4MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 73.2MB in the beginning and 1.0GB in the end (delta: -960.7MB). Peak memory consumption was 712.6MB. Max. memory is 16.1GB. * Witness Printer took 215.24ms. Allocated memory is still 1.8GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-13 22:21:50,815 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b76eb659-87de-4268-a2c8-5f81e02c6826/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE