./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f343a0e5-6b77-43c5-86f5-c42282e4ace3/bin/ukojak-rkRKPMF4O4/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f343a0e5-6b77-43c5-86f5-c42282e4ace3/bin/ukojak-rkRKPMF4O4/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f343a0e5-6b77-43c5-86f5-c42282e4ace3/bin/ukojak-rkRKPMF4O4/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f343a0e5-6b77-43c5-86f5-c42282e4ace3/bin/ukojak-rkRKPMF4O4/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label50.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f343a0e5-6b77-43c5-86f5-c42282e4ace3/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f343a0e5-6b77-43c5-86f5-c42282e4ace3/bin/ukojak-rkRKPMF4O4 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7c8c0e9a48a9f16e1776fdefc0f855c8a0d9d5ce1c74cc0228b67d8d420034c4 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 18:23:10,970 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 18:23:10,971 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 18:23:10,983 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 18:23:10,983 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 18:23:10,984 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 18:23:10,985 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 18:23:10,986 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 18:23:10,987 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 18:23:10,987 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 18:23:10,988 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 18:23:10,988 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 18:23:10,989 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 18:23:10,989 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 18:23:10,990 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 18:23:10,991 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 18:23:10,991 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 18:23:10,992 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 18:23:10,993 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 18:23:10,994 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 18:23:10,995 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 18:23:10,996 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 18:23:10,996 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 18:23:10,997 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 18:23:10,999 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 18:23:10,999 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 18:23:10,999 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 18:23:11,000 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 18:23:11,000 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 18:23:11,001 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 18:23:11,001 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 18:23:11,001 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 18:23:11,002 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 18:23:11,002 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 18:23:11,003 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 18:23:11,003 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 18:23:11,003 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 18:23:11,004 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 18:23:11,004 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 18:23:11,004 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 18:23:11,005 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 18:23:11,005 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f343a0e5-6b77-43c5-86f5-c42282e4ace3/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-12-14 18:23:11,018 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 18:23:11,019 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 18:23:11,019 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 18:23:11,019 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-12-14 18:23:11,020 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 18:23:11,020 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 18:23:11,020 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 18:23:11,020 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 18:23:11,020 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 18:23:11,020 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 18:23:11,020 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 18:23:11,021 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 18:23:11,021 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 18:23:11,021 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 18:23:11,021 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 18:23:11,021 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 18:23:11,021 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 18:23:11,021 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 18:23:11,021 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-12-14 18:23:11,021 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-12-14 18:23:11,022 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 18:23:11,022 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 18:23:11,022 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 18:23:11,022 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 18:23:11,022 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 18:23:11,022 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-12-14 18:23:11,022 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 18:23:11,023 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 18:23:11,023 INFO L138 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_f343a0e5-6b77-43c5-86f5-c42282e4ace3/bin/ukojak-rkRKPMF4O4/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_f343a0e5-6b77-43c5-86f5-c42282e4ace3/bin/ukojak-rkRKPMF4O4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7c8c0e9a48a9f16e1776fdefc0f855c8a0d9d5ce1c74cc0228b67d8d420034c4 [2022-12-14 18:23:11,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 18:23:11,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 18:23:11,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 18:23:11,221 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 18:23:11,222 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 18:23:11,222 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f343a0e5-6b77-43c5-86f5-c42282e4ace3/bin/ukojak-rkRKPMF4O4/../../sv-benchmarks/c/eca-rers2012/Problem01_label50.c [2022-12-14 18:23:13,763 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 18:23:13,981 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 18:23:13,981 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f343a0e5-6b77-43c5-86f5-c42282e4ace3/sv-benchmarks/c/eca-rers2012/Problem01_label50.c [2022-12-14 18:23:13,989 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f343a0e5-6b77-43c5-86f5-c42282e4ace3/bin/ukojak-rkRKPMF4O4/data/4dbdcae4e/dd12e9251afe4e829a52ada7233ec5eb/FLAG068e74c31 [2022-12-14 18:23:14,000 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f343a0e5-6b77-43c5-86f5-c42282e4ace3/bin/ukojak-rkRKPMF4O4/data/4dbdcae4e/dd12e9251afe4e829a52ada7233ec5eb [2022-12-14 18:23:14,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 18:23:14,003 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 18:23:14,004 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 18:23:14,004 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 18:23:14,006 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 18:23:14,007 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 06:23:14" (1/1) ... [2022-12-14 18:23:14,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52af165e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:23:14, skipping insertion in model container [2022-12-14 18:23:14,008 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 06:23:14" (1/1) ... [2022-12-14 18:23:14,013 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 18:23:14,041 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 18:23:14,235 WARN L237 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_f343a0e5-6b77-43c5-86f5-c42282e4ace3/sv-benchmarks/c/eca-rers2012/Problem01_label50.c[15378,15391] [2022-12-14 18:23:14,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 18:23:14,274 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 18:23:14,321 WARN L237 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_f343a0e5-6b77-43c5-86f5-c42282e4ace3/sv-benchmarks/c/eca-rers2012/Problem01_label50.c[15378,15391] [2022-12-14 18:23:14,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 18:23:14,344 INFO L208 MainTranslator]: Completed translation [2022-12-14 18:23:14,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:23:14 WrapperNode [2022-12-14 18:23:14,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 18:23:14,345 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 18:23:14,345 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 18:23:14,345 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 18:23:14,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:23:14" (1/1) ... [2022-12-14 18:23:14,361 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:23:14" (1/1) ... [2022-12-14 18:23:14,389 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2022-12-14 18:23:14,390 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 18:23:14,390 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 18:23:14,390 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 18:23:14,390 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 18:23:14,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:23:14" (1/1) ... [2022-12-14 18:23:14,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:23:14" (1/1) ... [2022-12-14 18:23:14,401 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:23:14" (1/1) ... [2022-12-14 18:23:14,401 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:23:14" (1/1) ... [2022-12-14 18:23:14,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:23:14" (1/1) ... [2022-12-14 18:23:14,418 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:23:14" (1/1) ... [2022-12-14 18:23:14,422 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:23:14" (1/1) ... [2022-12-14 18:23:14,425 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:23:14" (1/1) ... [2022-12-14 18:23:14,429 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 18:23:14,430 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 18:23:14,430 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 18:23:14,430 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 18:23:14,431 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:23:14" (1/1) ... [2022-12-14 18:23:14,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 18:23:14,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f343a0e5-6b77-43c5-86f5-c42282e4ace3/bin/ukojak-rkRKPMF4O4/z3 [2022-12-14 18:23:14,455 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f343a0e5-6b77-43c5-86f5-c42282e4ace3/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-12-14 18:23:14,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f343a0e5-6b77-43c5-86f5-c42282e4ace3/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-12-14 18:23:14,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 18:23:14,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 18:23:14,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 18:23:14,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 18:23:14,552 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 18:23:14,554 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 18:23:15,244 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 18:23:15,403 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 18:23:15,403 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 18:23:15,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 06:23:15 BoogieIcfgContainer [2022-12-14 18:23:15,406 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 18:23:15,407 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-12-14 18:23:15,407 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-12-14 18:23:15,416 INFO L275 PluginConnector]: CodeCheck initialized [2022-12-14 18:23:15,417 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 06:23:15" (1/1) ... [2022-12-14 18:23:15,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 18:23:15,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:15,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2022-12-14 18:23:15,471 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2022-12-14 18:23:15,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-14 18:23:15,474 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:15,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:15,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:23:16,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:16,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 145 states and 237 transitions. [2022-12-14 18:23:16,070 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 237 transitions. [2022-12-14 18:23:16,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-14 18:23:16,072 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:16,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:16,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:23:16,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:16,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 146 states and 238 transitions. [2022-12-14 18:23:16,365 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 238 transitions. [2022-12-14 18:23:16,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-12-14 18:23:16,366 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:16,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:16,432 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:23:16,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:16,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 151 states and 245 transitions. [2022-12-14 18:23:16,482 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 245 transitions. [2022-12-14 18:23:16,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-12-14 18:23:16,483 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:16,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:16,606 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:23:17,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:17,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 221 states and 317 transitions. [2022-12-14 18:23:17,037 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 317 transitions. [2022-12-14 18:23:17,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-14 18:23:17,038 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:17,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:17,127 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:23:17,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:17,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 233 states and 332 transitions. [2022-12-14 18:23:17,300 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 332 transitions. [2022-12-14 18:23:17,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-12-14 18:23:17,302 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:17,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:17,446 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:23:17,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:17,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 246 states and 351 transitions. [2022-12-14 18:23:17,748 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 351 transitions. [2022-12-14 18:23:17,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-12-14 18:23:17,750 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:17,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:17,848 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:23:17,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:17,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 251 states and 356 transitions. [2022-12-14 18:23:17,959 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 356 transitions. [2022-12-14 18:23:17,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-12-14 18:23:17,959 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:17,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:18,024 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 18:23:18,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:18,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 264 states and 371 transitions. [2022-12-14 18:23:18,220 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 371 transitions. [2022-12-14 18:23:18,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-12-14 18:23:18,221 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:18,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:18,285 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:23:18,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:18,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 284 states and 398 transitions. [2022-12-14 18:23:18,625 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 398 transitions. [2022-12-14 18:23:18,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-12-14 18:23:18,626 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:18,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:18,697 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 18:23:18,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:18,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 292 states and 413 transitions. [2022-12-14 18:23:18,938 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 413 transitions. [2022-12-14 18:23:18,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-12-14 18:23:18,938 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:18,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:18,974 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:23:19,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:19,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 308 states and 433 transitions. [2022-12-14 18:23:19,223 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 433 transitions. [2022-12-14 18:23:19,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-12-14 18:23:19,224 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:19,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:19,296 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 18:23:19,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:19,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 309 states and 436 transitions. [2022-12-14 18:23:19,431 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 436 transitions. [2022-12-14 18:23:19,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-12-14 18:23:19,432 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:19,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:19,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:19,496 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 18:23:19,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:19,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 321 states and 449 transitions. [2022-12-14 18:23:19,752 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 449 transitions. [2022-12-14 18:23:19,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-12-14 18:23:19,753 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:19,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:19,816 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 18:23:19,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:19,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 326 states and 454 transitions. [2022-12-14 18:23:19,927 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 454 transitions. [2022-12-14 18:23:19,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-12-14 18:23:19,927 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:19,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:19,965 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 18:23:20,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:20,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 327 states and 457 transitions. [2022-12-14 18:23:20,125 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 457 transitions. [2022-12-14 18:23:20,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-12-14 18:23:20,125 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:20,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:20,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:20,159 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 18:23:20,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:20,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 336 states and 468 transitions. [2022-12-14 18:23:20,378 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 468 transitions. [2022-12-14 18:23:20,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-12-14 18:23:20,379 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:20,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:20,428 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 18:23:20,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:20,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 341 states and 474 transitions. [2022-12-14 18:23:20,583 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 474 transitions. [2022-12-14 18:23:20,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-14 18:23:20,584 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:20,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:20,643 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 18:23:20,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:20,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 349 states and 483 transitions. [2022-12-14 18:23:20,775 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 483 transitions. [2022-12-14 18:23:20,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-14 18:23:20,776 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:20,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:20,875 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 18:23:21,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:21,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 351 states and 486 transitions. [2022-12-14 18:23:21,016 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 486 transitions. [2022-12-14 18:23:21,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-12-14 18:23:21,017 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:21,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:21,078 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:23:21,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:21,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 365 states and 502 transitions. [2022-12-14 18:23:21,286 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 502 transitions. [2022-12-14 18:23:21,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-12-14 18:23:21,286 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:21,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:21,388 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:23:21,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:21,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 372 states and 509 transitions. [2022-12-14 18:23:21,606 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 509 transitions. [2022-12-14 18:23:21,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-12-14 18:23:21,607 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:21,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:21,679 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:23:21,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:21,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 378 states and 515 transitions. [2022-12-14 18:23:21,738 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 515 transitions. [2022-12-14 18:23:21,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-12-14 18:23:21,739 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:21,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:21,807 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 18:23:21,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:21,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 382 states and 519 transitions. [2022-12-14 18:23:21,887 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 519 transitions. [2022-12-14 18:23:21,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-12-14 18:23:21,888 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:21,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:21,984 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:23:22,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:22,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 388 states and 525 transitions. [2022-12-14 18:23:22,139 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 525 transitions. [2022-12-14 18:23:22,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-12-14 18:23:22,140 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:22,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:22,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:22,183 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:23:22,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:22,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 402 states and 541 transitions. [2022-12-14 18:23:22,252 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 541 transitions. [2022-12-14 18:23:22,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-12-14 18:23:22,253 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:22,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:22,350 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:23:23,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:23,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 441 states and 591 transitions. [2022-12-14 18:23:23,039 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 591 transitions. [2022-12-14 18:23:23,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-14 18:23:23,040 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:23,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:23,101 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:23:23,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:23,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 469 states and 623 transitions. [2022-12-14 18:23:23,628 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 623 transitions. [2022-12-14 18:23:23,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-12-14 18:23:23,629 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:23,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:23,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:23,750 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:23:24,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:24,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 508 states and 684 transitions. [2022-12-14 18:23:24,547 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 684 transitions. [2022-12-14 18:23:24,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-12-14 18:23:24,547 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:24,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:24,608 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:23:24,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:24,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 515 states and 692 transitions. [2022-12-14 18:23:24,880 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 692 transitions. [2022-12-14 18:23:24,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-12-14 18:23:24,881 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:24,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:24,947 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:23:25,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:25,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 542 states and 726 transitions. [2022-12-14 18:23:25,439 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 726 transitions. [2022-12-14 18:23:25,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-12-14 18:23:25,440 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:25,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:25,479 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:23:25,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:25,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 553 states and 739 transitions. [2022-12-14 18:23:25,865 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 739 transitions. [2022-12-14 18:23:25,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-14 18:23:25,865 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:25,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:25,908 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 18:23:26,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:26,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 586 states and 779 transitions. [2022-12-14 18:23:26,506 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 779 transitions. [2022-12-14 18:23:26,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-14 18:23:26,507 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:26,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:26,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:26,544 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 18:23:26,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:26,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 590 states and 783 transitions. [2022-12-14 18:23:26,717 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 783 transitions. [2022-12-14 18:23:26,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-12-14 18:23:26,717 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:26,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:26,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:26,753 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-14 18:23:26,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:26,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 596 states and 789 transitions. [2022-12-14 18:23:26,790 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 789 transitions. [2022-12-14 18:23:26,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-12-14 18:23:26,791 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:26,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:26,828 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 18:23:26,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:26,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 609 states and 802 transitions. [2022-12-14 18:23:26,885 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 802 transitions. [2022-12-14 18:23:26,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-12-14 18:23:26,885 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:26,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:26,945 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 18:23:26,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:26,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 610 states and 803 transitions. [2022-12-14 18:23:26,971 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 803 transitions. [2022-12-14 18:23:26,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-12-14 18:23:26,972 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:26,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:27,078 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:23:27,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:27,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 620 states and 817 transitions. [2022-12-14 18:23:27,717 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 817 transitions. [2022-12-14 18:23:27,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-12-14 18:23:27,718 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:27,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:27,784 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:23:27,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:27,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 625 states and 822 transitions. [2022-12-14 18:23:27,969 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 822 transitions. [2022-12-14 18:23:27,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-12-14 18:23:27,970 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:27,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:27,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:28,019 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-14 18:23:28,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:28,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 638 states and 836 transitions. [2022-12-14 18:23:28,198 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 836 transitions. [2022-12-14 18:23:28,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-12-14 18:23:28,199 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:28,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:28,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:28,246 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 18:23:28,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:28,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 644 states and 845 transitions. [2022-12-14 18:23:28,440 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 845 transitions. [2022-12-14 18:23:28,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-12-14 18:23:28,440 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:28,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:28,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:28,478 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 18:23:28,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:28,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 653 states and 858 transitions. [2022-12-14 18:23:28,662 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 858 transitions. [2022-12-14 18:23:28,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-12-14 18:23:28,662 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:28,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:28,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:28,720 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-12-14 18:23:29,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:29,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 737 states and 945 transitions. [2022-12-14 18:23:29,253 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 945 transitions. [2022-12-14 18:23:29,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-12-14 18:23:29,254 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:29,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:29,307 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 18:23:29,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:29,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 752 states and 958 transitions. [2022-12-14 18:23:29,486 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 958 transitions. [2022-12-14 18:23:29,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-12-14 18:23:29,486 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:29,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:29,552 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 18:23:29,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:29,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 766 states and 975 transitions. [2022-12-14 18:23:29,860 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 975 transitions. [2022-12-14 18:23:29,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-12-14 18:23:29,861 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:29,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:29,977 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:23:31,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:31,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 811 states and 1034 transitions. [2022-12-14 18:23:31,493 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1034 transitions. [2022-12-14 18:23:31,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-12-14 18:23:31,493 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:31,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:31,576 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:23:31,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:31,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 821 states and 1050 transitions. [2022-12-14 18:23:31,975 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1050 transitions. [2022-12-14 18:23:31,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-12-14 18:23:31,976 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:31,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:32,016 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 18:23:32,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:32,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 828 states and 1061 transitions. [2022-12-14 18:23:32,474 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1061 transitions. [2022-12-14 18:23:32,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-12-14 18:23:32,482 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:32,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:32,549 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 18:23:32,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:32,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 833 states and 1066 transitions. [2022-12-14 18:23:32,794 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1066 transitions. [2022-12-14 18:23:32,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-12-14 18:23:32,795 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:32,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:32,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:32,881 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 18:23:33,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:33,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 844 states and 1079 transitions. [2022-12-14 18:23:33,399 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1079 transitions. [2022-12-14 18:23:33,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-12-14 18:23:33,400 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:33,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:33,442 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 18:23:33,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:33,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 852 states and 1088 transitions. [2022-12-14 18:23:33,496 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1088 transitions. [2022-12-14 18:23:33,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-12-14 18:23:33,497 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:33,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:33,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:33,574 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-14 18:23:33,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:33,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 900 states and 1139 transitions. [2022-12-14 18:23:33,985 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1139 transitions. [2022-12-14 18:23:33,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-12-14 18:23:33,986 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:33,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:34,063 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-14 18:23:34,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:34,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 908 states and 1148 transitions. [2022-12-14 18:23:34,196 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1148 transitions. [2022-12-14 18:23:34,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-12-14 18:23:34,197 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:34,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:34,238 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 18:23:34,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:34,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 913 states and 1154 transitions. [2022-12-14 18:23:34,281 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1154 transitions. [2022-12-14 18:23:34,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-12-14 18:23:34,282 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:34,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:34,516 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:23:36,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:36,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1053 states and 1304 transitions. [2022-12-14 18:23:36,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1304 transitions. [2022-12-14 18:23:36,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-12-14 18:23:36,401 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:36,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:36,476 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-12-14 18:23:36,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:36,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1054 states and 1304 transitions. [2022-12-14 18:23:36,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1304 transitions. [2022-12-14 18:23:36,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-12-14 18:23:36,545 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:36,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:36,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:36,676 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:23:37,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:37,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1093 states and 1377 transitions. [2022-12-14 18:23:37,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1377 transitions. [2022-12-14 18:23:37,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-12-14 18:23:37,963 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:37,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:38,009 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 18:23:38,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:38,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1107 states and 1396 transitions. [2022-12-14 18:23:38,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1396 transitions. [2022-12-14 18:23:38,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-12-14 18:23:38,597 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:38,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:38,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:38,647 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-12-14 18:23:39,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:39,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1134 states and 1428 transitions. [2022-12-14 18:23:39,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1428 transitions. [2022-12-14 18:23:39,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-12-14 18:23:39,392 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:39,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:39,461 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:23:40,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:40,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1156 states and 1453 transitions. [2022-12-14 18:23:40,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1453 transitions. [2022-12-14 18:23:40,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-12-14 18:23:40,297 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:40,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:40,344 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:23:40,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:40,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1160 states and 1456 transitions. [2022-12-14 18:23:40,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1456 transitions. [2022-12-14 18:23:40,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-12-14 18:23:40,569 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:40,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:40,635 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 18:23:41,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:41,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1186 states and 1493 transitions. [2022-12-14 18:23:41,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1493 transitions. [2022-12-14 18:23:41,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-12-14 18:23:41,784 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:41,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:41,872 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 18:23:42,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:42,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1191 states and 1497 transitions. [2022-12-14 18:23:42,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1497 transitions. [2022-12-14 18:23:42,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-12-14 18:23:42,086 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:42,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:42,151 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 18:23:42,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:42,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1204 states and 1512 transitions. [2022-12-14 18:23:42,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1512 transitions. [2022-12-14 18:23:42,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-12-14 18:23:42,471 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:42,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:42,768 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:23:43,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:43,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1275 states and 1583 transitions. [2022-12-14 18:23:43,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1583 transitions. [2022-12-14 18:23:43,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-12-14 18:23:43,616 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:43,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:43,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:43,662 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 18:23:43,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:43,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1283 states and 1591 transitions. [2022-12-14 18:23:43,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1591 transitions. [2022-12-14 18:23:43,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-12-14 18:23:43,851 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:43,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:43,897 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 18:23:44,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:44,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1287 states and 1594 transitions. [2022-12-14 18:23:44,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1594 transitions. [2022-12-14 18:23:44,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-12-14 18:23:44,146 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:44,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:44,314 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-12-14 18:23:44,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:44,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1295 states and 1602 transitions. [2022-12-14 18:23:44,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1602 transitions. [2022-12-14 18:23:44,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-12-14 18:23:44,587 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:44,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:44,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:44,645 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-12-14 18:23:45,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:45,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1320 states and 1635 transitions. [2022-12-14 18:23:45,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1635 transitions. [2022-12-14 18:23:45,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-12-14 18:23:45,852 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:45,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:45,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:45,927 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-12-14 18:23:46,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:46,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1334 states and 1649 transitions. [2022-12-14 18:23:46,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1649 transitions. [2022-12-14 18:23:46,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-12-14 18:23:46,376 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:46,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:46,466 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 18:23:47,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:47,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1359 states and 1677 transitions. [2022-12-14 18:23:47,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 1677 transitions. [2022-12-14 18:23:47,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-12-14 18:23:47,388 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:47,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:47,480 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 94 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:23:47,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:47,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1363 states and 1685 transitions. [2022-12-14 18:23:47,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1685 transitions. [2022-12-14 18:23:47,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-14 18:23:47,803 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:47,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:47,877 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-14 18:23:48,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:48,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1372 states and 1698 transitions. [2022-12-14 18:23:48,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1698 transitions. [2022-12-14 18:23:48,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-14 18:23:48,490 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:48,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:48,539 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-14 18:23:49,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:49,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1709 states to 1381 states and 1709 transitions. [2022-12-14 18:23:49,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1709 transitions. [2022-12-14 18:23:49,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-14 18:23:49,028 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:49,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:49,077 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-14 18:23:49,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:49,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1386 states and 1716 transitions. [2022-12-14 18:23:49,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1716 transitions. [2022-12-14 18:23:49,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-14 18:23:49,352 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:49,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:49,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:49,404 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-14 18:23:50,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:50,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1399 states and 1731 transitions. [2022-12-14 18:23:50,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 1731 transitions. [2022-12-14 18:23:50,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-14 18:23:50,042 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:50,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:50,094 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-14 18:23:50,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:50,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1403 states and 1734 transitions. [2022-12-14 18:23:50,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 1734 transitions. [2022-12-14 18:23:50,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-12-14 18:23:50,413 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:50,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:50,489 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-12-14 18:23:50,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:50,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1411 states and 1742 transitions. [2022-12-14 18:23:50,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1742 transitions. [2022-12-14 18:23:50,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-12-14 18:23:50,715 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:50,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:50,791 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-12-14 18:23:51,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:51,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1415 states and 1745 transitions. [2022-12-14 18:23:51,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 1745 transitions. [2022-12-14 18:23:51,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-12-14 18:23:51,072 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:51,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:51,248 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 18:23:52,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:52,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1428 states and 1766 transitions. [2022-12-14 18:23:52,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1766 transitions. [2022-12-14 18:23:52,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-12-14 18:23:52,565 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:52,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:52,657 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 18:23:52,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:52,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1433 states and 1771 transitions. [2022-12-14 18:23:52,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 1771 transitions. [2022-12-14 18:23:52,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-12-14 18:23:52,976 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:52,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:53,077 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-12-14 18:23:53,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:53,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1447 states and 1785 transitions. [2022-12-14 18:23:53,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 1785 transitions. [2022-12-14 18:23:53,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-12-14 18:23:53,619 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:53,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:53,688 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-14 18:23:54,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:54,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1472 states and 1813 transitions. [2022-12-14 18:23:54,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1472 states and 1813 transitions. [2022-12-14 18:23:54,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-12-14 18:23:54,318 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:54,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:54,370 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-12-14 18:23:54,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:54,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 1477 states and 1819 transitions. [2022-12-14 18:23:54,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 1819 transitions. [2022-12-14 18:23:54,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-12-14 18:23:54,780 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:54,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:54,909 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-12-14 18:23:55,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:55,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1485 states and 1829 transitions. [2022-12-14 18:23:55,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 1829 transitions. [2022-12-14 18:23:55,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-12-14 18:23:55,275 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:55,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:55,370 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-12-14 18:23:55,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:55,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1490 states and 1833 transitions. [2022-12-14 18:23:55,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1833 transitions. [2022-12-14 18:23:55,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-12-14 18:23:55,554 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:55,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:55,680 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-12-14 18:23:56,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:56,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1495 states and 1838 transitions. [2022-12-14 18:23:56,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1838 transitions. [2022-12-14 18:23:56,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-12-14 18:23:56,053 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:56,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:56,185 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-12-14 18:23:56,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:56,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1843 states to 1500 states and 1843 transitions. [2022-12-14 18:23:56,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1843 transitions. [2022-12-14 18:23:56,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-12-14 18:23:56,524 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:56,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:56,593 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 18:23:57,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:57,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1523 states and 1870 transitions. [2022-12-14 18:23:57,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 1870 transitions. [2022-12-14 18:23:57,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-12-14 18:23:57,168 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:57,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:57,255 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 18:23:57,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:57,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1528 states and 1875 transitions. [2022-12-14 18:23:57,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 1875 transitions. [2022-12-14 18:23:57,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-12-14 18:23:57,518 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:57,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:57,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:57,576 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 18:23:58,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:58,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1540 states and 1891 transitions. [2022-12-14 18:23:58,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 1891 transitions. [2022-12-14 18:23:58,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-12-14 18:23:58,086 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:58,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:58,140 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-14 18:23:59,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:59,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1569 states and 1922 transitions. [2022-12-14 18:23:59,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 1922 transitions. [2022-12-14 18:23:59,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-12-14 18:23:59,250 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:59,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:59,305 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-14 18:23:59,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:23:59,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1573 states and 1925 transitions. [2022-12-14 18:23:59,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 1925 transitions. [2022-12-14 18:23:59,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-12-14 18:23:59,602 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:23:59,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:23:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:23:59,654 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-12-14 18:24:00,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:24:00,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1586 states and 1941 transitions. [2022-12-14 18:24:00,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 1941 transitions. [2022-12-14 18:24:00,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-12-14 18:24:00,712 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:24:00,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:24:00,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:24:00,782 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-12-14 18:24:01,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:24:01,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1591 states and 1946 transitions. [2022-12-14 18:24:01,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 1946 transitions. [2022-12-14 18:24:01,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-12-14 18:24:01,083 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:24:01,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:24:01,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:24:01,138 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-12-14 18:24:01,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:24:01,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1623 states and 1978 transitions. [2022-12-14 18:24:01,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 1978 transitions. [2022-12-14 18:24:01,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-12-14 18:24:01,986 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:24:01,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:24:02,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:24:02,043 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-12-14 18:24:02,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:24:02,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1635 states and 1990 transitions. [2022-12-14 18:24:02,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 1990 transitions. [2022-12-14 18:24:02,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-12-14 18:24:02,551 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:24:02,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:24:02,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:24:02,694 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-12-14 18:24:03,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:24:03,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1644 states and 1999 transitions. [2022-12-14 18:24:03,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 1999 transitions. [2022-12-14 18:24:03,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-12-14 18:24:03,167 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:24:03,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:24:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:24:03,252 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-12-14 18:24:03,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:24:03,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 1657 states and 2012 transitions. [2022-12-14 18:24:03,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2012 transitions. [2022-12-14 18:24:03,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-12-14 18:24:03,712 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:24:03,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:24:03,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:24:03,766 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-12-14 18:24:05,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:24:05,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2028 states to 1669 states and 2028 transitions. [2022-12-14 18:24:05,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2028 transitions. [2022-12-14 18:24:05,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-12-14 18:24:05,185 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:24:05,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:24:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:24:05,345 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 109 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:24:06,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:24:06,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 1703 states and 2063 transitions. [2022-12-14 18:24:06,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 2063 transitions. [2022-12-14 18:24:06,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-12-14 18:24:06,159 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:24:06,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:24:06,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:24:06,217 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-12-14 18:24:06,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:24:06,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2068 states to 1708 states and 2068 transitions. [2022-12-14 18:24:06,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2068 transitions. [2022-12-14 18:24:06,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-12-14 18:24:06,375 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:24:06,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:24:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:24:07,112 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 133 proven. 46 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 18:24:10,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:24:10,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 1803 states and 2202 transitions. [2022-12-14 18:24:10,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2202 transitions. [2022-12-14 18:24:10,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-12-14 18:24:10,932 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:24:10,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:24:10,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:24:11,226 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 133 proven. 46 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 18:24:12,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:24:12,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2222 states to 1821 states and 2222 transitions. [2022-12-14 18:24:12,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2222 transitions. [2022-12-14 18:24:12,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-12-14 18:24:12,407 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:24:12,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:24:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:24:12,680 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 133 proven. 46 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 18:24:13,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:24:13,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 1832 states and 2237 transitions. [2022-12-14 18:24:13,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 2237 transitions. [2022-12-14 18:24:13,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-12-14 18:24:13,772 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:24:13,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:24:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:24:13,972 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 133 proven. 46 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 18:24:14,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:24:14,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 1837 states and 2243 transitions. [2022-12-14 18:24:14,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2243 transitions. [2022-12-14 18:24:14,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-12-14 18:24:14,484 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:24:14,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:24:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:24:14,665 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 133 proven. 46 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 18:24:15,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:24:15,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2247 states to 1842 states and 2247 transitions. [2022-12-14 18:24:15,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2247 transitions. [2022-12-14 18:24:15,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-12-14 18:24:15,192 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:24:15,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:24:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:24:15,250 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-14 18:24:15,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:24:15,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2268 states to 1865 states and 2268 transitions. [2022-12-14 18:24:15,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1865 states and 2268 transitions. [2022-12-14 18:24:15,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-12-14 18:24:15,826 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:24:15,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:24:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:24:15,896 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-12-14 18:24:16,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:24:16,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 1877 states and 2280 transitions. [2022-12-14 18:24:16,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2280 transitions. [2022-12-14 18:24:16,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-12-14 18:24:16,271 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:24:16,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:24:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:24:16,531 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 18:24:17,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:24:17,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2298 states to 1893 states and 2298 transitions. [2022-12-14 18:24:17,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2298 transitions. [2022-12-14 18:24:17,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-12-14 18:24:17,447 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:24:17,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:24:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:24:17,612 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 18:24:19,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:24:19,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2334 states to 1924 states and 2334 transitions. [2022-12-14 18:24:19,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 2334 transitions. [2022-12-14 18:24:19,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-12-14 18:24:19,954 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:24:19,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:24:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:24:20,071 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 18:24:20,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:24:20,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2342 states to 1933 states and 2342 transitions. [2022-12-14 18:24:20,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1933 states and 2342 transitions. [2022-12-14 18:24:20,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-12-14 18:24:20,510 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:24:20,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:24:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:24:20,565 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-12-14 18:24:20,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:24:20,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 1957 states and 2368 transitions. [2022-12-14 18:24:20,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1957 states and 2368 transitions. [2022-12-14 18:24:20,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-12-14 18:24:20,938 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:24:20,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:24:20,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:24:21,277 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 145 proven. 46 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 18:24:24,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:24:24,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2424 states to 1985 states and 2424 transitions. [2022-12-14 18:24:24,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 2424 transitions. [2022-12-14 18:24:24,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-12-14 18:24:24,807 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:24:24,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:24:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:24:25,003 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 145 proven. 46 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 18:24:28,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:24:28,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2466 states to 2011 states and 2466 transitions. [2022-12-14 18:24:28,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 2466 transitions. [2022-12-14 18:24:28,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-12-14 18:24:28,307 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:24:28,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:24:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:24:28,510 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 145 proven. 46 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 18:24:29,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:24:29,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2016 states and 2472 transitions. [2022-12-14 18:24:29,079 INFO L276 IsEmpty]: Start isEmpty. Operand 2016 states and 2472 transitions. [2022-12-14 18:24:29,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-12-14 18:24:29,081 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:24:29,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:24:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:24:29,304 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 145 proven. 46 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 18:24:29,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:24:29,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2021 states and 2476 transitions. [2022-12-14 18:24:29,916 INFO L276 IsEmpty]: Start isEmpty. Operand 2021 states and 2476 transitions. [2022-12-14 18:24:29,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-12-14 18:24:29,917 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:24:29,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:24:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:24:30,115 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 145 proven. 46 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 18:24:31,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:24:31,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2485 states to 2029 states and 2485 transitions. [2022-12-14 18:24:31,087 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 2485 transitions. [2022-12-14 18:24:31,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-12-14 18:24:31,088 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:24:31,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:24:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:24:31,190 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 18:24:32,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:24:32,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2040 states and 2500 transitions. [2022-12-14 18:24:32,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 2500 transitions. [2022-12-14 18:24:32,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-12-14 18:24:32,650 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:24:32,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:24:32,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:24:32,749 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 18:24:33,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:24:33,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2046 states and 2511 transitions. [2022-12-14 18:24:33,577 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 2511 transitions. [2022-12-14 18:24:33,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-12-14 18:24:33,578 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:24:33,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:24:33,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:24:33,678 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 18:24:34,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:24:34,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2512 states to 2047 states and 2512 transitions. [2022-12-14 18:24:34,116 INFO L276 IsEmpty]: Start isEmpty. Operand 2047 states and 2512 transitions. [2022-12-14 18:24:34,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-12-14 18:24:34,118 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:24:34,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:24:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:24:34,219 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-14 18:24:34,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:24:34,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2516 states to 2052 states and 2516 transitions. [2022-12-14 18:24:34,744 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 2516 transitions. [2022-12-14 18:24:34,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-12-14 18:24:34,745 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:24:34,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:24:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 18:24:34,769 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 18:24:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 18:24:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 18:24:34,930 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 18:24:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 18:24:35,008 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 122 iterations. [2022-12-14 18:24:35,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 14.12 06:24:35 ImpRootNode [2022-12-14 18:24:35,165 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-12-14 18:24:35,165 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 18:24:35,165 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 18:24:35,166 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 18:24:35,166 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 06:23:15" (3/4) ... [2022-12-14 18:24:35,168 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 18:24:35,292 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f343a0e5-6b77-43c5-86f5-c42282e4ace3/bin/ukojak-rkRKPMF4O4/witness.graphml [2022-12-14 18:24:35,292 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 18:24:35,293 INFO L158 Benchmark]: Toolchain (without parser) took 81290.23ms. Allocated memory was 148.9MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 116.5MB in the beginning and 1.0GB in the end (delta: -914.2MB). Peak memory consumption was 323.8MB. Max. memory is 16.1GB. [2022-12-14 18:24:35,293 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 148.9MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 18:24:35,293 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.56ms. Allocated memory is still 148.9MB. Free memory was 116.5MB in the beginning and 89.1MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-14 18:24:35,294 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.06ms. Allocated memory is still 148.9MB. Free memory was 89.1MB in the beginning and 83.3MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-14 18:24:35,294 INFO L158 Benchmark]: Boogie Preprocessor took 39.44ms. Allocated memory is still 148.9MB. Free memory was 83.3MB in the beginning and 79.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 18:24:35,294 INFO L158 Benchmark]: RCFGBuilder took 975.93ms. Allocated memory was 148.9MB in the beginning and 182.5MB in the end (delta: 33.6MB). Free memory was 78.7MB in the beginning and 124.0MB in the end (delta: -45.2MB). Peak memory consumption was 45.2MB. Max. memory is 16.1GB. [2022-12-14 18:24:35,294 INFO L158 Benchmark]: CodeCheck took 79758.16ms. Allocated memory was 182.5MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 124.0MB in the beginning and 1.0GB in the end (delta: -924.7MB). Peak memory consumption was 277.0MB. Max. memory is 16.1GB. [2022-12-14 18:24:35,295 INFO L158 Benchmark]: Witness Printer took 127.22ms. Allocated memory is still 1.4GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-14 18:24:35,296 INFO L339 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: 79.6s, OverallIterations: 122, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 272369 SdHoareTripleChecker+Valid, 498.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 268526 mSDsluCounter, 41676 SdHoareTripleChecker+Invalid, 428.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35371 mSDsCounter, 73647 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 597908 IncrementalHoareTripleChecker+Invalid, 671555 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73647 mSolverCounterUnsat, 6305 mSDtfsCounter, 597908 mSolverCounterSat, 4.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 118459 GetRequests, 115131 SyntacticMatches, 2376 SemanticMatches, 952 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525968 ImplicationChecksByTransitivity, 55.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.5s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 17731 NumberOfCodeBlocks, 17731 NumberOfCodeBlocksAsserted, 122 NumberOfCheckSat, 17411 ConstructedInterpolants, 0 QuantifiedInterpolants, 59568 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 121 InterpolantComputations, 108 PerfectInterpolantSequences, 12567/13174 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 423]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int d= 4; [L19] int e= 5; [L20] int f= 6; [L21] int c= 3; [L22] int b= 2; [L25] int u = 21; [L26] int v = 22; [L27] int w = 23; [L28] int x = 24; [L29] int y = 25; [L30] int z = 26; [L32] int a17 = 1; [L33] int a7 = 0; [L34] int a20 = 1; [L35] int a8 = 15; [L36] int a12 = 8; [L37] int a16 = 5; [L38] int a21 = 1; [L590] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, output=-1, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=3, \result=21, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, 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 [\old(input)=4, \result=21, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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 [\old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=4, \result=26, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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 [\old(input)=2, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=2, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=2, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=2, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=2, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=2, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=2, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(input)=2, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(input)=2, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND TRUE ((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8)) [L95] a7 = 0 [L96] a20 = 1 [L97] a8 = 14 [L98] a16 = 4 [L99] a21 = 1 [L100] a17 = 0 [L101] return -1; VAL [\old(input)=2, \result=-1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L410] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L413] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L416] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L419] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L422] COND TRUE ((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L423] reach_error() VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, 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.15ms. Allocated memory is still 148.9MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 340.56ms. Allocated memory is still 148.9MB. Free memory was 116.5MB in the beginning and 89.1MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.06ms. Allocated memory is still 148.9MB. Free memory was 89.1MB in the beginning and 83.3MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.44ms. Allocated memory is still 148.9MB. Free memory was 83.3MB in the beginning and 79.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 975.93ms. Allocated memory was 148.9MB in the beginning and 182.5MB in the end (delta: 33.6MB). Free memory was 78.7MB in the beginning and 124.0MB in the end (delta: -45.2MB). Peak memory consumption was 45.2MB. Max. memory is 16.1GB. * CodeCheck took 79758.16ms. Allocated memory was 182.5MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 124.0MB in the beginning and 1.0GB in the end (delta: -924.7MB). Peak memory consumption was 277.0MB. Max. memory is 16.1GB. * Witness Printer took 127.22ms. Allocated memory is still 1.4GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2022-12-14 18:24:35,314 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f343a0e5-6b77-43c5-86f5-c42282e4ace3/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE