./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label38.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2946b1c3-ffd5-48fa-92fd-824f6ba57610/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2946b1c3-ffd5-48fa-92fd-824f6ba57610/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2946b1c3-ffd5-48fa-92fd-824f6ba57610/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2946b1c3-ffd5-48fa-92fd-824f6ba57610/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label38.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2946b1c3-ffd5-48fa-92fd-824f6ba57610/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2946b1c3-ffd5-48fa-92fd-824f6ba57610/bin/ukojak-verify-ImItNfHLgk --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 af706eff0638e64b28329aeb8e4500504f7e95c7ca075a2e2f010d6212db9f23 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 22:05:31,192 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:05:31,288 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2946b1c3-ffd5-48fa-92fd-824f6ba57610/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-08 22:05:31,295 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:05:31,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 22:05:31,328 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:05:31,329 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:05:31,329 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 22:05:31,332 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:05:31,332 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:05:31,334 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:05:31,335 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:05:31,335 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:05:31,336 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:05:31,336 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:05:31,338 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:05:31,339 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:05:31,339 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:05:31,339 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:05:31,340 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:05:31,340 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:05:31,341 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:05:31,341 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:05:31,341 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 22:05:31,341 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 22:05:31,342 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 22:05:31,342 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:05:31,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 22:05:31,343 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:05:31,343 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:05:31,343 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:05:31,344 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 22:05:31,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:05:31,344 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2946b1c3-ffd5-48fa-92fd-824f6ba57610/bin/ukojak-verify-ImItNfHLgk/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2946b1c3-ffd5-48fa-92fd-824f6ba57610/bin/ukojak-verify-ImItNfHLgk 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 -> af706eff0638e64b28329aeb8e4500504f7e95c7ca075a2e2f010d6212db9f23 [2024-11-08 22:05:31,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:05:31,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:05:31,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:05:31,755 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:05:31,756 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:05:31,757 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2946b1c3-ffd5-48fa-92fd-824f6ba57610/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/eca-rers2012/Problem01_label38.c Unable to find full path for "g++" [2024-11-08 22:05:33,751 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:05:34,081 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:05:34,081 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2946b1c3-ffd5-48fa-92fd-824f6ba57610/sv-benchmarks/c/eca-rers2012/Problem01_label38.c [2024-11-08 22:05:34,125 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2946b1c3-ffd5-48fa-92fd-824f6ba57610/bin/ukojak-verify-ImItNfHLgk/data/e6b8bd463/04e2c9c8498e4128917b9beb812af29e/FLAG8016365cd [2024-11-08 22:05:34,143 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2946b1c3-ffd5-48fa-92fd-824f6ba57610/bin/ukojak-verify-ImItNfHLgk/data/e6b8bd463/04e2c9c8498e4128917b9beb812af29e [2024-11-08 22:05:34,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:05:34,147 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:05:34,149 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:05:34,149 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:05:34,154 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:05:34,156 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:05:34" (1/1) ... [2024-11-08 22:05:34,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3652f9d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:34, skipping insertion in model container [2024-11-08 22:05:34,161 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:05:34" (1/1) ... [2024-11-08 22:05:34,203 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:05:34,585 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_2946b1c3-ffd5-48fa-92fd-824f6ba57610/sv-benchmarks/c/eca-rers2012/Problem01_label38.c[15751,15764] [2024-11-08 22:05:34,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:05:34,638 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:05:34,735 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_2946b1c3-ffd5-48fa-92fd-824f6ba57610/sv-benchmarks/c/eca-rers2012/Problem01_label38.c[15751,15764] [2024-11-08 22:05:34,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:05:34,793 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:05:34,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:34 WrapperNode [2024-11-08 22:05:34,794 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:05:34,795 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:05:34,795 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:05:34,796 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:05:34,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:34" (1/1) ... [2024-11-08 22:05:34,819 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:34" (1/1) ... [2024-11-08 22:05:34,893 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-08 22:05:34,895 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:05:34,896 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:05:34,896 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:05:34,896 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:05:34,906 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:34" (1/1) ... [2024-11-08 22:05:34,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:34" (1/1) ... [2024-11-08 22:05:34,914 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:34" (1/1) ... [2024-11-08 22:05:34,920 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:34" (1/1) ... [2024-11-08 22:05:34,951 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:34" (1/1) ... [2024-11-08 22:05:34,968 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:34" (1/1) ... [2024-11-08 22:05:34,971 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:34" (1/1) ... [2024-11-08 22:05:34,978 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:34" (1/1) ... [2024-11-08 22:05:34,992 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:05:34,993 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:05:34,993 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:05:34,993 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:05:34,994 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:34" (1/1) ... [2024-11-08 22:05:35,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 22:05:35,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2946b1c3-ffd5-48fa-92fd-824f6ba57610/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 22:05:35,035 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2946b1c3-ffd5-48fa-92fd-824f6ba57610/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 22:05:35,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2946b1c3-ffd5-48fa-92fd-824f6ba57610/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 22:05:35,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:05:35,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 22:05:35,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:05:35,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:05:35,173 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:05:35,176 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:05:36,397 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-08 22:05:36,397 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:05:36,709 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:05:36,709 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:05:36,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:05:36 BoogieIcfgContainer [2024-11-08 22:05:36,710 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:05:36,711 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 22:05:36,711 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 22:05:36,722 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 22:05:36,723 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:05:36" (1/1) ... [2024-11-08 22:05:36,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:05:36,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:36,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-08 22:05:36,796 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-08 22:05:36,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-08 22:05:36,800 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:36,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:37,378 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-08 22:05:38,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:38,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 145 states and 219 transitions. [2024-11-08 22:05:38,112 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 219 transitions. [2024-11-08 22:05:38,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-08 22:05:38,115 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:38,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:38,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:38,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 22:05:38,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:38,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 146 states and 220 transitions. [2024-11-08 22:05:38,737 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2024-11-08 22:05:38,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-08 22:05:38,742 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:38,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:38,882 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-08 22:05:38,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:38,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 151 states and 227 transitions. [2024-11-08 22:05:39,001 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 227 transitions. [2024-11-08 22:05:39,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-08 22:05:39,003 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:39,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:39,206 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:05:39,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:39,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 221 states and 299 transitions. [2024-11-08 22:05:39,921 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 299 transitions. [2024-11-08 22:05:39,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-08 22:05:39,927 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:39,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:40,221 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:05:40,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:40,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 228 states and 308 transitions. [2024-11-08 22:05:40,413 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 308 transitions. [2024-11-08 22:05:40,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-08 22:05:40,419 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:40,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:40,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:40,667 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 22:05:41,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:41,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 239 states and 323 transitions. [2024-11-08 22:05:41,178 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 323 transitions. [2024-11-08 22:05:41,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-08 22:05:41,183 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:41,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:41,369 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:05:41,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:41,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 248 states and 332 transitions. [2024-11-08 22:05:41,470 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 332 transitions. [2024-11-08 22:05:41,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-08 22:05:41,471 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:41,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:41,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:41,613 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 22:05:41,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:41,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 256 states and 342 transitions. [2024-11-08 22:05:41,909 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 342 transitions. [2024-11-08 22:05:41,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-08 22:05:41,914 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:41,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:41,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:42,078 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 22:05:42,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:42,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 264 states and 355 transitions. [2024-11-08 22:05:42,427 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 355 transitions. [2024-11-08 22:05:42,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-08 22:05:42,428 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:42,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:42,587 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 22:05:43,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:43,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 277 states and 371 transitions. [2024-11-08 22:05:43,097 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 371 transitions. [2024-11-08 22:05:43,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-08 22:05:43,099 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:43,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:43,216 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 22:05:43,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:43,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 285 states and 380 transitions. [2024-11-08 22:05:43,444 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 380 transitions. [2024-11-08 22:05:43,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 22:05:43,445 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:43,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:43,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:43,649 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 22:05:43,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:43,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 292 states and 389 transitions. [2024-11-08 22:05:43,932 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 389 transitions. [2024-11-08 22:05:43,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 22:05:43,933 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:43,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:44,117 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 22:05:44,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:44,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 295 states and 393 transitions. [2024-11-08 22:05:44,365 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 393 transitions. [2024-11-08 22:05:44,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 22:05:44,366 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:44,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:44,440 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-08 22:05:44,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:44,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 296 states and 395 transitions. [2024-11-08 22:05:44,585 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 395 transitions. [2024-11-08 22:05:44,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 22:05:44,586 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:44,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:44,724 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 22:05:45,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:45,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 312 states and 416 transitions. [2024-11-08 22:05:45,463 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 416 transitions. [2024-11-08 22:05:45,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 22:05:45,465 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:45,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:45,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:45,706 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 22:05:46,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:46,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 327 states and 434 transitions. [2024-11-08 22:05:46,543 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 434 transitions. [2024-11-08 22:05:46,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-08 22:05:46,545 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:46,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:46,679 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-08 22:05:47,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:47,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 338 states and 447 transitions. [2024-11-08 22:05:47,291 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 447 transitions. [2024-11-08 22:05:47,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 22:05:47,293 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:47,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:47,372 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-08 22:05:47,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:47,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 345 states and 456 transitions. [2024-11-08 22:05:47,637 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 456 transitions. [2024-11-08 22:05:47,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 22:05:47,638 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:47,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:47,708 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 22:05:47,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:47,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 354 states and 467 transitions. [2024-11-08 22:05:47,823 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 467 transitions. [2024-11-08 22:05:47,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 22:05:47,825 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:47,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:47,972 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 22:05:48,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:48,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 368 states and 481 transitions. [2024-11-08 22:05:48,182 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 481 transitions. [2024-11-08 22:05:48,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 22:05:48,206 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:48,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:48,280 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-08 22:05:48,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:48,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 372 states and 485 transitions. [2024-11-08 22:05:48,331 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 485 transitions. [2024-11-08 22:05:48,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 22:05:48,333 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:48,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:48,456 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 22:05:48,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:48,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 381 states and 496 transitions. [2024-11-08 22:05:48,701 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 496 transitions. [2024-11-08 22:05:48,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 22:05:48,703 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:48,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:48,960 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 22:05:49,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:49,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 403 states and 522 transitions. [2024-11-08 22:05:49,776 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 522 transitions. [2024-11-08 22:05:49,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 22:05:49,779 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:49,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:49,855 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-08 22:05:49,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:49,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 405 states and 524 transitions. [2024-11-08 22:05:49,900 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 524 transitions. [2024-11-08 22:05:49,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-08 22:05:49,902 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:49,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:49,974 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-08 22:05:50,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:50,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 406 states and 525 transitions. [2024-11-08 22:05:50,033 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 525 transitions. [2024-11-08 22:05:50,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-08 22:05:50,036 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:50,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:50,151 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 22:05:50,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:50,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 423 states and 543 transitions. [2024-11-08 22:05:50,374 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 543 transitions. [2024-11-08 22:05:50,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 22:05:50,375 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:50,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:50,520 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 22:05:50,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:50,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 426 states and 547 transitions. [2024-11-08 22:05:50,607 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 547 transitions. [2024-11-08 22:05:50,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 22:05:50,609 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:50,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:50,811 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 22:05:51,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:51,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 440 states and 561 transitions. [2024-11-08 22:05:51,328 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 561 transitions. [2024-11-08 22:05:51,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 22:05:51,330 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:51,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:51,453 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:05:51,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:51,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 463 states and 586 transitions. [2024-11-08 22:05:51,655 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 586 transitions. [2024-11-08 22:05:51,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 22:05:51,658 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:51,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:51,799 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 22:05:51,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:51,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 464 states and 588 transitions. [2024-11-08 22:05:51,881 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 588 transitions. [2024-11-08 22:05:51,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 22:05:51,883 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:51,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:52,014 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 22:05:52,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:52,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 476 states and 601 transitions. [2024-11-08 22:05:52,208 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 601 transitions. [2024-11-08 22:05:52,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 22:05:52,210 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:52,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:52,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:52,581 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 61 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:05:53,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:53,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 484 states and 615 transitions. [2024-11-08 22:05:53,191 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 615 transitions. [2024-11-08 22:05:53,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 22:05:53,193 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:53,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:53,324 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:05:53,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:53,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 503 states and 636 transitions. [2024-11-08 22:05:53,549 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 636 transitions. [2024-11-08 22:05:53,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 22:05:53,550 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:53,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:53,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:53,702 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 22:05:53,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:53,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 505 states and 638 transitions. [2024-11-08 22:05:53,917 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 638 transitions. [2024-11-08 22:05:53,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 22:05:53,919 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:53,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:54,002 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 22:05:54,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:54,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 519 states and 652 transitions. [2024-11-08 22:05:54,132 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 652 transitions. [2024-11-08 22:05:54,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 22:05:54,133 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:54,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:54,210 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:05:54,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:54,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 527 states and 663 transitions. [2024-11-08 22:05:54,302 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 663 transitions. [2024-11-08 22:05:54,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 22:05:54,304 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:54,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:54,391 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-08 22:05:54,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:54,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 528 states and 664 transitions. [2024-11-08 22:05:54,456 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 664 transitions. [2024-11-08 22:05:54,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 22:05:54,459 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:54,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:54,602 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 22:05:55,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:55,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 558 states and 696 transitions. [2024-11-08 22:05:55,021 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 696 transitions. [2024-11-08 22:05:55,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 22:05:55,022 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:55,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:55,240 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 22:05:56,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:56,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 598 states and 738 transitions. [2024-11-08 22:05:56,235 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 738 transitions. [2024-11-08 22:05:56,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 22:05:56,237 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:56,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:56,396 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 22:05:56,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:56,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 603 states and 743 transitions. [2024-11-08 22:05:56,728 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 743 transitions. [2024-11-08 22:05:56,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 22:05:56,731 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:56,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:56,847 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 22:05:57,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:57,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 608 states and 749 transitions. [2024-11-08 22:05:57,118 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 749 transitions. [2024-11-08 22:05:57,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 22:05:57,121 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:57,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:57,424 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 62 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 22:05:57,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:57,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 614 states and 757 transitions. [2024-11-08 22:05:57,914 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 757 transitions. [2024-11-08 22:05:57,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 22:05:57,915 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:57,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:58,365 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-08 22:06:00,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:00,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 754 states and 906 transitions. [2024-11-08 22:06:00,252 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 906 transitions. [2024-11-08 22:06:00,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 22:06:00,254 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:00,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:00,730 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:06:03,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:03,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 825 states and 992 transitions. [2024-11-08 22:06:03,183 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 992 transitions. [2024-11-08 22:06:03,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 22:06:03,185 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:03,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:03,299 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:06:03,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:03,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 854 states and 1024 transitions. [2024-11-08 22:06:03,526 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1024 transitions. [2024-11-08 22:06:03,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 22:06:03,528 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:03,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:03,628 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-08 22:06:03,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:03,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 866 states and 1037 transitions. [2024-11-08 22:06:03,748 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1037 transitions. [2024-11-08 22:06:03,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-08 22:06:03,751 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:03,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:04,215 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-08 22:06:05,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:05,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 937 states and 1108 transitions. [2024-11-08 22:06:05,707 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1108 transitions. [2024-11-08 22:06:05,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 22:06:05,709 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:05,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:06,011 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 102 proven. 29 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-08 22:06:06,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:06,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 978 states and 1151 transitions. [2024-11-08 22:06:06,619 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1151 transitions. [2024-11-08 22:06:06,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 22:06:06,620 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:06,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:06,784 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-08 22:06:07,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:07,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1009 states and 1181 transitions. [2024-11-08 22:06:07,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1181 transitions. [2024-11-08 22:06:07,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 22:06:07,501 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:07,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:07,748 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:06:09,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:09,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1058 states and 1236 transitions. [2024-11-08 22:06:09,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1236 transitions. [2024-11-08 22:06:09,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 22:06:09,042 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:09,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:09,375 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 9 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-08 22:06:09,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:09,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1061 states and 1240 transitions. [2024-11-08 22:06:09,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1240 transitions. [2024-11-08 22:06:09,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 22:06:09,679 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:09,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:09,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:10,401 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 101 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:06:13,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:13,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1154 states and 1355 transitions. [2024-11-08 22:06:13,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1355 transitions. [2024-11-08 22:06:13,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 22:06:13,141 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:13,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:13,550 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 101 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:06:13,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:13,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1156 states and 1358 transitions. [2024-11-08 22:06:13,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1358 transitions. [2024-11-08 22:06:13,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 22:06:13,954 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:13,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:14,095 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-08 22:06:14,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:14,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1179 states and 1384 transitions. [2024-11-08 22:06:14,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1384 transitions. [2024-11-08 22:06:14,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-08 22:06:14,731 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:14,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:14,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:14,980 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-08 22:06:15,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:15,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1472 states to 1265 states and 1472 transitions. [2024-11-08 22:06:15,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1472 transitions. [2024-11-08 22:06:15,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 22:06:15,875 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:15,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:16,402 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:06:18,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:18,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1311 states and 1533 transitions. [2024-11-08 22:06:18,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1533 transitions. [2024-11-08 22:06:18,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 22:06:18,481 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:18,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:18,789 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:06:19,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:19,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1336 states and 1560 transitions. [2024-11-08 22:06:19,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1560 transitions. [2024-11-08 22:06:19,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 22:06:19,330 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:19,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:19,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:19,498 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-08 22:06:19,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:19,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1345 states and 1568 transitions. [2024-11-08 22:06:19,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1568 transitions. [2024-11-08 22:06:19,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-08 22:06:19,782 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:19,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:20,251 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 114 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-08 22:06:22,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:22,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1405 states and 1651 transitions. [2024-11-08 22:06:22,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 1651 transitions. [2024-11-08 22:06:22,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-08 22:06:22,688 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:22,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:22,865 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-08 22:06:25,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:25,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1432 states and 1681 transitions. [2024-11-08 22:06:25,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1681 transitions. [2024-11-08 22:06:25,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-08 22:06:25,008 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:25,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:25,290 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 114 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-08 22:06:26,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:26,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1436 states and 1684 transitions. [2024-11-08 22:06:26,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 1684 transitions. [2024-11-08 22:06:26,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-08 22:06:26,090 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:26,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:26,379 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 188 proven. 57 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-08 22:06:26,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:26,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1442 states and 1691 transitions. [2024-11-08 22:06:26,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1442 states and 1691 transitions. [2024-11-08 22:06:26,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-08 22:06:26,976 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:26,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:27,102 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-08 22:06:27,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:27,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1453 states and 1701 transitions. [2024-11-08 22:06:27,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 1701 transitions. [2024-11-08 22:06:27,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-08 22:06:27,785 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:27,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:28,469 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 3 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:06:30,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:30,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1486 states and 1739 transitions. [2024-11-08 22:06:30,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 1739 transitions. [2024-11-08 22:06:30,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-08 22:06:30,323 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:30,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:30,657 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 3 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:06:31,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:31,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1491 states and 1745 transitions. [2024-11-08 22:06:31,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 1745 transitions. [2024-11-08 22:06:31,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-08 22:06:31,202 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:31,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:31,714 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 64 proven. 119 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-08 22:06:34,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:34,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1646 states and 1916 transitions. [2024-11-08 22:06:34,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 1916 transitions. [2024-11-08 22:06:34,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-08 22:06:34,538 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:34,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:34,929 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:06:38,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:38,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2000 states to 1717 states and 2000 transitions. [2024-11-08 22:06:38,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 2000 transitions. [2024-11-08 22:06:38,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-08 22:06:38,062 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:38,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:38,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:38,627 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 146 proven. 97 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-08 22:06:39,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:39,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 1749 states and 2039 transitions. [2024-11-08 22:06:39,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1749 states and 2039 transitions. [2024-11-08 22:06:39,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-08 22:06:39,359 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:39,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:40,055 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 187 proven. 122 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-08 22:06:43,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:43,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 1797 states and 2096 transitions. [2024-11-08 22:06:43,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2096 transitions. [2024-11-08 22:06:43,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-08 22:06:43,791 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:43,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:44,042 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-08 22:06:44,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:44,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2108 states to 1811 states and 2108 transitions. [2024-11-08 22:06:44,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2108 transitions. [2024-11-08 22:06:44,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-08 22:06:44,907 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:44,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:44,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:45,292 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 159 proven. 98 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 22:06:45,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:45,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 1820 states and 2117 transitions. [2024-11-08 22:06:45,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 2117 transitions. [2024-11-08 22:06:45,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-08 22:06:45,530 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:45,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:45,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:46,706 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 197 proven. 67 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 22:06:48,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:48,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2141 states to 1839 states and 2141 transitions. [2024-11-08 22:06:48,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2141 transitions. [2024-11-08 22:06:48,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-08 22:06:48,672 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:48,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:06:48,718 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 22:06:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:06:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:06:48,952 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 22:06:49,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:06:49,100 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 73 iterations. [2024-11-08 22:06:49,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 10:06:49 ImpRootNode [2024-11-08 22:06:49,277 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 22:06:49,278 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 22:06:49,278 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 22:06:49,278 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 22:06:49,279 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:05:36" (3/4) ... [2024-11-08 22:06:49,279 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 22:06:49,479 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2946b1c3-ffd5-48fa-92fd-824f6ba57610/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 22:06:49,479 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 22:06:49,480 INFO L158 Benchmark]: Toolchain (without parser) took 75332.43ms. Allocated memory was 161.5MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 132.6MB in the beginning and 768.1MB in the end (delta: -635.5MB). Peak memory consumption was 409.6MB. Max. memory is 16.1GB. [2024-11-08 22:06:49,480 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 161.5MB. Free memory is still 130.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:06:49,480 INFO L158 Benchmark]: CACSL2BoogieTranslator took 645.89ms. Allocated memory is still 161.5MB. Free memory was 132.6MB in the beginning and 102.6MB in the end (delta: 30.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-08 22:06:49,481 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.04ms. Allocated memory is still 161.5MB. Free memory was 102.6MB in the beginning and 96.9MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 22:06:49,481 INFO L158 Benchmark]: Boogie Preprocessor took 96.71ms. Allocated memory is still 161.5MB. Free memory was 96.9MB in the beginning and 92.1MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 22:06:49,481 INFO L158 Benchmark]: RCFGBuilder took 1716.85ms. Allocated memory is still 161.5MB. Free memory was 92.1MB in the beginning and 97.5MB in the end (delta: -5.4MB). Peak memory consumption was 64.1MB. Max. memory is 16.1GB. [2024-11-08 22:06:49,482 INFO L158 Benchmark]: CodeCheck took 72566.46ms. Allocated memory was 161.5MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 97.5MB in the beginning and 796.4MB in the end (delta: -698.9MB). Peak memory consumption was 345.5MB. Max. memory is 16.1GB. [2024-11-08 22:06:49,482 INFO L158 Benchmark]: Witness Printer took 201.49ms. Allocated memory is still 1.2GB. Free memory was 796.4MB in the beginning and 768.1MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-08 22:06:49,484 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: 72.4s, OverallIterations: 73, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 107501 SdHoareTripleChecker+Valid, 352.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 106504 mSDsluCounter, 17024 SdHoareTripleChecker+Invalid, 300.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14280 mSDsCounter, 31986 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 235340 IncrementalHoareTripleChecker+Invalid, 267326 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31986 mSolverCounterUnsat, 2744 mSDtfsCounter, 235340 mSolverCounterSat, 4.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67077 GetRequests, 64279 SyntacticMatches, 2294 SemanticMatches, 504 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204107 ImplicationChecksByTransitivity, 40.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.6s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 15.9s InterpolantComputationTime, 10145 NumberOfCodeBlocks, 10145 NumberOfCodeBlocksAsserted, 73 NumberOfCheckSat, 9838 ConstructedInterpolants, 0 QuantifiedInterpolants, 51277 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 72 InterpolantComputations, 50 PerfectInterpolantSequences, 5621/7419 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: 432]: 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=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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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 FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) 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=6, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) 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=6, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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] [L288] COND TRUE (((((((!(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)) [L289] a20 = 1 [L290] a8 = 13 [L291] a16 = 4 [L292] a7 = 0 [L293] a21 = 1 [L294] a17 = 0 [L295] return -1; VAL [\result=-1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [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=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L410] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L413] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L416] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L419] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L422] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L425] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L428] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L431] COND TRUE ((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L432] reach_error() VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37ms. Allocated memory is still 161.5MB. Free memory is still 130.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 645.89ms. Allocated memory is still 161.5MB. Free memory was 132.6MB in the beginning and 102.6MB in the end (delta: 30.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 100.04ms. Allocated memory is still 161.5MB. Free memory was 102.6MB in the beginning and 96.9MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.71ms. Allocated memory is still 161.5MB. Free memory was 96.9MB in the beginning and 92.1MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1716.85ms. Allocated memory is still 161.5MB. Free memory was 92.1MB in the beginning and 97.5MB in the end (delta: -5.4MB). Peak memory consumption was 64.1MB. Max. memory is 16.1GB. * CodeCheck took 72566.46ms. Allocated memory was 161.5MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 97.5MB in the beginning and 796.4MB in the end (delta: -698.9MB). Peak memory consumption was 345.5MB. Max. memory is 16.1GB. * Witness Printer took 201.49ms. Allocated memory is still 1.2GB. Free memory was 796.4MB in the beginning and 768.1MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-08 22:06:49,525 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2946b1c3-ffd5-48fa-92fd-824f6ba57610/bin/ukojak-verify-ImItNfHLgk/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