./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a888007-4096-49b4-9aad-d2243c09726b/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a888007-4096-49b4-9aad-d2243c09726b/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_0a888007-4096-49b4-9aad-d2243c09726b/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a888007-4096-49b4-9aad-d2243c09726b/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label50.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a888007-4096-49b4-9aad-d2243c09726b/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_0a888007-4096-49b4-9aad-d2243c09726b/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 7c8c0e9a48a9f16e1776fdefc0f855c8a0d9d5ce1c74cc0228b67d8d420034c4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 23:21:48,583 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:21:48,676 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a888007-4096-49b4-9aad-d2243c09726b/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-08 23:21:48,680 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:21:48,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 23:21:48,704 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:21:48,704 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:21:48,705 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 23:21:48,706 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:21:48,706 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:21:48,707 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:21:48,707 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:21:48,708 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:21:48,709 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:21:48,709 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:21:48,710 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:21:48,710 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:21:48,711 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:21:48,711 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:21:48,712 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:21:48,712 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:21:48,718 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:21:48,718 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:21:48,718 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 23:21:48,719 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 23:21:48,719 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 23:21:48,719 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:21:48,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:21:48,720 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:21:48,720 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:21:48,721 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:21:48,721 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 23:21:48,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:21:48,723 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_0a888007-4096-49b4-9aad-d2243c09726b/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_0a888007-4096-49b4-9aad-d2243c09726b/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 -> 7c8c0e9a48a9f16e1776fdefc0f855c8a0d9d5ce1c74cc0228b67d8d420034c4 [2024-11-08 23:21:49,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:21:49,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:21:49,065 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:21:49,067 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:21:49,067 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:21:49,069 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a888007-4096-49b4-9aad-d2243c09726b/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/eca-rers2012/Problem01_label50.c Unable to find full path for "g++" [2024-11-08 23:21:51,142 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:21:51,455 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:21:51,456 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a888007-4096-49b4-9aad-d2243c09726b/sv-benchmarks/c/eca-rers2012/Problem01_label50.c [2024-11-08 23:21:51,476 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a888007-4096-49b4-9aad-d2243c09726b/bin/ukojak-verify-ImItNfHLgk/data/1fbb6ff0f/e97d291037954035b6d32e57a2b1f059/FLAGb7f059121 [2024-11-08 23:21:51,711 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a888007-4096-49b4-9aad-d2243c09726b/bin/ukojak-verify-ImItNfHLgk/data/1fbb6ff0f/e97d291037954035b6d32e57a2b1f059 [2024-11-08 23:21:51,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:21:51,716 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:21:51,718 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:21:51,718 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:21:51,725 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:21:51,726 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:21:51" (1/1) ... [2024-11-08 23:21:51,728 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3632c1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:21:51, skipping insertion in model container [2024-11-08 23:21:51,729 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:21:51" (1/1) ... [2024-11-08 23:21:51,786 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:21:52,261 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_0a888007-4096-49b4-9aad-d2243c09726b/sv-benchmarks/c/eca-rers2012/Problem01_label50.c[15378,15391] [2024-11-08 23:21:52,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:21:52,359 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:21:52,479 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_0a888007-4096-49b4-9aad-d2243c09726b/sv-benchmarks/c/eca-rers2012/Problem01_label50.c[15378,15391] [2024-11-08 23:21:52,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:21:52,534 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:21:52,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:21:52 WrapperNode [2024-11-08 23:21:52,535 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:21:52,536 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:21:52,536 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:21:52,537 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:21:52,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:21:52" (1/1) ... [2024-11-08 23:21:52,575 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:21:52" (1/1) ... [2024-11-08 23:21:52,649 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-08 23:21:52,649 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:21:52,653 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:21:52,654 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:21:52,654 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:21:52,666 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:21:52" (1/1) ... [2024-11-08 23:21:52,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:21:52" (1/1) ... [2024-11-08 23:21:52,671 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:21:52" (1/1) ... [2024-11-08 23:21:52,671 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:21:52" (1/1) ... [2024-11-08 23:21:52,691 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:21:52" (1/1) ... [2024-11-08 23:21:52,698 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:21:52" (1/1) ... [2024-11-08 23:21:52,706 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:21:52" (1/1) ... [2024-11-08 23:21:52,710 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:21:52" (1/1) ... [2024-11-08 23:21:52,726 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:21:52,727 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:21:52,727 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:21:52,728 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:21:52,729 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:21:52" (1/1) ... [2024-11-08 23:21:52,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:21:52,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a888007-4096-49b4-9aad-d2243c09726b/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 23:21:52,794 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a888007-4096-49b4-9aad-d2243c09726b/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 23:21:52,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a888007-4096-49b4-9aad-d2243c09726b/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 23:21:52,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:21:52,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 23:21:52,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:21:52,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:21:52,962 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:21:52,966 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:21:54,467 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-08 23:21:54,467 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:21:54,800 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:21:54,800 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:21:54,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:21:54 BoogieIcfgContainer [2024-11-08 23:21:54,802 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:21:54,804 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 23:21:54,804 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 23:21:54,816 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 23:21:54,816 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:21:54" (1/1) ... [2024-11-08 23:21:54,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:21:54,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:21:54,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-08 23:21:54,897 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-08 23:21:54,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-08 23:21:54,901 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:21:54,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:21:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:21:55,663 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 23:21:56,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:21:56,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 145 states and 237 transitions. [2024-11-08 23:21:56,538 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 237 transitions. [2024-11-08 23:21:56,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-08 23:21:56,545 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:21:56,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:21:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:21:56,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:21:57,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:21:57,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 146 states and 238 transitions. [2024-11-08 23:21:57,230 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 238 transitions. [2024-11-08 23:21:57,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-08 23:21:57,232 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:21:57,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:21:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:21:57,379 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 23:21:57,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:21:57,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 151 states and 245 transitions. [2024-11-08 23:21:57,504 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 245 transitions. [2024-11-08 23:21:57,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-08 23:21:57,505 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:21:57,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:21:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:21:57,752 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 23:21:58,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:21:58,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 221 states and 317 transitions. [2024-11-08 23:21:58,625 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 317 transitions. [2024-11-08 23:21:58,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-08 23:21:58,626 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:21:58,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:21:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:21:58,907 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 23:21:59,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:21:59,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 233 states and 332 transitions. [2024-11-08 23:21:59,236 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 332 transitions. [2024-11-08 23:21:59,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-08 23:21:59,239 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:21:59,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:21:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:21:59,649 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:22:00,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:00,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 249 states and 353 transitions. [2024-11-08 23:22:00,439 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 353 transitions. [2024-11-08 23:22:00,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-08 23:22:00,444 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:00,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:00,649 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 23:22:01,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:01,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 262 states and 368 transitions. [2024-11-08 23:22:01,036 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 368 transitions. [2024-11-08 23:22:01,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-08 23:22:01,037 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:01,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:01,206 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:22:01,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:01,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 282 states and 394 transitions. [2024-11-08 23:22:01,989 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 394 transitions. [2024-11-08 23:22:01,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-08 23:22:01,990 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:01,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:02,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:02,208 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 23:22:02,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:02,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 290 states and 408 transitions. [2024-11-08 23:22:02,854 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 408 transitions. [2024-11-08 23:22:02,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-08 23:22:02,857 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:02,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:02,992 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:22:03,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:03,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 306 states and 427 transitions. [2024-11-08 23:22:03,492 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 427 transitions. [2024-11-08 23:22:03,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 23:22:03,494 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:03,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:03,665 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 23:22:04,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:04,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 319 states and 441 transitions. [2024-11-08 23:22:04,178 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 441 transitions. [2024-11-08 23:22:04,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 23:22:04,180 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:04,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:04,316 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 23:22:04,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:04,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 328 states and 451 transitions. [2024-11-08 23:22:04,540 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 451 transitions. [2024-11-08 23:22:04,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 23:22:04,542 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:04,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:04,677 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 23:22:04,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:04,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 334 states and 459 transitions. [2024-11-08 23:22:04,986 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 459 transitions. [2024-11-08 23:22:04,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 23:22:04,988 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:04,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:05,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:05,137 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 23:22:05,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:05,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 342 states and 468 transitions. [2024-11-08 23:22:05,392 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 468 transitions. [2024-11-08 23:22:05,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 23:22:05,395 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:05,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:05,668 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 23:22:05,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:05,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 344 states and 471 transitions. [2024-11-08 23:22:05,995 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 471 transitions. [2024-11-08 23:22:05,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 23:22:05,997 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:05,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:06,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:06,184 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:22:06,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:06,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 358 states and 487 transitions. [2024-11-08 23:22:06,611 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 487 transitions. [2024-11-08 23:22:06,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 23:22:06,613 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:06,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:06,935 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:22:07,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:07,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 365 states and 494 transitions. [2024-11-08 23:22:07,287 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 494 transitions. [2024-11-08 23:22:07,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 23:22:07,289 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:07,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:07,476 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:22:07,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:07,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 371 states and 500 transitions. [2024-11-08 23:22:07,567 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 500 transitions. [2024-11-08 23:22:07,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 23:22:07,569 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:07,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:07,694 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 23:22:07,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:07,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 375 states and 504 transitions. [2024-11-08 23:22:07,832 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 504 transitions. [2024-11-08 23:22:07,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 23:22:07,834 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:07,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:08,116 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:22:08,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:08,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 381 states and 511 transitions. [2024-11-08 23:22:08,387 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 511 transitions. [2024-11-08 23:22:08,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 23:22:08,389 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:08,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:08,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:08,493 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:22:08,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:08,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 395 states and 527 transitions. [2024-11-08 23:22:08,613 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 527 transitions. [2024-11-08 23:22:08,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 23:22:08,614 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:08,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:08,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:08,741 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:22:09,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:09,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 431 states and 571 transitions. [2024-11-08 23:22:09,661 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 571 transitions. [2024-11-08 23:22:09,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 23:22:09,664 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:09,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:09,776 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:22:10,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:10,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 459 states and 603 transitions. [2024-11-08 23:22:10,679 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 603 transitions. [2024-11-08 23:22:10,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-08 23:22:10,681 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:10,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:10,844 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 42 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:22:11,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:11,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 463 states and 609 transitions. [2024-11-08 23:22:11,117 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 609 transitions. [2024-11-08 23:22:11,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 23:22:11,119 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:11,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:11,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:11,278 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:22:13,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:13,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 503 states and 660 transitions. [2024-11-08 23:22:13,059 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 660 transitions. [2024-11-08 23:22:13,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 23:22:13,061 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:13,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:13,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:13,167 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:22:13,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:13,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 514 states and 672 transitions. [2024-11-08 23:22:13,940 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 672 transitions. [2024-11-08 23:22:13,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 23:22:13,941 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:13,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:14,033 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 23:22:14,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:14,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 542 states and 704 transitions. [2024-11-08 23:22:14,892 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 704 transitions. [2024-11-08 23:22:14,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 23:22:14,894 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:14,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:15,019 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 23:22:15,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:15,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 547 states and 710 transitions. [2024-11-08 23:22:15,562 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 710 transitions. [2024-11-08 23:22:15,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 23:22:15,564 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:15,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:15,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:15,680 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 23:22:15,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:15,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 551 states and 715 transitions. [2024-11-08 23:22:15,956 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 715 transitions. [2024-11-08 23:22:15,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 23:22:15,958 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:15,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:15,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:16,124 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 23:22:16,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:16,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 552 states and 716 transitions. [2024-11-08 23:22:16,399 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 716 transitions. [2024-11-08 23:22:16,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 23:22:16,402 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:16,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:16,580 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 23:22:16,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:16,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 558 states and 722 transitions. [2024-11-08 23:22:16,674 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 722 transitions. [2024-11-08 23:22:16,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 23:22:16,676 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:16,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:16,782 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 23:22:16,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:16,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 571 states and 735 transitions. [2024-11-08 23:22:16,908 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 735 transitions. [2024-11-08 23:22:16,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 23:22:16,910 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:16,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:17,014 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 23:22:17,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:17,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 572 states and 736 transitions. [2024-11-08 23:22:17,057 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 736 transitions. [2024-11-08 23:22:17,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 23:22:17,060 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:17,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:17,505 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 49 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:22:18,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:18,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 582 states and 748 transitions. [2024-11-08 23:22:18,560 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 748 transitions. [2024-11-08 23:22:18,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 23:22:18,564 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:18,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:18,789 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 49 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:22:19,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:19,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 587 states and 754 transitions. [2024-11-08 23:22:19,163 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 754 transitions. [2024-11-08 23:22:19,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-08 23:22:19,164 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:19,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:19,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:19,255 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-08 23:22:19,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:19,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 592 states and 761 transitions. [2024-11-08 23:22:19,515 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 761 transitions. [2024-11-08 23:22:19,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 23:22:19,517 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:19,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:19,647 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-08 23:22:20,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:20,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 605 states and 776 transitions. [2024-11-08 23:22:20,175 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 776 transitions. [2024-11-08 23:22:20,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 23:22:20,176 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:20,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:20,328 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 23:22:20,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:20,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 611 states and 785 transitions. [2024-11-08 23:22:20,721 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 785 transitions. [2024-11-08 23:22:20,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 23:22:20,722 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:20,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:20,813 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 23:22:21,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:21,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 620 states and 798 transitions. [2024-11-08 23:22:21,160 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 798 transitions. [2024-11-08 23:22:21,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 23:22:21,162 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:21,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:21,323 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-08 23:22:22,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:22,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 704 states and 885 transitions. [2024-11-08 23:22:22,147 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 885 transitions. [2024-11-08 23:22:22,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 23:22:22,151 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:22,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:22,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:22,327 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 23:22:22,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:22,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 719 states and 899 transitions. [2024-11-08 23:22:22,919 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 899 transitions. [2024-11-08 23:22:22,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 23:22:22,921 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:22,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:23,102 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 23:22:23,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:23,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 733 states and 916 transitions. [2024-11-08 23:22:23,665 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 916 transitions. [2024-11-08 23:22:23,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 23:22:23,666 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:23,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:24,023 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 23:22:26,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:26,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 783 states and 977 transitions. [2024-11-08 23:22:26,736 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 977 transitions. [2024-11-08 23:22:26,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-08 23:22:26,743 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:26,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:27,412 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 67 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 23:22:29,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:29,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 834 states and 1046 transitions. [2024-11-08 23:22:29,953 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1046 transitions. [2024-11-08 23:22:29,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-08 23:22:29,955 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:29,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:30,278 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 67 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 23:22:30,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:30,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 839 states and 1050 transitions. [2024-11-08 23:22:30,787 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1050 transitions. [2024-11-08 23:22:30,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 23:22:30,790 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:30,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:30,944 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 23:22:31,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:31,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 847 states and 1059 transitions. [2024-11-08 23:22:31,070 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1059 transitions. [2024-11-08 23:22:31,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 23:22:31,073 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:31,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:31,268 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 23:22:32,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:32,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 895 states and 1110 transitions. [2024-11-08 23:22:32,103 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1110 transitions. [2024-11-08 23:22:32,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 23:22:32,105 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:32,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:32,257 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 23:22:32,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:32,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 903 states and 1119 transitions. [2024-11-08 23:22:32,500 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1119 transitions. [2024-11-08 23:22:32,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 23:22:32,502 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:32,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:32,600 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 23:22:32,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:32,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 908 states and 1125 transitions. [2024-11-08 23:22:32,681 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1125 transitions. [2024-11-08 23:22:32,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 23:22:32,683 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:32,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:33,290 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 23:22:35,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:35,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1045 states and 1270 transitions. [2024-11-08 23:22:35,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1270 transitions. [2024-11-08 23:22:35,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 23:22:35,873 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:35,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:36,008 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-08 23:22:36,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:36,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1046 states and 1270 transitions. [2024-11-08 23:22:36,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1270 transitions. [2024-11-08 23:22:36,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 23:22:36,181 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:36,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:36,374 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 75 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:22:36,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:36,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1050 states and 1278 transitions. [2024-11-08 23:22:36,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1278 transitions. [2024-11-08 23:22:36,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 23:22:36,460 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:36,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:36,564 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-08 23:22:37,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:37,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1064 states and 1297 transitions. [2024-11-08 23:22:37,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1297 transitions. [2024-11-08 23:22:37,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 23:22:37,045 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:37,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:37,123 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-08 23:22:37,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:37,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1086 states and 1321 transitions. [2024-11-08 23:22:37,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1321 transitions. [2024-11-08 23:22:37,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 23:22:37,641 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:37,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:37,747 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:22:39,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:39,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1121 states and 1361 transitions. [2024-11-08 23:22:39,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1361 transitions. [2024-11-08 23:22:39,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 23:22:39,373 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:39,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:39,481 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:22:39,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:39,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1125 states and 1364 transitions. [2024-11-08 23:22:39,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1364 transitions. [2024-11-08 23:22:39,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-08 23:22:39,765 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:39,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:39,913 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 80 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 23:22:40,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:40,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1132 states and 1372 transitions. [2024-11-08 23:22:40,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1372 transitions. [2024-11-08 23:22:40,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-08 23:22:40,342 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:40,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:40,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:40,829 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 23:22:42,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:42,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1203 states and 1443 transitions. [2024-11-08 23:22:42,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1443 transitions. [2024-11-08 23:22:42,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-08 23:22:42,066 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:42,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:42,157 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-08 23:22:42,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:42,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1215 states and 1454 transitions. [2024-11-08 23:22:42,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1454 transitions. [2024-11-08 23:22:42,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 23:22:42,880 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:42,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:43,343 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 82 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:22:44,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:44,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1223 states and 1466 transitions. [2024-11-08 23:22:44,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1466 transitions. [2024-11-08 23:22:44,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 23:22:44,371 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:44,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:44,657 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 82 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:22:44,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:44,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1228 states and 1471 transitions. [2024-11-08 23:22:44,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1471 transitions. [2024-11-08 23:22:44,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 23:22:44,958 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:44,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:45,029 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-08 23:22:45,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:45,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1247 states and 1497 transitions. [2024-11-08 23:22:45,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1497 transitions. [2024-11-08 23:22:45,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 23:22:45,994 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:45,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:46,096 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-08 23:22:46,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:46,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1260 states and 1511 transitions. [2024-11-08 23:22:46,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1511 transitions. [2024-11-08 23:22:46,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 23:22:46,560 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:46,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:46,889 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 23:22:47,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:47,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1277 states and 1528 transitions. [2024-11-08 23:22:47,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 1528 transitions. [2024-11-08 23:22:47,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-08 23:22:47,690 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:47,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:47,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:47,804 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 23:22:48,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:48,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1286 states and 1538 transitions. [2024-11-08 23:22:48,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1538 transitions. [2024-11-08 23:22:48,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-08 23:22:48,470 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:48,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:48,573 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-08 23:22:49,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:49,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1295 states and 1548 transitions. [2024-11-08 23:22:49,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1548 transitions. [2024-11-08 23:22:49,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-08 23:22:49,111 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:49,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:49,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:49,210 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 23:22:49,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:49,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1299 states and 1558 transitions. [2024-11-08 23:22:49,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1558 transitions. [2024-11-08 23:22:49,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 23:22:49,873 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:49,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:50,126 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 118 proven. 29 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-08 23:22:50,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:50,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1306 states and 1564 transitions. [2024-11-08 23:22:50,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1564 transitions. [2024-11-08 23:22:50,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-08 23:22:50,441 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:50,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:50,532 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-08 23:22:50,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:50,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1320 states and 1577 transitions. [2024-11-08 23:22:50,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1577 transitions. [2024-11-08 23:22:50,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 23:22:50,701 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:50,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:50,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:50,827 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-08 23:22:51,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:51,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1345 states and 1604 transitions. [2024-11-08 23:22:51,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1604 transitions. [2024-11-08 23:22:51,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-08 23:22:51,624 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:51,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:52,260 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 109 proven. 36 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 23:22:54,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:54,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1391 states and 1672 transitions. [2024-11-08 23:22:54,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 1672 transitions. [2024-11-08 23:22:54,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-08 23:22:54,677 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:54,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:54,816 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-08 23:22:55,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:55,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1392 states and 1673 transitions. [2024-11-08 23:22:55,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1673 transitions. [2024-11-08 23:22:55,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 23:22:55,207 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:55,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:55,502 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-08 23:22:56,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:56,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1400 states and 1681 transitions. [2024-11-08 23:22:56,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1681 transitions. [2024-11-08 23:22:56,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 23:22:56,285 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:56,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:56,421 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-08 23:22:57,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:57,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1405 states and 1685 transitions. [2024-11-08 23:22:57,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 1685 transitions. [2024-11-08 23:22:57,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-08 23:22:57,008 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:57,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:57,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:57,179 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-08 23:22:58,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:58,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1433 states and 1716 transitions. [2024-11-08 23:22:58,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 1716 transitions. [2024-11-08 23:22:58,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-08 23:22:58,064 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:58,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:58,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:58,207 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-08 23:22:58,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:58,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1441 states and 1723 transitions. [2024-11-08 23:22:58,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 1723 transitions. [2024-11-08 23:22:58,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 23:22:58,440 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:58,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:58,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:58,564 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 23:22:58,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:58,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1450 states and 1731 transitions. [2024-11-08 23:22:58,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 1731 transitions. [2024-11-08 23:22:58,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 23:22:58,885 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:58,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:58,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:59,080 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 122 proven. 18 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-08 23:22:59,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:59,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1459 states and 1742 transitions. [2024-11-08 23:22:59,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 1742 transitions. [2024-11-08 23:22:59,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 23:22:59,813 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:59,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:00,040 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 122 proven. 18 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-08 23:23:00,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:23:00,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1746 states to 1462 states and 1746 transitions. [2024-11-08 23:23:00,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 1746 transitions. [2024-11-08 23:23:00,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-08 23:23:00,433 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:23:00,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:23:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:00,528 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-08 23:23:00,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:23:00,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1463 states and 1748 transitions. [2024-11-08 23:23:00,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 1748 transitions. [2024-11-08 23:23:00,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-08 23:23:00,921 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:23:00,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:23:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:01,046 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-08 23:23:01,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:23:01,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1466 states and 1751 transitions. [2024-11-08 23:23:01,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 1751 transitions. [2024-11-08 23:23:01,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-08 23:23:01,496 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:23:01,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:23:01,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:01,891 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 172 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 23:23:04,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:23:04,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1484 states and 1781 transitions. [2024-11-08 23:23:04,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1781 transitions. [2024-11-08 23:23:04,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-08 23:23:04,372 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:23:04,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:23:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:04,628 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 172 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 23:23:05,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:23:05,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1790 states to 1494 states and 1790 transitions. [2024-11-08 23:23:05,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1790 transitions. [2024-11-08 23:23:05,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-08 23:23:05,628 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:23:05,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:23:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:05,824 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 172 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 23:23:07,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:23:07,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1505 states and 1804 transitions. [2024-11-08 23:23:07,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1804 transitions. [2024-11-08 23:23:07,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-08 23:23:07,560 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:23:07,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:23:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:08,154 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 122 proven. 36 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 23:23:11,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:23:11,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1534 states and 1840 transitions. [2024-11-08 23:23:11,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1534 states and 1840 transitions. [2024-11-08 23:23:11,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-08 23:23:11,132 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:23:11,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:23:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:11,463 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 122 proven. 36 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 23:23:11,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:23:11,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1539 states and 1847 transitions. [2024-11-08 23:23:11,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 1847 transitions. [2024-11-08 23:23:11,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-08 23:23:11,981 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:23:11,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:23:12,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:12,297 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 122 proven. 36 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 23:23:12,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:23:12,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1548 states and 1857 transitions. [2024-11-08 23:23:12,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 1857 transitions. [2024-11-08 23:23:12,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-08 23:23:12,991 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:23:12,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:23:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:13,216 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 109 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:23:14,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:23:14,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1579 states and 1888 transitions. [2024-11-08 23:23:14,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 1888 transitions. [2024-11-08 23:23:14,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-08 23:23:14,356 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:23:14,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:23:14,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:15,251 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 130 proven. 49 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 23:23:21,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:23:21,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 1669 states and 2014 transitions. [2024-11-08 23:23:21,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2014 transitions. [2024-11-08 23:23:21,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-08 23:23:21,762 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:23:21,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:23:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:22,160 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 130 proven. 49 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 23:23:24,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:23:24,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2028 states to 1680 states and 2028 transitions. [2024-11-08 23:23:24,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2028 transitions. [2024-11-08 23:23:24,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-08 23:23:24,146 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:23:24,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:23:24,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:24,254 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-08 23:23:25,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:23:25,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 1711 states and 2062 transitions. [2024-11-08 23:23:25,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2062 transitions. [2024-11-08 23:23:25,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-08 23:23:25,052 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:23:25,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:23:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:25,132 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-08 23:23:25,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:23:25,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 1733 states and 2083 transitions. [2024-11-08 23:23:25,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2083 transitions. [2024-11-08 23:23:25,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-08 23:23:25,494 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:23:25,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:23:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:26,385 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 127 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 23:23:30,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:23:30,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 1783 states and 2155 transitions. [2024-11-08 23:23:30,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2155 transitions. [2024-11-08 23:23:30,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-08 23:23:30,501 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:23:30,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:23:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:30,876 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 137 proven. 51 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-08 23:23:31,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:23:31,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 1798 states and 2174 transitions. [2024-11-08 23:23:31,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 2174 transitions. [2024-11-08 23:23:31,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-08 23:23:31,612 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:23:31,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:23:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:31,859 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 112 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-08 23:23:33,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:23:33,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2190 states to 1813 states and 2190 transitions. [2024-11-08 23:23:33,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 2190 transitions. [2024-11-08 23:23:33,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-08 23:23:33,549 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:23:33,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:23:33,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:33,666 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-08 23:23:34,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:23:34,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 1815 states and 2192 transitions. [2024-11-08 23:23:34,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2192 transitions. [2024-11-08 23:23:34,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-08 23:23:34,053 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:23:34,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:23:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:34,174 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 23:23:34,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:23:34,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2198 states to 1822 states and 2198 transitions. [2024-11-08 23:23:34,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 2198 transitions. [2024-11-08 23:23:34,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-08 23:23:34,560 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:23:34,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:23:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:34,886 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 142 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 23:23:36,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:23:36,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 1838 states and 2216 transitions. [2024-11-08 23:23:36,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2216 transitions. [2024-11-08 23:23:36,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 23:23:36,072 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:23:36,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:23:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:36,238 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-08 23:23:37,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:23:37,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 1849 states and 2228 transitions. [2024-11-08 23:23:37,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2228 transitions. [2024-11-08 23:23:37,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-08 23:23:37,335 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:23:37,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:23:37,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:38,243 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 119 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:23:44,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:23:44,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 1892 states and 2284 transitions. [2024-11-08 23:23:44,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2284 transitions. [2024-11-08 23:23:44,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-08 23:23:44,100 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:23:44,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:23:44,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:44,379 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 119 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:23:45,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:23:45,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 1906 states and 2299 transitions. [2024-11-08 23:23:45,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 2299 transitions. [2024-11-08 23:23:45,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-08 23:23:45,940 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:23:45,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:23:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:46,497 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 142 proven. 49 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 23:23:51,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:23:51,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2340 states to 1932 states and 2340 transitions. [2024-11-08 23:23:51,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1932 states and 2340 transitions. [2024-11-08 23:23:51,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-08 23:23:51,211 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:23:51,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:23:51,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:51,501 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 142 proven. 49 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 23:23:53,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:23:53,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2358 states to 1943 states and 2358 transitions. [2024-11-08 23:23:53,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1943 states and 2358 transitions. [2024-11-08 23:23:53,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-08 23:23:53,724 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:23:53,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:23:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:23:53,763 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:23:53,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:23:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:23:54,205 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:23:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:23:54,361 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 104 iterations. [2024-11-08 23:23:54,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 11:23:54 ImpRootNode [2024-11-08 23:23:54,524 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 23:23:54,525 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:23:54,526 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:23:54,526 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:23:54,527 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:21:54" (3/4) ... [2024-11-08 23:23:54,528 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 23:23:54,703 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a888007-4096-49b4-9aad-d2243c09726b/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 23:23:54,704 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:23:54,704 INFO L158 Benchmark]: Toolchain (without parser) took 122988.60ms. Allocated memory was 159.4MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 119.1MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 199.9MB. Max. memory is 16.1GB. [2024-11-08 23:23:54,705 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 125.8MB. Free memory is still 71.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:23:54,705 INFO L158 Benchmark]: CACSL2BoogieTranslator took 817.70ms. Allocated memory is still 159.4MB. Free memory was 119.1MB in the beginning and 89.1MB in the end (delta: 30.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-08 23:23:54,705 INFO L158 Benchmark]: Boogie Procedure Inliner took 113.20ms. Allocated memory is still 159.4MB. Free memory was 89.1MB in the beginning and 83.4MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 23:23:54,706 INFO L158 Benchmark]: Boogie Preprocessor took 72.53ms. Allocated memory is still 159.4MB. Free memory was 83.4MB in the beginning and 79.0MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:23:54,706 INFO L158 Benchmark]: RCFGBuilder took 2075.77ms. Allocated memory is still 159.4MB. Free memory was 78.4MB in the beginning and 64.0MB in the end (delta: 14.4MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2024-11-08 23:23:54,707 INFO L158 Benchmark]: CodeCheck took 119720.28ms. Allocated memory was 159.4MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 64.0MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 118.4MB. Max. memory is 16.1GB. [2024-11-08 23:23:54,707 INFO L158 Benchmark]: Witness Printer took 178.99ms. Allocated memory is still 2.0GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-08 23:23:54,709 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: 119.5s, OverallIterations: 104, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 207011 SdHoareTripleChecker+Valid, 690.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 203744 mSDsluCounter, 32721 SdHoareTripleChecker+Invalid, 585.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27646 mSDsCounter, 59891 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 454443 IncrementalHoareTripleChecker+Invalid, 514334 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59891 mSolverCounterUnsat, 5075 mSDtfsCounter, 454443 mSolverCounterSat, 7.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 99066 GetRequests, 94698 SyntacticMatches, 3498 SemanticMatches, 870 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490645 ImplicationChecksByTransitivity, 78.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.8s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 20.6s InterpolantComputationTime, 14927 NumberOfCodeBlocks, 14927 NumberOfCodeBlocksAsserted, 104 NumberOfCheckSat, 14625 ConstructedInterpolants, 0 QuantifiedInterpolants, 59955 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 103 InterpolantComputations, 68 PerfectInterpolantSequences, 9789/10653 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: 423]: 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=2, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND TRUE ((((((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)) [L95] a7 = 0 [L96] a20 = 1 [L97] a8 = 14 [L98] a16 = 4 [L99] a21 = 1 [L100] a17 = 0 [L101] return -1; VAL [\result=-1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L410] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L413] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L416] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L419] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L422] COND TRUE ((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L423] reach_error() VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39ms. Allocated memory is still 125.8MB. Free memory is still 71.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 817.70ms. Allocated memory is still 159.4MB. Free memory was 119.1MB in the beginning and 89.1MB in the end (delta: 30.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 113.20ms. Allocated memory is still 159.4MB. Free memory was 89.1MB in the beginning and 83.4MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.53ms. Allocated memory is still 159.4MB. Free memory was 83.4MB in the beginning and 79.0MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2075.77ms. Allocated memory is still 159.4MB. Free memory was 78.4MB in the beginning and 64.0MB in the end (delta: 14.4MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. * CodeCheck took 119720.28ms. Allocated memory was 159.4MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 64.0MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 118.4MB. Max. memory is 16.1GB. * Witness Printer took 178.99ms. Allocated memory is still 2.0GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-08 23:23:54,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a888007-4096-49b4-9aad-d2243c09726b/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