./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label33.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f93e2ff9-d4fe-4e69-adbe-7ac497eb4536/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f93e2ff9-d4fe-4e69-adbe-7ac497eb4536/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_f93e2ff9-d4fe-4e69-adbe-7ac497eb4536/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f93e2ff9-d4fe-4e69-adbe-7ac497eb4536/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label33.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f93e2ff9-d4fe-4e69-adbe-7ac497eb4536/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_f93e2ff9-d4fe-4e69-adbe-7ac497eb4536/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 a90366a5085659577cb1c98c7b11041979a96aff31e8f044fed2c2fa31b4a389 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 22:34:30,661 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:34:30,788 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f93e2ff9-d4fe-4e69-adbe-7ac497eb4536/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-08 22:34:30,795 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:34:30,799 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 22:34:30,840 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:34:30,843 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:34:30,844 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 22:34:30,845 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:34:30,847 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:34:30,848 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:34:30,849 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:34:30,849 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:34:30,850 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:34:30,850 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:34:30,850 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:34:30,851 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:34:30,851 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:34:30,852 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:34:30,852 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:34:30,852 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:34:30,857 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:34:30,858 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:34:30,858 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 22:34:30,858 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 22:34:30,859 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 22:34:30,859 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:34:30,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 22:34:30,860 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:34:30,860 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:34:30,860 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:34:30,865 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 22:34:30,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:34:30,866 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_f93e2ff9-d4fe-4e69-adbe-7ac497eb4536/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_f93e2ff9-d4fe-4e69-adbe-7ac497eb4536/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 -> a90366a5085659577cb1c98c7b11041979a96aff31e8f044fed2c2fa31b4a389 [2024-11-08 22:34:31,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:34:31,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:34:31,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:34:31,205 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:34:31,205 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:34:31,206 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f93e2ff9-d4fe-4e69-adbe-7ac497eb4536/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/eca-rers2012/Problem01_label33.c Unable to find full path for "g++" [2024-11-08 22:34:33,473 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:34:33,855 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:34:33,856 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f93e2ff9-d4fe-4e69-adbe-7ac497eb4536/sv-benchmarks/c/eca-rers2012/Problem01_label33.c [2024-11-08 22:34:33,880 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f93e2ff9-d4fe-4e69-adbe-7ac497eb4536/bin/ukojak-verify-ImItNfHLgk/data/a34776bf7/a9353b6a161646d781d805ba8130ef22/FLAG9a0b62c3b [2024-11-08 22:34:33,908 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f93e2ff9-d4fe-4e69-adbe-7ac497eb4536/bin/ukojak-verify-ImItNfHLgk/data/a34776bf7/a9353b6a161646d781d805ba8130ef22 [2024-11-08 22:34:33,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:34:33,915 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:34:33,921 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:34:33,921 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:34:33,927 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:34:33,929 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:34:33" (1/1) ... [2024-11-08 22:34:33,932 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f9970b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:34:33, skipping insertion in model container [2024-11-08 22:34:33,932 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:34:33" (1/1) ... [2024-11-08 22:34:34,005 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:34:34,410 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_f93e2ff9-d4fe-4e69-adbe-7ac497eb4536/sv-benchmarks/c/eca-rers2012/Problem01_label33.c[15127,15140] [2024-11-08 22:34:34,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:34:34,554 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:34:34,674 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_f93e2ff9-d4fe-4e69-adbe-7ac497eb4536/sv-benchmarks/c/eca-rers2012/Problem01_label33.c[15127,15140] [2024-11-08 22:34:34,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:34:34,751 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:34:34,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:34:34 WrapperNode [2024-11-08 22:34:34,752 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:34:34,753 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:34:34,754 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:34:34,754 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:34:34,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:34:34" (1/1) ... [2024-11-08 22:34:34,785 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:34:34" (1/1) ... [2024-11-08 22:34:34,863 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-08 22:34:34,863 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:34:34,864 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:34:34,865 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:34:34,865 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:34:34,878 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:34:34" (1/1) ... [2024-11-08 22:34:34,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:34:34" (1/1) ... [2024-11-08 22:34:34,884 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:34:34" (1/1) ... [2024-11-08 22:34:34,884 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:34:34" (1/1) ... [2024-11-08 22:34:34,908 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:34:34" (1/1) ... [2024-11-08 22:34:34,917 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:34:34" (1/1) ... [2024-11-08 22:34:34,924 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:34:34" (1/1) ... [2024-11-08 22:34:34,929 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:34:34" (1/1) ... [2024-11-08 22:34:34,938 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:34:34,939 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:34:34,939 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:34:34,939 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:34:34,940 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:34:34" (1/1) ... [2024-11-08 22:34:34,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 22:34:34,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f93e2ff9-d4fe-4e69-adbe-7ac497eb4536/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 22:34:35,000 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f93e2ff9-d4fe-4e69-adbe-7ac497eb4536/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 22:34:35,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f93e2ff9-d4fe-4e69-adbe-7ac497eb4536/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 22:34:35,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:34:35,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 22:34:35,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:34:35,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:34:35,163 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:34:35,167 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:34:36,594 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-08 22:34:36,594 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:34:36,938 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:34:36,938 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:34:36,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:34:36 BoogieIcfgContainer [2024-11-08 22:34:36,939 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:34:36,940 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 22:34:36,940 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 22:34:36,953 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 22:34:36,954 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:34:36" (1/1) ... [2024-11-08 22:34:36,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:34:37,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:34:37,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-08 22:34:37,049 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-08 22:34:37,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-08 22:34:37,054 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:34:37,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:34:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:34:37,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:34:38,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:34:38,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 145 states and 237 transitions. [2024-11-08 22:34:38,370 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 237 transitions. [2024-11-08 22:34:38,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-08 22:34:38,373 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:34:38,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:34:38,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:34:38,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 22:34:38,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:34:38,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 146 states and 238 transitions. [2024-11-08 22:34:38,878 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 238 transitions. [2024-11-08 22:34:38,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-08 22:34:38,884 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:34:38,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:34:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:34:39,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:34:39,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:34:39,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 150 states and 244 transitions. [2024-11-08 22:34:39,233 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 244 transitions. [2024-11-08 22:34:39,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-08 22:34:39,239 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:34:39,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:34:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:34:39,415 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 22:34:39,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:34:39,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 151 states and 245 transitions. [2024-11-08 22:34:39,624 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 245 transitions. [2024-11-08 22:34:39,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-08 22:34:39,626 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:34:39,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:34:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:34:39,882 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:34:40,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:34:40,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 159 states and 258 transitions. [2024-11-08 22:34:40,134 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 258 transitions. [2024-11-08 22:34:40,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-08 22:34:40,135 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:34:40,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:34:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:34:40,340 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:34:40,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:34:40,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 160 states and 259 transitions. [2024-11-08 22:34:40,532 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 259 transitions. [2024-11-08 22:34:40,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-08 22:34:40,537 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:34:40,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:34:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:34:40,818 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:34:40,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:34:40,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 168 states and 268 transitions. [2024-11-08 22:34:40,996 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 268 transitions. [2024-11-08 22:34:40,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-08 22:34:40,998 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:34:40,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:34:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:34:41,261 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:34:41,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:34:41,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 182 states and 286 transitions. [2024-11-08 22:34:41,695 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 286 transitions. [2024-11-08 22:34:41,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-08 22:34:41,697 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:34:41,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:34:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:34:41,889 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:34:42,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:34:42,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 197 states and 306 transitions. [2024-11-08 22:34:42,547 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 306 transitions. [2024-11-08 22:34:42,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 22:34:42,550 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:34:42,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:34:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:34:42,832 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 22:34:43,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:34:43,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 212 states and 327 transitions. [2024-11-08 22:34:43,720 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 327 transitions. [2024-11-08 22:34:43,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 22:34:43,723 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:34:43,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:34:43,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:34:43,961 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:34:44,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:34:44,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 230 states and 356 transitions. [2024-11-08 22:34:44,985 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2024-11-08 22:34:44,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-08 22:34:44,987 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:34:44,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:34:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:34:45,177 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:34:45,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:34:45,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 232 states and 359 transitions. [2024-11-08 22:34:45,459 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 359 transitions. [2024-11-08 22:34:45,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-08 22:34:45,460 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:34:45,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:34:45,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:34:45,568 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 22:34:45,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:34:45,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 237 states and 365 transitions. [2024-11-08 22:34:45,730 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 365 transitions. [2024-11-08 22:34:45,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-08 22:34:45,731 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:34:45,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:34:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:34:45,938 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 22:34:46,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:34:46,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 238 states and 366 transitions. [2024-11-08 22:34:46,164 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 366 transitions. [2024-11-08 22:34:46,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 22:34:46,165 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:34:46,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:34:46,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:34:46,291 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:34:47,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:34:47,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 257 states and 395 transitions. [2024-11-08 22:34:47,416 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 395 transitions. [2024-11-08 22:34:47,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 22:34:47,418 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:34:47,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:34:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:34:47,538 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:34:47,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:34:47,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 258 states and 396 transitions. [2024-11-08 22:34:47,761 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 396 transitions. [2024-11-08 22:34:47,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 22:34:47,762 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:34:47,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:34:47,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:34:47,936 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 22:34:48,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:34:48,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 273 states and 415 transitions. [2024-11-08 22:34:48,601 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 415 transitions. [2024-11-08 22:34:48,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 22:34:48,604 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:34:48,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:34:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:34:48,742 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 22:34:49,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:34:49,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 291 states and 435 transitions. [2024-11-08 22:34:49,743 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 435 transitions. [2024-11-08 22:34:49,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 22:34:49,747 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:34:49,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:34:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:34:49,849 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:34:49,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:34:49,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 295 states and 439 transitions. [2024-11-08 22:34:49,913 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 439 transitions. [2024-11-08 22:34:49,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 22:34:49,914 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:34:49,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:34:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:34:50,081 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 22:34:50,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:34:50,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 299 states and 444 transitions. [2024-11-08 22:34:50,539 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 444 transitions. [2024-11-08 22:34:50,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 22:34:50,540 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:34:50,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:34:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:34:50,623 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 22:34:51,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:34:51,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 307 states and 459 transitions. [2024-11-08 22:34:51,227 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 459 transitions. [2024-11-08 22:34:51,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 22:34:51,230 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:34:51,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:34:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:34:51,307 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 22:34:51,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:34:51,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 313 states and 467 transitions. [2024-11-08 22:34:51,879 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 467 transitions. [2024-11-08 22:34:51,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 22:34:51,881 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:34:51,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:34:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:34:51,956 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 22:34:52,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:34:52,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 316 states and 471 transitions. [2024-11-08 22:34:52,227 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 471 transitions. [2024-11-08 22:34:52,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 22:34:52,228 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:34:52,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:34:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:34:52,303 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:34:52,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:34:52,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 331 states and 491 transitions. [2024-11-08 22:34:52,920 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 491 transitions. [2024-11-08 22:34:52,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 22:34:52,922 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:34:52,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:34:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:34:53,098 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 22:34:53,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:34:53,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 345 states and 508 transitions. [2024-11-08 22:34:53,471 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 508 transitions. [2024-11-08 22:34:53,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-08 22:34:53,472 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:34:53,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:34:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:34:53,666 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:34:54,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:34:54,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 347 states and 510 transitions. [2024-11-08 22:34:54,061 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 510 transitions. [2024-11-08 22:34:54,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 22:34:54,063 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:34:54,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:34:54,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:34:54,192 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 22:34:54,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:34:54,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 353 states and 516 transitions. [2024-11-08 22:34:54,645 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 516 transitions. [2024-11-08 22:34:54,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 22:34:54,647 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:34:54,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:34:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:34:54,736 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 22:34:54,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:34:54,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 357 states and 519 transitions. [2024-11-08 22:34:54,798 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 519 transitions. [2024-11-08 22:34:54,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 22:34:54,803 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:34:54,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:34:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:34:54,978 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:34:55,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:34:55,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 359 states and 522 transitions. [2024-11-08 22:34:55,083 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 522 transitions. [2024-11-08 22:34:55,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 22:34:55,084 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:34:55,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:34:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:34:55,288 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 22:34:55,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:34:55,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 373 states and 540 transitions. [2024-11-08 22:34:55,925 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 540 transitions. [2024-11-08 22:34:55,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 22:34:55,926 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:34:55,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:34:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:34:56,148 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 22:34:56,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:34:56,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 377 states and 545 transitions. [2024-11-08 22:34:56,439 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 545 transitions. [2024-11-08 22:34:56,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-08 22:34:56,440 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:34:56,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:34:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:34:56,580 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 22:34:56,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:34:56,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 379 states and 548 transitions. [2024-11-08 22:34:56,774 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 548 transitions. [2024-11-08 22:34:56,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 22:34:56,775 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:34:56,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:34:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:34:57,118 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 35 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:34:57,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:34:57,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 386 states and 555 transitions. [2024-11-08 22:34:57,590 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 555 transitions. [2024-11-08 22:34:57,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 22:34:57,592 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:34:57,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:34:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:34:57,780 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 22:34:58,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:34:58,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 395 states and 564 transitions. [2024-11-08 22:34:58,280 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 564 transitions. [2024-11-08 22:34:58,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 22:34:58,285 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:34:58,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:34:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:34:58,532 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 22:34:58,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:34:58,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 399 states and 567 transitions. [2024-11-08 22:34:58,902 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 567 transitions. [2024-11-08 22:34:58,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 22:34:58,904 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:34:58,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:34:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:34:59,074 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 22:34:59,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:34:59,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 402 states and 569 transitions. [2024-11-08 22:34:59,430 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 569 transitions. [2024-11-08 22:34:59,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 22:34:59,431 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:34:59,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:34:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:34:59,587 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:35:00,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:00,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 472 states and 647 transitions. [2024-11-08 22:35:00,336 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 647 transitions. [2024-11-08 22:35:00,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 22:35:00,339 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:00,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:00,445 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 22:35:00,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:00,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 486 states and 664 transitions. [2024-11-08 22:35:00,609 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 664 transitions. [2024-11-08 22:35:00,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 22:35:00,611 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:00,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:00,701 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 22:35:00,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:00,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 497 states and 678 transitions. [2024-11-08 22:35:00,907 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 678 transitions. [2024-11-08 22:35:00,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-08 22:35:00,909 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:00,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:00,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:01,067 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 22:35:01,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:01,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 504 states and 686 transitions. [2024-11-08 22:35:01,156 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 686 transitions. [2024-11-08 22:35:01,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 22:35:01,158 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:01,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:01,245 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 22:35:01,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:01,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 506 states and 688 transitions. [2024-11-08 22:35:01,301 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 688 transitions. [2024-11-08 22:35:01,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 22:35:01,303 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:01,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:01,397 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 22:35:01,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:01,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 513 states and 695 transitions. [2024-11-08 22:35:01,629 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 695 transitions. [2024-11-08 22:35:01,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 22:35:01,633 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:01,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:01,756 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:35:03,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:03,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 551 states and 739 transitions. [2024-11-08 22:35:03,060 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 739 transitions. [2024-11-08 22:35:03,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 22:35:03,062 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:03,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:03,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,206 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:35:03,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:03,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 554 states and 741 transitions. [2024-11-08 22:35:03,496 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 741 transitions. [2024-11-08 22:35:03,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 22:35:03,498 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:03,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:03,617 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:35:03,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:03,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 557 states and 743 transitions. [2024-11-08 22:35:03,988 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 743 transitions. [2024-11-08 22:35:03,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 22:35:03,991 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:03,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:04,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:04,154 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:35:04,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:04,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 571 states and 758 transitions. [2024-11-08 22:35:04,338 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 758 transitions. [2024-11-08 22:35:04,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 22:35:04,340 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:04,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:04,463 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 22:35:04,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:04,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 580 states and 766 transitions. [2024-11-08 22:35:04,563 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 766 transitions. [2024-11-08 22:35:04,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 22:35:04,565 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:04,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:04,723 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:35:04,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:04,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 588 states and 775 transitions. [2024-11-08 22:35:04,998 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 775 transitions. [2024-11-08 22:35:04,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 22:35:04,999 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:04,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:05,111 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 22:35:06,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:06,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 685 states and 880 transitions. [2024-11-08 22:35:06,714 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 880 transitions. [2024-11-08 22:35:06,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 22:35:06,716 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:06,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:06,851 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-08 22:35:07,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:07,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 707 states and 903 transitions. [2024-11-08 22:35:07,481 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 903 transitions. [2024-11-08 22:35:07,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 22:35:07,483 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:07,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:07,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:07,662 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-08 22:35:07,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:07,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 710 states and 905 transitions. [2024-11-08 22:35:07,763 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 905 transitions. [2024-11-08 22:35:07,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-08 22:35:07,765 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:07,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:08,133 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 73 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 22:35:08,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:08,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 739 states and 938 transitions. [2024-11-08 22:35:08,920 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 938 transitions. [2024-11-08 22:35:08,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 22:35:08,922 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:08,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:08,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:09,019 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 22:35:09,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:09,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 753 states and 955 transitions. [2024-11-08 22:35:09,532 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 955 transitions. [2024-11-08 22:35:09,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 22:35:09,534 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:09,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:09,734 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:35:10,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:10,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 772 states and 975 transitions. [2024-11-08 22:35:10,025 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 975 transitions. [2024-11-08 22:35:10,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 22:35:10,027 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:10,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:10,796 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 70 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 22:35:13,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:13,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 823 states and 1046 transitions. [2024-11-08 22:35:13,324 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1046 transitions. [2024-11-08 22:35:13,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 22:35:13,326 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:13,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:13,720 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 70 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 22:35:14,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:14,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 827 states and 1050 transitions. [2024-11-08 22:35:14,189 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1050 transitions. [2024-11-08 22:35:14,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 22:35:14,191 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:14,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:14,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:14,365 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:35:14,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:14,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 850 states and 1073 transitions. [2024-11-08 22:35:14,616 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1073 transitions. [2024-11-08 22:35:14,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 22:35:14,618 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:14,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:14,744 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-08 22:35:14,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:14,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 851 states and 1073 transitions. [2024-11-08 22:35:14,836 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1073 transitions. [2024-11-08 22:35:14,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-08 22:35:14,838 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:14,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:14,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:15,322 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:35:17,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:17,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 901 states and 1127 transitions. [2024-11-08 22:35:17,238 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1127 transitions. [2024-11-08 22:35:17,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-08 22:35:17,239 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:17,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:17,594 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:35:17,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:17,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 874 states and 1099 transitions. [2024-11-08 22:35:17,994 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1099 transitions. [2024-11-08 22:35:17,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-08 22:35:17,996 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:17,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:18,102 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 22:35:18,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:18,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 901 states and 1127 transitions. [2024-11-08 22:35:18,323 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1127 transitions. [2024-11-08 22:35:18,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 22:35:18,325 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:18,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:18,437 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 22:35:19,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:19,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 912 states and 1138 transitions. [2024-11-08 22:35:19,406 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1138 transitions. [2024-11-08 22:35:19,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 22:35:19,408 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:19,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:19,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:19,616 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 22:35:20,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:20,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 945 states and 1176 transitions. [2024-11-08 22:35:20,083 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1176 transitions. [2024-11-08 22:35:20,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 22:35:20,085 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:20,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:20,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:20,235 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 22:35:20,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:20,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 958 states and 1192 transitions. [2024-11-08 22:35:20,739 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1192 transitions. [2024-11-08 22:35:20,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 22:35:20,741 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:20,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:20,899 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 22:35:21,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:21,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 962 states and 1197 transitions. [2024-11-08 22:35:21,499 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1197 transitions. [2024-11-08 22:35:21,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 22:35:21,501 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:21,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:21,665 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 22:35:22,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:22,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 967 states and 1202 transitions. [2024-11-08 22:35:22,207 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1202 transitions. [2024-11-08 22:35:22,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 22:35:22,208 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:22,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:22,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:22,290 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 22:35:23,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:23,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 989 states and 1225 transitions. [2024-11-08 22:35:23,338 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1225 transitions. [2024-11-08 22:35:23,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-08 22:35:23,339 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:23,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:23,485 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 89 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 22:35:25,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:25,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1009 states and 1252 transitions. [2024-11-08 22:35:25,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1252 transitions. [2024-11-08 22:35:25,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-08 22:35:25,119 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:25,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:25,310 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 89 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 22:35:25,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:25,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1022 states and 1265 transitions. [2024-11-08 22:35:25,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1265 transitions. [2024-11-08 22:35:25,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 22:35:25,952 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:25,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:26,738 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 90 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:35:31,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:31,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1106 states and 1368 transitions. [2024-11-08 22:35:31,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1368 transitions. [2024-11-08 22:35:31,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 22:35:31,589 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:31,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:32,050 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 22:35:33,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:33,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1162 states and 1424 transitions. [2024-11-08 22:35:33,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1424 transitions. [2024-11-08 22:35:33,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 22:35:33,961 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:33,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:34,222 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 22:35:34,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:34,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1177 states and 1439 transitions. [2024-11-08 22:35:34,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1439 transitions. [2024-11-08 22:35:34,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 22:35:34,411 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:34,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:35,144 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 94 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:35:39,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:39,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1223 states and 1499 transitions. [2024-11-08 22:35:39,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1499 transitions. [2024-11-08 22:35:39,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 22:35:39,276 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:39,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:39,564 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 94 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:35:40,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:40,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1228 states and 1506 transitions. [2024-11-08 22:35:40,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1506 transitions. [2024-11-08 22:35:40,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 22:35:40,744 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:40,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:41,050 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 94 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:35:43,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:43,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1247 states and 1535 transitions. [2024-11-08 22:35:43,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1535 transitions. [2024-11-08 22:35:43,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 22:35:43,410 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:43,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:43,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:43,783 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 94 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:35:44,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:44,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1250 states and 1540 transitions. [2024-11-08 22:35:44,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1540 transitions. [2024-11-08 22:35:44,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 22:35:44,355 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:44,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:44,654 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 98 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:35:45,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:45,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1256 states and 1547 transitions. [2024-11-08 22:35:45,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1547 transitions. [2024-11-08 22:35:45,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-08 22:35:45,631 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:45,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:46,107 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-08 22:35:47,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:47,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1280 states and 1573 transitions. [2024-11-08 22:35:47,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1573 transitions. [2024-11-08 22:35:47,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-08 22:35:47,108 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:47,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:47,254 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-08 22:35:47,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:47,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1281 states and 1573 transitions. [2024-11-08 22:35:47,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1573 transitions. [2024-11-08 22:35:47,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-08 22:35:47,506 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:47,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:47,614 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-08 22:35:47,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:47,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1285 states and 1577 transitions. [2024-11-08 22:35:47,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1577 transitions. [2024-11-08 22:35:47,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-08 22:35:47,999 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:47,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:48,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:48,596 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:35:49,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:49,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1290 states and 1589 transitions. [2024-11-08 22:35:49,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1589 transitions. [2024-11-08 22:35:49,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-08 22:35:49,667 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:49,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:49,960 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:35:50,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:50,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1291 states and 1589 transitions. [2024-11-08 22:35:50,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1589 transitions. [2024-11-08 22:35:50,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-08 22:35:50,451 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:50,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:50,768 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:35:51,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:51,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1292 states and 1589 transitions. [2024-11-08 22:35:51,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1589 transitions. [2024-11-08 22:35:51,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 22:35:51,306 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:51,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:52,003 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:35:53,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:53,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1361 states and 1673 transitions. [2024-11-08 22:35:53,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1673 transitions. [2024-11-08 22:35:53,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 22:35:53,603 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:53,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:53,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:53,820 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-08 22:35:54,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:54,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1362 states and 1673 transitions. [2024-11-08 22:35:54,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1673 transitions. [2024-11-08 22:35:54,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-08 22:35:54,020 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:54,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:54,118 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 22:35:54,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:54,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1371 states and 1681 transitions. [2024-11-08 22:35:54,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1681 transitions. [2024-11-08 22:35:54,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-08 22:35:54,380 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:54,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:54,448 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-08 22:35:54,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:54,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1373 states and 1682 transitions. [2024-11-08 22:35:54,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 1682 transitions. [2024-11-08 22:35:54,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 22:35:54,503 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:54,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:54,585 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-08 22:35:55,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:55,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1376 states and 1685 transitions. [2024-11-08 22:35:55,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 1685 transitions. [2024-11-08 22:35:55,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-08 22:35:55,299 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:55,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:55,447 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-11-08 22:35:55,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:55,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1377 states and 1685 transitions. [2024-11-08 22:35:55,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1685 transitions. [2024-11-08 22:35:55,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-08 22:35:55,510 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:55,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:56,236 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 120 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-08 22:35:57,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:57,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1392 states and 1704 transitions. [2024-11-08 22:35:57,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1704 transitions. [2024-11-08 22:35:57,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-08 22:35:57,107 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:57,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:35:57,977 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 163 proven. 38 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-08 22:35:59,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:35:59,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1439 states and 1754 transitions. [2024-11-08 22:35:59,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 1754 transitions. [2024-11-08 22:35:59,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-08 22:35:59,775 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:35:59,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:35:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:00,760 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 130 proven. 49 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 22:36:05,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:05,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1533 states and 1885 transitions. [2024-11-08 22:36:05,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 1885 transitions. [2024-11-08 22:36:05,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-08 22:36:05,880 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:05,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:06,773 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 128 proven. 21 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-08 22:36:07,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:07,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1548 states and 1902 transitions. [2024-11-08 22:36:07,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 1902 transitions. [2024-11-08 22:36:07,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-08 22:36:07,746 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:07,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:08,027 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 159 proven. 46 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-08 22:36:08,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:08,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1567 states and 1922 transitions. [2024-11-08 22:36:08,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 1922 transitions. [2024-11-08 22:36:08,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 22:36:08,635 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:08,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:08,930 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-08 22:36:09,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:09,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1586 states and 1942 transitions. [2024-11-08 22:36:09,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 1942 transitions. [2024-11-08 22:36:09,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 22:36:09,533 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:09,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:09,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:10,106 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 186 proven. 65 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-08 22:36:12,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:12,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2008 states to 1647 states and 2008 transitions. [2024-11-08 22:36:12,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2008 transitions. [2024-11-08 22:36:12,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-08 22:36:12,187 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:12,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:12,270 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-08 22:36:12,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:12,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 1659 states and 2022 transitions. [2024-11-08 22:36:12,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2022 transitions. [2024-11-08 22:36:12,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 22:36:12,869 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:12,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:13,731 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-08 22:36:16,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:16,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2077 states to 1699 states and 2077 transitions. [2024-11-08 22:36:16,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2077 transitions. [2024-11-08 22:36:16,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 22:36:16,182 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:16,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:16,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:16,585 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-08 22:36:17,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:17,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 1716 states and 2098 transitions. [2024-11-08 22:36:17,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 2098 transitions. [2024-11-08 22:36:17,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 22:36:17,858 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:17,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:18,412 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-08 22:36:20,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:20,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 1730 states and 2115 transitions. [2024-11-08 22:36:20,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1730 states and 2115 transitions. [2024-11-08 22:36:20,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 22:36:20,106 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:20,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:20,481 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-08 22:36:21,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:21,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 1733 states and 2117 transitions. [2024-11-08 22:36:21,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2117 transitions. [2024-11-08 22:36:21,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 22:36:21,277 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:21,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:21,819 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-08 22:36:22,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:22,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 1737 states and 2120 transitions. [2024-11-08 22:36:22,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 2120 transitions. [2024-11-08 22:36:22,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 22:36:22,668 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:22,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:36:23,071 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 140 proven. 71 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 22:36:23,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:36:23,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 1743 states and 2127 transitions. [2024-11-08 22:36:23,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 2127 transitions. [2024-11-08 22:36:23,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-08 22:36:23,295 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:36:23,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:36:23,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:36:23,344 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 22:36:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:36:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:36:23,693 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 22:36:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:36:23,933 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 104 iterations. [2024-11-08 22:36:24,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 10:36:24 ImpRootNode [2024-11-08 22:36:24,147 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 22:36:24,148 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 22:36:24,148 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 22:36:24,149 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 22:36:24,149 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:34:36" (3/4) ... [2024-11-08 22:36:24,150 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 22:36:24,498 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f93e2ff9-d4fe-4e69-adbe-7ac497eb4536/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 22:36:24,498 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 22:36:24,499 INFO L158 Benchmark]: Toolchain (without parser) took 110583.43ms. Allocated memory was 159.4MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 120.2MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 966.9MB. Max. memory is 16.1GB. [2024-11-08 22:36:24,499 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 119.5MB. Free memory is still 65.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:36:24,500 INFO L158 Benchmark]: CACSL2BoogieTranslator took 832.02ms. Allocated memory is still 159.4MB. Free memory was 120.2MB in the beginning and 90.2MB in the end (delta: 30.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-08 22:36:24,500 INFO L158 Benchmark]: Boogie Procedure Inliner took 110.07ms. Allocated memory is still 159.4MB. Free memory was 90.1MB in the beginning and 83.9MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 22:36:24,500 INFO L158 Benchmark]: Boogie Preprocessor took 73.61ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 79.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 22:36:24,501 INFO L158 Benchmark]: RCFGBuilder took 2000.76ms. Allocated memory is still 159.4MB. Free memory was 79.7MB in the beginning and 85.9MB in the end (delta: -6.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-08 22:36:24,501 INFO L158 Benchmark]: CodeCheck took 107207.33ms. Allocated memory was 159.4MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 85.9MB in the beginning and 579.9MB in the end (delta: -494.0MB). Peak memory consumption was 907.9MB. Max. memory is 16.1GB. [2024-11-08 22:36:24,502 INFO L158 Benchmark]: Witness Printer took 349.93ms. Allocated memory was 1.6GB in the beginning and 1.9GB in the end (delta: 337.6MB). Free memory was 579.9MB in the beginning and 1.8GB in the end (delta: -1.2GB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2024-11-08 22:36:24,504 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: 107.0s, OverallIterations: 104, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 169161 SdHoareTripleChecker+Valid, 583.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 165894 mSDsluCounter, 25794 SdHoareTripleChecker+Invalid, 496.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21697 mSDsCounter, 54927 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 379578 IncrementalHoareTripleChecker+Invalid, 434505 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54927 mSolverCounterUnsat, 4097 mSDtfsCounter, 379578 mSolverCounterSat, 6.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100303 GetRequests, 96459 SyntacticMatches, 3120 SemanticMatches, 724 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312588 ImplicationChecksByTransitivity, 64.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.8s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 23.4s InterpolantComputationTime, 14430 NumberOfCodeBlocks, 14430 NumberOfCodeBlocksAsserted, 104 NumberOfCheckSat, 14114 ConstructedInterpolants, 0 QuantifiedInterpolants, 68050 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 103 InterpolantComputations, 70 PerfectInterpolantSequences, 8826/9587 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: 417]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int d= 4; [L19] int e= 5; [L20] int f= 6; [L21] int c= 3; [L22] int b= 2; [L25] int u = 21; [L26] int v = 22; [L27] int w = 23; [L28] int x = 24; [L29] int y = 25; [L30] int z = 26; [L32] int a17 = 1; [L33] int a7 = 0; [L34] int a20 = 1; [L35] int a8 = 15; [L36] int a12 = 8; [L37] int a16 = 5; [L38] int a21 = 1; [L590] int output = -1; VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L344] a17 = 0 [L345] a16 = 4 [L346] return 21; VAL [\result=21, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L279] a20 = 0 [L280] a17 = 1 [L281] a16 = 6 [L282] return 21; VAL [\result=21, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L73] a17 = 0 [L74] return 26; VAL [\result=26, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L83] a7 = 1 [L84] a17 = 1 [L85] a21 = 0 [L86] a20 = 1 [L87] a8 = 13 [L88] a16 = 5 [L89] return 26; VAL [\result=26, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=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=0, a7=1, a8=13, a=1, 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=0, a7=1, a8=13, a=1, 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=0, a7=1, a8=13, a=1, 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=0, a7=1, a8=13, a=1, 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=0, a7=1, a8=13, a=1, 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=0, a7=1, a8=13, a=1, 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=0, a7=1, a8=13, a=1, 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=0, a7=1, a8=13, a=1, 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=0, a7=1, a8=13, a=1, 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=0, a7=1, a8=13, a=1, 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=0, a7=1, a8=13, a=1, 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 TRUE (((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1)) [L113] a20 = 0 [L114] a8 = 15 [L115] a17 = 0 [L116] a21 = 1 [L117] return -1; VAL [\result=-1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [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=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [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=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [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=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [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))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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] [L416] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1)) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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] [L417] reach_error() VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 119.5MB. Free memory is still 65.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 832.02ms. Allocated memory is still 159.4MB. Free memory was 120.2MB in the beginning and 90.2MB in the end (delta: 30.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 110.07ms. Allocated memory is still 159.4MB. Free memory was 90.1MB in the beginning and 83.9MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.61ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 79.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2000.76ms. Allocated memory is still 159.4MB. Free memory was 79.7MB in the beginning and 85.9MB in the end (delta: -6.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * CodeCheck took 107207.33ms. Allocated memory was 159.4MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 85.9MB in the beginning and 579.9MB in the end (delta: -494.0MB). Peak memory consumption was 907.9MB. Max. memory is 16.1GB. * Witness Printer took 349.93ms. Allocated memory was 1.6GB in the beginning and 1.9GB in the end (delta: 337.6MB). Free memory was 579.9MB in the beginning and 1.8GB in the end (delta: -1.2GB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-08 22:36:24,558 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f93e2ff9-d4fe-4e69-adbe-7ac497eb4536/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE