./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label57.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_965e987b-b293-476f-b8dc-b9915dcf4b86/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_965e987b-b293-476f-b8dc-b9915dcf4b86/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_965e987b-b293-476f-b8dc-b9915dcf4b86/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_965e987b-b293-476f-b8dc-b9915dcf4b86/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label57.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_965e987b-b293-476f-b8dc-b9915dcf4b86/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_965e987b-b293-476f-b8dc-b9915dcf4b86/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 0128e00bf508dfedd424bfda3d692f75ea10f378731858e87047f02277f2ca04 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 00:47:51,392 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:47:51,504 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_965e987b-b293-476f-b8dc-b9915dcf4b86/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-09 00:47:51,514 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:47:51,515 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-09 00:47:51,557 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:47:51,560 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:47:51,560 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-09 00:47:51,561 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:47:51,561 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:47:51,562 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:47:51,562 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:47:51,562 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:47:51,563 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:47:51,563 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:47:51,563 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:47:51,563 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:47:51,564 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:47:51,564 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:47:51,568 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:47:51,568 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:47:51,571 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:47:51,572 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:47:51,572 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-09 00:47:51,573 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-09 00:47:51,573 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-09 00:47:51,573 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:47:51,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:47:51,574 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:47:51,574 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:47:51,574 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:47:51,575 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-09 00:47:51,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:47:51,575 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_965e987b-b293-476f-b8dc-b9915dcf4b86/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_965e987b-b293-476f-b8dc-b9915dcf4b86/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 -> 0128e00bf508dfedd424bfda3d692f75ea10f378731858e87047f02277f2ca04 [2024-11-09 00:47:51,899 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:47:51,927 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:47:51,930 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:47:51,932 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:47:51,933 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:47:51,935 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_965e987b-b293-476f-b8dc-b9915dcf4b86/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/eca-rers2012/Problem01_label57.c Unable to find full path for "g++" [2024-11-09 00:47:53,983 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:47:54,232 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:47:54,233 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_965e987b-b293-476f-b8dc-b9915dcf4b86/sv-benchmarks/c/eca-rers2012/Problem01_label57.c [2024-11-09 00:47:54,256 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_965e987b-b293-476f-b8dc-b9915dcf4b86/bin/ukojak-verify-ImItNfHLgk/data/96e658f7a/62260d65b84e44d79600d6b384c42b84/FLAGf49df0a04 [2024-11-09 00:47:54,273 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_965e987b-b293-476f-b8dc-b9915dcf4b86/bin/ukojak-verify-ImItNfHLgk/data/96e658f7a/62260d65b84e44d79600d6b384c42b84 [2024-11-09 00:47:54,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:47:54,277 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:47:54,278 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:47:54,279 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:47:54,284 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:47:54,285 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:47:54" (1/1) ... [2024-11-09 00:47:54,286 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4480c4d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:47:54, skipping insertion in model container [2024-11-09 00:47:54,286 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:47:54" (1/1) ... [2024-11-09 00:47:54,335 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:47:54,724 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_965e987b-b293-476f-b8dc-b9915dcf4b86/sv-benchmarks/c/eca-rers2012/Problem01_label57.c[15253,15266] [2024-11-09 00:47:54,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:47:54,805 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:47:54,932 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_965e987b-b293-476f-b8dc-b9915dcf4b86/sv-benchmarks/c/eca-rers2012/Problem01_label57.c[15253,15266] [2024-11-09 00:47:54,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:47:54,987 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:47:54,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:47:54 WrapperNode [2024-11-09 00:47:54,987 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:47:54,988 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:47:54,989 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:47:54,989 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:47:54,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:47:54" (1/1) ... [2024-11-09 00:47:55,022 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:47:54" (1/1) ... [2024-11-09 00:47:55,073 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-09 00:47:55,074 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:47:55,074 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:47:55,075 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:47:55,075 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:47:55,085 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:47:54" (1/1) ... [2024-11-09 00:47:55,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:47:54" (1/1) ... [2024-11-09 00:47:55,089 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:47:54" (1/1) ... [2024-11-09 00:47:55,090 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:47:54" (1/1) ... [2024-11-09 00:47:55,108 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:47:54" (1/1) ... [2024-11-09 00:47:55,122 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:47:54" (1/1) ... [2024-11-09 00:47:55,126 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:47:54" (1/1) ... [2024-11-09 00:47:55,130 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:47:54" (1/1) ... [2024-11-09 00:47:55,136 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:47:55,137 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:47:55,137 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:47:55,137 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:47:55,138 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:47:54" (1/1) ... [2024-11-09 00:47:55,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:47:55,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_965e987b-b293-476f-b8dc-b9915dcf4b86/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-09 00:47:55,178 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_965e987b-b293-476f-b8dc-b9915dcf4b86/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-09 00:47:55,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_965e987b-b293-476f-b8dc-b9915dcf4b86/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-09 00:47:55,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:47:55,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 00:47:55,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:47:55,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:47:55,300 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:47:55,304 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:47:56,519 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-09 00:47:56,519 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:47:56,807 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:47:56,807 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:47:56,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:47:56 BoogieIcfgContainer [2024-11-09 00:47:56,808 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:47:56,809 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-09 00:47:56,809 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-09 00:47:56,820 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-09 00:47:56,820 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:47:56" (1/1) ... [2024-11-09 00:47:56,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:47:56,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:47:56,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-09 00:47:56,886 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-09 00:47:56,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 00:47:56,891 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:47:56,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:47:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:47:57,452 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-09 00:47:58,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:47:58,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 145 states and 237 transitions. [2024-11-09 00:47:58,090 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 237 transitions. [2024-11-09 00:47:58,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 00:47:58,094 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:47:58,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:47:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:47:58,293 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-09 00:47:58,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:47:58,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 146 states and 238 transitions. [2024-11-09 00:47:58,501 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 238 transitions. [2024-11-09 00:47:58,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-09 00:47:58,502 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:47:58,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:47:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:47:58,624 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-09 00:47:58,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:47:58,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 150 states and 244 transitions. [2024-11-09 00:47:58,712 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 244 transitions. [2024-11-09 00:47:58,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-09 00:47:58,714 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:47:58,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:47:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:47:58,825 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-09 00:47:58,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:47:58,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 151 states and 245 transitions. [2024-11-09 00:47:58,993 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 245 transitions. [2024-11-09 00:47:58,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-09 00:47:58,998 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:47:58,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:47:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:47:59,203 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-09 00:47:59,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:47:59,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 159 states and 258 transitions. [2024-11-09 00:47:59,426 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 258 transitions. [2024-11-09 00:47:59,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 00:47:59,431 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:47:59,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:47:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:47:59,588 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-09 00:47:59,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:47:59,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 160 states and 259 transitions. [2024-11-09 00:47:59,744 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 259 transitions. [2024-11-09 00:47:59,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 00:47:59,749 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:47:59,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:47:59,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:47:59,958 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-09 00:48:00,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:00,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 168 states and 268 transitions. [2024-11-09 00:48:00,122 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 268 transitions. [2024-11-09 00:48:00,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 00:48:00,123 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:00,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:00,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:00,413 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-09 00:48:00,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:00,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 182 states and 286 transitions. [2024-11-09 00:48:00,757 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 286 transitions. [2024-11-09 00:48:00,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-09 00:48:00,758 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:00,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:00,888 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-09 00:48:01,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:01,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 197 states and 306 transitions. [2024-11-09 00:48:01,391 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 306 transitions. [2024-11-09 00:48:01,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 00:48:01,392 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:01,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:01,596 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-09 00:48:02,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:02,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 212 states and 327 transitions. [2024-11-09 00:48:02,311 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 327 transitions. [2024-11-09 00:48:02,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 00:48:02,312 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:02,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:02,487 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-09 00:48:03,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:03,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 230 states and 356 transitions. [2024-11-09 00:48:03,282 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2024-11-09 00:48:03,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-09 00:48:03,283 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:03,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:03,495 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-09 00:48:03,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:03,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 232 states and 359 transitions. [2024-11-09 00:48:03,742 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 359 transitions. [2024-11-09 00:48:03,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 00:48:03,743 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:03,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:03,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:03,860 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-09 00:48:04,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:04,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 237 states and 365 transitions. [2024-11-09 00:48:04,005 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 365 transitions. [2024-11-09 00:48:04,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 00:48:04,007 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:04,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:04,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:04,181 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-09 00:48:04,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:04,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 238 states and 366 transitions. [2024-11-09 00:48:04,395 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 366 transitions. [2024-11-09 00:48:04,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 00:48:04,396 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:04,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:04,502 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-09 00:48:05,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:05,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 257 states and 395 transitions. [2024-11-09 00:48:05,410 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 395 transitions. [2024-11-09 00:48:05,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 00:48:05,412 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:05,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:05,516 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-09 00:48:05,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:05,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 258 states and 396 transitions. [2024-11-09 00:48:05,724 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 396 transitions. [2024-11-09 00:48:05,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 00:48:05,725 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:05,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:05,863 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-09 00:48:06,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:06,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 273 states and 415 transitions. [2024-11-09 00:48:06,363 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 415 transitions. [2024-11-09 00:48:06,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 00:48:06,364 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:06,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:06,445 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-09 00:48:07,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:07,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 291 states and 435 transitions. [2024-11-09 00:48:07,202 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 435 transitions. [2024-11-09 00:48:07,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 00:48:07,203 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:07,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:07,286 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-09 00:48:07,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:07,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 295 states and 439 transitions. [2024-11-09 00:48:07,339 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 439 transitions. [2024-11-09 00:48:07,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 00:48:07,340 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:07,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:07,456 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-09 00:48:07,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:07,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 299 states and 444 transitions. [2024-11-09 00:48:07,864 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 444 transitions. [2024-11-09 00:48:07,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 00:48:07,866 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:07,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:07,934 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-09 00:48:08,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:08,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 307 states and 459 transitions. [2024-11-09 00:48:08,398 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 459 transitions. [2024-11-09 00:48:08,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 00:48:08,401 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:08,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:08,473 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-09 00:48:08,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:08,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 313 states and 467 transitions. [2024-11-09 00:48:08,903 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 467 transitions. [2024-11-09 00:48:08,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 00:48:08,904 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:08,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:08,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:09,004 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-09 00:48:09,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:09,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 316 states and 471 transitions. [2024-11-09 00:48:09,242 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 471 transitions. [2024-11-09 00:48:09,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 00:48:09,243 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:09,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:09,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:09,304 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-09 00:48:09,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:09,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 331 states and 491 transitions. [2024-11-09 00:48:09,799 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 491 transitions. [2024-11-09 00:48:09,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 00:48:09,799 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:09,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:09,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:09,965 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-09 00:48:10,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:10,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 345 states and 508 transitions. [2024-11-09 00:48:10,290 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 508 transitions. [2024-11-09 00:48:10,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 00:48:10,291 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:10,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:10,483 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-09 00:48:10,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:10,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 347 states and 510 transitions. [2024-11-09 00:48:10,771 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 510 transitions. [2024-11-09 00:48:10,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 00:48:10,772 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:10,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:10,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:10,852 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-09 00:48:11,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:11,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 353 states and 516 transitions. [2024-11-09 00:48:11,219 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 516 transitions. [2024-11-09 00:48:11,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 00:48:11,220 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:11,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:11,300 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-09 00:48:11,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:11,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 357 states and 519 transitions. [2024-11-09 00:48:11,348 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 519 transitions. [2024-11-09 00:48:11,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 00:48:11,349 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:11,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:11,488 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-09 00:48:11,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:11,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 359 states and 522 transitions. [2024-11-09 00:48:11,545 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 522 transitions. [2024-11-09 00:48:11,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 00:48:11,546 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:11,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:11,700 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-09 00:48:12,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:12,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 373 states and 540 transitions. [2024-11-09 00:48:12,267 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 540 transitions. [2024-11-09 00:48:12,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 00:48:12,269 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:12,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:12,422 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-09 00:48:12,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:12,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 377 states and 545 transitions. [2024-11-09 00:48:12,710 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 545 transitions. [2024-11-09 00:48:12,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 00:48:12,712 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:12,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:12,887 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-09 00:48:13,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:13,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 379 states and 548 transitions. [2024-11-09 00:48:13,066 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 548 transitions. [2024-11-09 00:48:13,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-09 00:48:13,067 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:13,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:13,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:13,350 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-09 00:48:13,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:13,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 386 states and 555 transitions. [2024-11-09 00:48:13,776 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 555 transitions. [2024-11-09 00:48:13,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-09 00:48:13,777 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:13,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:13,998 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-09 00:48:14,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:14,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 395 states and 564 transitions. [2024-11-09 00:48:14,452 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 564 transitions. [2024-11-09 00:48:14,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-09 00:48:14,453 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:14,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:14,588 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-09 00:48:14,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:14,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 399 states and 567 transitions. [2024-11-09 00:48:14,876 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 567 transitions. [2024-11-09 00:48:14,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-09 00:48:14,877 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:14,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:15,040 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-09 00:48:15,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:15,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 402 states and 569 transitions. [2024-11-09 00:48:15,333 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 569 transitions. [2024-11-09 00:48:15,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 00:48:15,334 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:15,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:15,445 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-09 00:48:16,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:16,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 472 states and 647 transitions. [2024-11-09 00:48:16,130 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 647 transitions. [2024-11-09 00:48:16,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 00:48:16,131 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:16,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:16,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:16,218 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-09 00:48:16,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:16,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 486 states and 664 transitions. [2024-11-09 00:48:16,334 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 664 transitions. [2024-11-09 00:48:16,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-09 00:48:16,335 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:16,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:16,420 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-09 00:48:16,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:16,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 497 states and 678 transitions. [2024-11-09 00:48:16,617 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 678 transitions. [2024-11-09 00:48:16,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 00:48:16,618 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:16,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:16,734 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-09 00:48:16,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:16,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 504 states and 686 transitions. [2024-11-09 00:48:16,803 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 686 transitions. [2024-11-09 00:48:16,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 00:48:16,804 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:16,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:16,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:16,882 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-09 00:48:16,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:16,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 506 states and 688 transitions. [2024-11-09 00:48:16,921 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 688 transitions. [2024-11-09 00:48:16,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 00:48:16,923 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:16,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:16,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:16,999 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-09 00:48:17,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:17,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 513 states and 695 transitions. [2024-11-09 00:48:17,180 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 695 transitions. [2024-11-09 00:48:17,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 00:48:17,181 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:17,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:17,305 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-09 00:48:18,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:18,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 551 states and 739 transitions. [2024-11-09 00:48:18,207 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 739 transitions. [2024-11-09 00:48:18,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 00:48:18,209 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:18,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:18,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:18,301 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-09 00:48:18,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:18,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 554 states and 741 transitions. [2024-11-09 00:48:18,550 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 741 transitions. [2024-11-09 00:48:18,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 00:48:18,551 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:18,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:18,644 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-09 00:48:19,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:19,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 557 states and 743 transitions. [2024-11-09 00:48:19,055 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 743 transitions. [2024-11-09 00:48:19,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 00:48:19,057 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:19,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:19,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:19,157 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-09 00:48:19,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:19,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 571 states and 758 transitions. [2024-11-09 00:48:19,263 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 758 transitions. [2024-11-09 00:48:19,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 00:48:19,264 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:19,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:19,334 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-09 00:48:19,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:19,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 580 states and 766 transitions. [2024-11-09 00:48:19,408 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 766 transitions. [2024-11-09 00:48:19,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-09 00:48:19,409 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:19,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:19,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:19,524 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-09 00:48:19,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:19,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 588 states and 775 transitions. [2024-11-09 00:48:19,733 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 775 transitions. [2024-11-09 00:48:19,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 00:48:19,734 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:19,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:19,851 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-09 00:48:20,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:20,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 672 states and 862 transitions. [2024-11-09 00:48:20,704 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 862 transitions. [2024-11-09 00:48:20,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 00:48:20,706 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:20,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:20,995 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 49 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:48:21,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:21,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 703 states and 897 transitions. [2024-11-09 00:48:21,678 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 897 transitions. [2024-11-09 00:48:21,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 00:48:21,679 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:21,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:21,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:21,809 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 00:48:22,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:22,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 708 states and 901 transitions. [2024-11-09 00:48:22,025 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 901 transitions. [2024-11-09 00:48:22,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 00:48:22,026 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:22,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:22,242 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 66 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 00:48:22,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:22,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 711 states and 904 transitions. [2024-11-09 00:48:22,381 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 904 transitions. [2024-11-09 00:48:22,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 00:48:22,382 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:22,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:22,464 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-09 00:48:22,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:22,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 725 states and 921 transitions. [2024-11-09 00:48:22,925 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 921 transitions. [2024-11-09 00:48:22,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 00:48:22,926 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:22,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:23,019 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:48:23,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:23,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 752 states and 949 transitions. [2024-11-09 00:48:23,218 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 949 transitions. [2024-11-09 00:48:23,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 00:48:23,220 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:23,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:23,397 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-09 00:48:23,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:23,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 769 states and 967 transitions. [2024-11-09 00:48:23,630 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 967 transitions. [2024-11-09 00:48:23,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-09 00:48:23,631 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:23,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:23,825 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-09 00:48:24,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:24,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 792 states and 991 transitions. [2024-11-09 00:48:24,225 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 991 transitions. [2024-11-09 00:48:24,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-09 00:48:24,227 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:24,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:24,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:24,302 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-09 00:48:24,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:24,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 793 states and 991 transitions. [2024-11-09 00:48:24,344 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 991 transitions. [2024-11-09 00:48:24,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-09 00:48:24,345 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:24,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:24,962 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-09 00:48:27,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:27,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 865 states and 1084 transitions. [2024-11-09 00:48:27,838 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1084 transitions. [2024-11-09 00:48:27,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-09 00:48:27,839 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:27,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:27,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:28,151 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-09 00:48:28,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:28,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 869 states and 1089 transitions. [2024-11-09 00:48:28,804 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1089 transitions. [2024-11-09 00:48:28,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-09 00:48:28,805 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:28,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:28,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:28,900 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:48:29,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:29,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 896 states and 1120 transitions. [2024-11-09 00:48:29,566 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1120 transitions. [2024-11-09 00:48:29,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-09 00:48:29,567 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:29,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:29,830 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:48:31,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:31,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 962 states and 1193 transitions. [2024-11-09 00:48:31,394 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1193 transitions. [2024-11-09 00:48:31,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-09 00:48:31,396 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:31,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:31,463 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-09 00:48:31,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:31,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 975 states and 1206 transitions. [2024-11-09 00:48:31,553 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1206 transitions. [2024-11-09 00:48:31,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-09 00:48:31,554 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:31,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:31,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:31,615 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 00:48:31,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:31,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 976 states and 1207 transitions. [2024-11-09 00:48:31,646 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1207 transitions. [2024-11-09 00:48:31,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-09 00:48:31,647 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:31,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:31,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:31,822 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-09 00:48:31,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:31,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 989 states and 1221 transitions. [2024-11-09 00:48:31,970 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1221 transitions. [2024-11-09 00:48:31,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 00:48:31,972 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:31,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:32,506 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 82 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:48:36,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:36,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1072 states and 1319 transitions. [2024-11-09 00:48:36,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1319 transitions. [2024-11-09 00:48:36,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-09 00:48:36,121 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:36,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:36,352 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:48:37,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:37,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1091 states and 1339 transitions. [2024-11-09 00:48:37,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1339 transitions. [2024-11-09 00:48:37,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-09 00:48:37,005 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:37,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:37,258 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 00:48:39,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:39,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1126 states and 1382 transitions. [2024-11-09 00:48:39,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1382 transitions. [2024-11-09 00:48:39,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-09 00:48:39,028 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:39,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:39,254 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 00:48:39,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:39,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1131 states and 1389 transitions. [2024-11-09 00:48:39,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1389 transitions. [2024-11-09 00:48:39,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-09 00:48:39,627 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:39,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:39,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:39,851 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 00:48:40,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:40,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1135 states and 1393 transitions. [2024-11-09 00:48:40,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1393 transitions. [2024-11-09 00:48:40,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-09 00:48:40,223 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:40,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:40,610 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 00:48:41,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:41,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1141 states and 1399 transitions. [2024-11-09 00:48:41,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1399 transitions. [2024-11-09 00:48:41,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-09 00:48:41,739 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:41,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:42,032 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 00:48:42,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:42,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1206 states and 1464 transitions. [2024-11-09 00:48:42,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1464 transitions. [2024-11-09 00:48:42,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-09 00:48:42,797 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:42,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:42,889 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 00:48:43,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:43,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1207 states and 1465 transitions. [2024-11-09 00:48:43,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1465 transitions. [2024-11-09 00:48:43,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-09 00:48:43,253 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:43,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:43,395 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-09 00:48:44,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:44,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1225 states and 1485 transitions. [2024-11-09 00:48:44,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1485 transitions. [2024-11-09 00:48:44,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-09 00:48:44,196 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:44,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:44,329 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 00:48:46,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:46,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1279 states and 1546 transitions. [2024-11-09 00:48:46,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1546 transitions. [2024-11-09 00:48:46,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-09 00:48:46,903 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:46,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:47,043 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 00:48:47,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:47,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1286 states and 1553 transitions. [2024-11-09 00:48:47,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1553 transitions. [2024-11-09 00:48:47,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 00:48:47,853 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:47,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:47,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:48,585 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-09 00:48:54,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:54,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1365 states and 1648 transitions. [2024-11-09 00:48:54,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 1648 transitions. [2024-11-09 00:48:54,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 00:48:54,140 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:54,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:54,386 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-09 00:48:57,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:57,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1386 states and 1678 transitions. [2024-11-09 00:48:57,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1678 transitions. [2024-11-09 00:48:57,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 00:48:57,034 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:57,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:57,293 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-09 00:48:57,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:57,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1389 states and 1682 transitions. [2024-11-09 00:48:57,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1682 transitions. [2024-11-09 00:48:57,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-09 00:48:57,776 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:57,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:57,947 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-09 00:48:58,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:58,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1414 states and 1708 transitions. [2024-11-09 00:48:58,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 1708 transitions. [2024-11-09 00:48:58,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-09 00:48:58,972 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:58,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:59,333 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-09 00:48:59,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:48:59,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1418 states and 1711 transitions. [2024-11-09 00:48:59,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 1711 transitions. [2024-11-09 00:48:59,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-09 00:48:59,970 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:48:59,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:49:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:00,223 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-09 00:49:01,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:49:01,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1488 states and 1789 transitions. [2024-11-09 00:49:01,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1789 transitions. [2024-11-09 00:49:01,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-09 00:49:01,151 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:49:01,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:49:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:01,715 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-09 00:49:02,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:49:02,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1493 states and 1801 transitions. [2024-11-09 00:49:02,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 1801 transitions. [2024-11-09 00:49:02,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-09 00:49:02,792 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:49:02,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:49:02,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:03,181 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-09 00:49:03,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:49:03,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1494 states and 1801 transitions. [2024-11-09 00:49:03,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1801 transitions. [2024-11-09 00:49:03,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-09 00:49:03,673 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:49:03,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:49:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:04,055 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-09 00:49:04,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:49:04,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1495 states and 1801 transitions. [2024-11-09 00:49:04,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1801 transitions. [2024-11-09 00:49:04,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-09 00:49:04,575 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:49:04,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:49:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:05,203 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-09 00:49:06,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:49:06,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1564 states and 1885 transitions. [2024-11-09 00:49:06,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 1885 transitions. [2024-11-09 00:49:06,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-09 00:49:06,649 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:49:06,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:49:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:07,079 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-09 00:49:08,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:49:08,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1908 states to 1583 states and 1908 transitions. [2024-11-09 00:49:08,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 1908 transitions. [2024-11-09 00:49:08,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-09 00:49:08,214 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:49:08,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:49:08,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:09,032 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 3 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:49:14,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:49:14,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 1766 states and 2117 transitions. [2024-11-09 00:49:14,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2117 transitions. [2024-11-09 00:49:14,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-09 00:49:14,411 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:49:14,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:49:14,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:14,987 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-09 00:49:15,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:49:15,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 1781 states and 2136 transitions. [2024-11-09 00:49:15,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2136 transitions. [2024-11-09 00:49:15,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-09 00:49:15,729 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:49:15,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:49:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:15,961 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-09 00:49:18,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:49:18,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 1802 states and 2168 transitions. [2024-11-09 00:49:18,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2168 transitions. [2024-11-09 00:49:18,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-09 00:49:18,168 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:49:18,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:49:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:18,999 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 136 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:49:21,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:49:21,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 1858 states and 2237 transitions. [2024-11-09 00:49:21,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2237 transitions. [2024-11-09 00:49:21,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-09 00:49:21,988 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:49:21,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:49:22,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:22,203 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-09 00:49:24,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:49:24,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 1868 states and 2255 transitions. [2024-11-09 00:49:24,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 2255 transitions. [2024-11-09 00:49:24,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-09 00:49:24,074 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:49:24,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:49:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:24,776 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 136 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:49:25,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:49:25,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 1878 states and 2267 transitions. [2024-11-09 00:49:25,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 2267 transitions. [2024-11-09 00:49:25,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-09 00:49:25,620 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:49:25,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:49:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:26,052 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 136 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:49:26,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:49:26,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2271 states to 1881 states and 2271 transitions. [2024-11-09 00:49:26,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 2271 transitions. [2024-11-09 00:49:26,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-09 00:49:26,662 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:49:26,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:49:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:26,822 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-09 00:49:27,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:49:27,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 1884 states and 2281 transitions. [2024-11-09 00:49:27,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 2281 transitions. [2024-11-09 00:49:27,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-09 00:49:27,342 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:49:27,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:49:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:27,570 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-09 00:49:28,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:49:28,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 1909 states and 2305 transitions. [2024-11-09 00:49:28,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1909 states and 2305 transitions. [2024-11-09 00:49:28,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-09 00:49:28,748 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:49:28,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:49:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:29,214 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 135 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:49:33,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:49:33,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 1970 states and 2386 transitions. [2024-11-09 00:49:33,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 2386 transitions. [2024-11-09 00:49:33,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-09 00:49:33,629 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:49:33,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:49:33,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:34,234 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 205 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 00:49:37,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:49:37,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2484 states to 2053 states and 2484 transitions. [2024-11-09 00:49:37,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 2484 transitions. [2024-11-09 00:49:37,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-09 00:49:37,222 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:49:37,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:49:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:37,588 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 205 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 00:49:38,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:49:38,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2487 states to 2057 states and 2487 transitions. [2024-11-09 00:49:38,220 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 2487 transitions. [2024-11-09 00:49:38,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-09 00:49:38,222 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:49:38,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:49:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:38,503 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 137 proven. 71 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-09 00:49:38,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:49:38,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2509 states to 2077 states and 2509 transitions. [2024-11-09 00:49:38,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2077 states and 2509 transitions. [2024-11-09 00:49:38,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-09 00:49:38,792 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:49:38,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:49:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:39,085 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 136 proven. 65 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 00:49:40,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:49:40,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2529 states to 2097 states and 2529 transitions. [2024-11-09 00:49:40,151 INFO L276 IsEmpty]: Start isEmpty. Operand 2097 states and 2529 transitions. [2024-11-09 00:49:40,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-09 00:49:40,154 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:49:40,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:49:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:40,348 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-11-09 00:49:40,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:49:40,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2102 states and 2537 transitions. [2024-11-09 00:49:40,856 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 2537 transitions. [2024-11-09 00:49:40,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-09 00:49:40,858 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:49:40,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:49:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:41,297 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-09 00:49:42,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:49:42,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2122 states and 2560 transitions. [2024-11-09 00:49:42,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 2560 transitions. [2024-11-09 00:49:42,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-09 00:49:42,484 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:49:42,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:49:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:42,842 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 139 proven. 55 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 00:49:47,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:49:47,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2174 states and 2630 transitions. [2024-11-09 00:49:47,473 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 2630 transitions. [2024-11-09 00:49:47,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-09 00:49:47,475 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:49:47,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:49:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:47,829 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:49:48,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:49:48,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2642 states to 2187 states and 2642 transitions. [2024-11-09 00:49:48,381 INFO L276 IsEmpty]: Start isEmpty. Operand 2187 states and 2642 transitions. [2024-11-09 00:49:48,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-09 00:49:48,382 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:49:48,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:49:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:48,493 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-11-09 00:49:49,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:49:49,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2257 states and 2714 transitions. [2024-11-09 00:49:49,256 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 2714 transitions. [2024-11-09 00:49:49,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-09 00:49:49,258 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:49:49,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:49:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:49,516 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 158 proven. 88 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 00:49:50,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:49:50,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2734 states to 2269 states and 2734 transitions. [2024-11-09 00:49:50,428 INFO L276 IsEmpty]: Start isEmpty. Operand 2269 states and 2734 transitions. [2024-11-09 00:49:50,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-09 00:49:50,429 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:49:50,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:49:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:50,763 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 00:49:51,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:49:51,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2748 states to 2281 states and 2748 transitions. [2024-11-09 00:49:51,839 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 2748 transitions. [2024-11-09 00:49:51,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-09 00:49:51,841 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:49:51,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:49:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:52,329 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 175 proven. 42 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 00:49:53,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:49:53,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2753 states to 2284 states and 2753 transitions. [2024-11-09 00:49:53,083 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 2753 transitions. [2024-11-09 00:49:53,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-09 00:49:53,086 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:49:53,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:49:53,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:53,397 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 152 proven. 83 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-09 00:49:54,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:49:54,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2299 states and 2779 transitions. [2024-11-09 00:49:54,853 INFO L276 IsEmpty]: Start isEmpty. Operand 2299 states and 2779 transitions. [2024-11-09 00:49:54,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-09 00:49:54,855 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:49:54,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:49:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:55,089 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-09 00:49:56,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:49:56,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2805 states to 2321 states and 2805 transitions. [2024-11-09 00:49:56,796 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 2805 transitions. [2024-11-09 00:49:56,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-09 00:49:56,798 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:49:56,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:49:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:57,293 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 155 proven. 86 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-09 00:49:59,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:49:59,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2849 states to 2358 states and 2849 transitions. [2024-11-09 00:49:59,076 INFO L276 IsEmpty]: Start isEmpty. Operand 2358 states and 2849 transitions. [2024-11-09 00:49:59,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-09 00:49:59,083 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:49:59,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:49:59,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:59,241 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-09 00:50:00,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:50:00,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2869 states to 2377 states and 2869 transitions. [2024-11-09 00:50:00,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 2869 transitions. [2024-11-09 00:50:00,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-09 00:50:00,165 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:50:00,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:50:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:50:00,550 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 174 proven. 116 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 00:50:01,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:50:01,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2881 states to 2388 states and 2881 transitions. [2024-11-09 00:50:01,874 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 2881 transitions. [2024-11-09 00:50:01,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-09 00:50:01,876 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:50:01,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:50:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:50:02,427 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 182 proven. 112 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 00:50:04,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:50:04,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2912 states to 2412 states and 2912 transitions. [2024-11-09 00:50:04,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2412 states and 2912 transitions. [2024-11-09 00:50:04,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-09 00:50:04,528 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:50:04,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:50:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:50:05,039 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 178 proven. 30 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 00:50:06,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:50:06,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2915 states to 2414 states and 2915 transitions. [2024-11-09 00:50:06,414 INFO L276 IsEmpty]: Start isEmpty. Operand 2414 states and 2915 transitions. [2024-11-09 00:50:06,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-09 00:50:06,415 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:50:06,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:50:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:50:06,819 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 186 proven. 34 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-09 00:50:07,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:50:07,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2418 states and 2920 transitions. [2024-11-09 00:50:07,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 2920 transitions. [2024-11-09 00:50:07,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-09 00:50:07,462 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:50:07,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:50:07,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:50:07,543 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 00:50:08,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:50:08,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2924 states to 2419 states and 2924 transitions. [2024-11-09 00:50:08,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2419 states and 2924 transitions. [2024-11-09 00:50:08,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-09 00:50:08,234 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:50:08,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:50:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:50:08,307 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 00:50:09,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:50:09,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2930 states to 2426 states and 2930 transitions. [2024-11-09 00:50:09,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 2930 transitions. [2024-11-09 00:50:09,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-09 00:50:09,008 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:50:09,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:50:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:50:09,082 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 231 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 00:50:09,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:50:09,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2931 states to 2427 states and 2931 transitions. [2024-11-09 00:50:09,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 2931 transitions. [2024-11-09 00:50:09,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-09 00:50:09,696 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:50:09,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:50:09,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:50:10,446 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 192 proven. 59 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-09 00:50:13,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:50:13,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2972 states to 2458 states and 2972 transitions. [2024-11-09 00:50:13,948 INFO L276 IsEmpty]: Start isEmpty. Operand 2458 states and 2972 transitions. [2024-11-09 00:50:13,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-09 00:50:13,950 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:50:13,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:50:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:50:14,555 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 200 proven. 63 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-09 00:50:18,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:50:18,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3003 states to 2481 states and 3003 transitions. [2024-11-09 00:50:18,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3003 transitions. [2024-11-09 00:50:18,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-09 00:50:18,151 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:50:18,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:50:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:50:18,683 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 198 proven. 61 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 00:50:21,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:50:21,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3031 states to 2502 states and 3031 transitions. [2024-11-09 00:50:21,289 INFO L276 IsEmpty]: Start isEmpty. Operand 2502 states and 3031 transitions. [2024-11-09 00:50:21,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-09 00:50:21,291 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:50:21,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:50:21,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:50:21,757 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 198 proven. 61 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 00:50:22,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:50:22,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3038 states to 2510 states and 3038 transitions. [2024-11-09 00:50:22,907 INFO L276 IsEmpty]: Start isEmpty. Operand 2510 states and 3038 transitions. [2024-11-09 00:50:22,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-09 00:50:22,914 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:50:22,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:50:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:50:23,386 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 169 proven. 103 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-09 00:50:27,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:50:27,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3068 states to 2530 states and 3068 transitions. [2024-11-09 00:50:27,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2530 states and 3068 transitions. [2024-11-09 00:50:27,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-09 00:50:27,234 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:50:27,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:50:27,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:50:27,311 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 00:50:30,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:50:30,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 2540 states and 3080 transitions. [2024-11-09 00:50:30,250 INFO L276 IsEmpty]: Start isEmpty. Operand 2540 states and 3080 transitions. [2024-11-09 00:50:30,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-09 00:50:30,252 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:50:30,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:50:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:50:30,769 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 171 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-09 00:50:35,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:50:35,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3161 states to 2606 states and 3161 transitions. [2024-11-09 00:50:35,474 INFO L276 IsEmpty]: Start isEmpty. Operand 2606 states and 3161 transitions. [2024-11-09 00:50:35,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-09 00:50:35,476 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:50:35,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:50:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:50:35,785 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 172 proven. 106 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-09 00:50:37,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:50:37,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3178 states to 2622 states and 3178 transitions. [2024-11-09 00:50:37,147 INFO L276 IsEmpty]: Start isEmpty. Operand 2622 states and 3178 transitions. [2024-11-09 00:50:37,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-09 00:50:37,149 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:50:37,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:50:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:50:37,460 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 173 proven. 104 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-11-09 00:50:38,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:50:38,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3204 states to 2646 states and 3204 transitions. [2024-11-09 00:50:38,957 INFO L276 IsEmpty]: Start isEmpty. Operand 2646 states and 3204 transitions. [2024-11-09 00:50:38,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-09 00:50:38,958 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:50:38,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:50:38,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:50:40,069 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 230 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:50:41,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:50:41,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3275 states to 2716 states and 3275 transitions. [2024-11-09 00:50:41,901 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 3275 transitions. [2024-11-09 00:50:41,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-09 00:50:41,902 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:50:41,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:50:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:50:42,369 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-09 00:50:45,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:50:45,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3303 states to 2741 states and 3303 transitions. [2024-11-09 00:50:45,120 INFO L276 IsEmpty]: Start isEmpty. Operand 2741 states and 3303 transitions. [2024-11-09 00:50:45,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-09 00:50:45,122 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:50:45,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:50:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:50:45,500 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-09 00:50:47,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:50:47,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3307 states to 2745 states and 3307 transitions. [2024-11-09 00:50:47,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2745 states and 3307 transitions. [2024-11-09 00:50:47,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-09 00:50:47,041 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:50:47,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:50:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:50:47,774 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:50:52,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:50:52,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3380 states to 2816 states and 3380 transitions. [2024-11-09 00:50:52,044 INFO L276 IsEmpty]: Start isEmpty. Operand 2816 states and 3380 transitions. [2024-11-09 00:50:52,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-11-09 00:50:52,049 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:50:52,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:50:52,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:50:52,420 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 190 proven. 132 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-09 00:50:53,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:50:53,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 2822 states and 3385 transitions. [2024-11-09 00:50:53,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 3385 transitions. [2024-11-09 00:50:53,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-11-09 00:50:53,272 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:50:53,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:50:53,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:50:53,559 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 224 proven. 65 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-09 00:50:56,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:50:56,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3405 states to 2840 states and 3405 transitions. [2024-11-09 00:50:56,055 INFO L276 IsEmpty]: Start isEmpty. Operand 2840 states and 3405 transitions. [2024-11-09 00:50:56,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-11-09 00:50:56,058 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:50:56,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:50:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:50:56,347 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 224 proven. 65 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-09 00:50:57,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:50:57,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3409 states to 2844 states and 3409 transitions. [2024-11-09 00:50:57,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2844 states and 3409 transitions. [2024-11-09 00:50:57,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-09 00:50:57,193 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:50:57,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:50:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:50:57,290 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2024-11-09 00:50:58,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:50:58,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3481 states to 2914 states and 3481 transitions. [2024-11-09 00:50:58,214 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 3481 transitions. [2024-11-09 00:50:58,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-09 00:50:58,218 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:50:58,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:50:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:50:58,362 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-11-09 00:51:01,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:51:01,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3515 states to 2939 states and 3515 transitions. [2024-11-09 00:51:01,203 INFO L276 IsEmpty]: Start isEmpty. Operand 2939 states and 3515 transitions. [2024-11-09 00:51:01,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-11-09 00:51:01,205 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:51:01,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:51:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:01,643 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 288 proven. 59 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-09 00:51:04,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:51:04,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3527 states to 2947 states and 3527 transitions. [2024-11-09 00:51:04,340 INFO L276 IsEmpty]: Start isEmpty. Operand 2947 states and 3527 transitions. [2024-11-09 00:51:04,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-11-09 00:51:04,343 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:51:04,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:51:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:04,478 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2024-11-09 00:51:05,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:51:05,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3527 states to 2948 states and 3527 transitions. [2024-11-09 00:51:05,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2948 states and 3527 transitions. [2024-11-09 00:51:05,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-11-09 00:51:05,192 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:51:05,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:51:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:05,275 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2024-11-09 00:51:06,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:51:06,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3540 states to 2960 states and 3540 transitions. [2024-11-09 00:51:06,334 INFO L276 IsEmpty]: Start isEmpty. Operand 2960 states and 3540 transitions. [2024-11-09 00:51:06,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-11-09 00:51:06,336 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:51:06,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:51:06,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:06,577 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-09 00:51:09,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:51:09,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 2986 states and 3573 transitions. [2024-11-09 00:51:09,996 INFO L276 IsEmpty]: Start isEmpty. Operand 2986 states and 3573 transitions. [2024-11-09 00:51:09,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-11-09 00:51:09,998 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:51:09,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:51:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:10,243 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-09 00:51:11,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:51:11,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 2998 states and 3584 transitions. [2024-11-09 00:51:11,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2998 states and 3584 transitions. [2024-11-09 00:51:11,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-11-09 00:51:11,421 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:51:11,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:51:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:12,012 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-09 00:51:12,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:51:12,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3605 states to 3016 states and 3605 transitions. [2024-11-09 00:51:12,813 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3605 transitions. [2024-11-09 00:51:12,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-09 00:51:12,816 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:51:12,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:51:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:13,336 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 3 proven. 287 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-09 00:51:15,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:51:15,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3676 states to 3086 states and 3676 transitions. [2024-11-09 00:51:15,066 INFO L276 IsEmpty]: Start isEmpty. Operand 3086 states and 3676 transitions. [2024-11-09 00:51:15,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-09 00:51:15,069 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:51:15,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:51:15,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:15,419 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 3 proven. 287 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-09 00:51:16,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:51:16,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 3091 states and 3681 transitions. [2024-11-09 00:51:16,414 INFO L276 IsEmpty]: Start isEmpty. Operand 3091 states and 3681 transitions. [2024-11-09 00:51:16,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-09 00:51:16,416 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:51:16,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:51:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:51:16,453 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:51:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:51:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:51:16,747 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:51:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:51:16,957 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 146 iterations. [2024-11-09 00:51:17,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.11 12:51:17 ImpRootNode [2024-11-09 00:51:17,095 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-09 00:51:17,096 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:51:17,096 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:51:17,096 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:51:17,097 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:47:56" (3/4) ... [2024-11-09 00:51:17,097 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 00:51:17,262 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_965e987b-b293-476f-b8dc-b9915dcf4b86/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-09 00:51:17,265 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:51:17,266 INFO L158 Benchmark]: Toolchain (without parser) took 202989.70ms. Allocated memory was 167.8MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 99.0MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 489.4MB. Max. memory is 16.1GB. [2024-11-09 00:51:17,266 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 167.8MB. Free memory is still 137.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:51:17,267 INFO L158 Benchmark]: CACSL2BoogieTranslator took 709.28ms. Allocated memory is still 167.8MB. Free memory was 98.8MB in the beginning and 116.4MB in the end (delta: -17.6MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2024-11-09 00:51:17,267 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.46ms. Allocated memory is still 167.8MB. Free memory was 116.4MB in the beginning and 110.7MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 00:51:17,267 INFO L158 Benchmark]: Boogie Preprocessor took 61.86ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 105.9MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:51:17,268 INFO L158 Benchmark]: RCFGBuilder took 1671.04ms. Allocated memory was 167.8MB in the beginning and 203.4MB in the end (delta: 35.7MB). Free memory was 105.9MB in the beginning and 78.6MB in the end (delta: 27.3MB). Peak memory consumption was 76.6MB. Max. memory is 16.1GB. [2024-11-09 00:51:17,268 INFO L158 Benchmark]: CodeCheck took 200286.50ms. Allocated memory was 203.4MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 78.6MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 398.8MB. Max. memory is 16.1GB. [2024-11-09 00:51:17,268 INFO L158 Benchmark]: Witness Printer took 169.88ms. Allocated memory is still 3.2GB. Free memory was 2.7GB in the beginning and 2.7GB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-09 00:51:17,270 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: 200.1s, OverallIterations: 146, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 414694 SdHoareTripleChecker+Valid, 1150.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 410083 mSDsluCounter, 56951 SdHoareTripleChecker+Invalid, 987.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48300 mSDsCounter, 103449 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 911120 IncrementalHoareTripleChecker+Invalid, 1014569 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103449 mSolverCounterUnsat, 8651 mSDtfsCounter, 911120 mSolverCounterSat, 9.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 165424 GetRequests, 158151 SyntacticMatches, 6083 SemanticMatches, 1190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982559 ImplicationChecksByTransitivity, 136.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 1.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 34.1s InterpolantComputationTime, 24588 NumberOfCodeBlocks, 24588 NumberOfCodeBlocksAsserted, 146 NumberOfCheckSat, 24180 ConstructedInterpolants, 0 QuantifiedInterpolants, 129400 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 145 InterpolantComputations, 87 PerfectInterpolantSequences, 20194/24006 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: 420]: 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, 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=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND TRUE ((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5)) [L376] a21 = 1 [L377] a7 = 0 [L378] a17 = 0 [L379] a8 = 14 [L380] a20 = 0 [L381] return -1; VAL [\result=-1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L410] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L413] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L416] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L419] COND TRUE ((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1)) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L420] reach_error() VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 167.8MB. Free memory is still 137.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 709.28ms. Allocated memory is still 167.8MB. Free memory was 98.8MB in the beginning and 116.4MB in the end (delta: -17.6MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.46ms. Allocated memory is still 167.8MB. Free memory was 116.4MB in the beginning and 110.7MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.86ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 105.9MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1671.04ms. Allocated memory was 167.8MB in the beginning and 203.4MB in the end (delta: 35.7MB). Free memory was 105.9MB in the beginning and 78.6MB in the end (delta: 27.3MB). Peak memory consumption was 76.6MB. Max. memory is 16.1GB. * CodeCheck took 200286.50ms. Allocated memory was 203.4MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 78.6MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 398.8MB. Max. memory is 16.1GB. * Witness Printer took 169.88ms. Allocated memory is still 3.2GB. Free memory was 2.7GB in the beginning and 2.7GB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-09 00:51:17,314 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_965e987b-b293-476f-b8dc-b9915dcf4b86/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