./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label57.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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_2ac3f673-2d19-4b33-97b6-d3eed202e63a/bin/ukojak-rkRKPMF4O4/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ac3f673-2d19-4b33-97b6-d3eed202e63a/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_2ac3f673-2d19-4b33-97b6-d3eed202e63a/bin/ukojak-rkRKPMF4O4/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ac3f673-2d19-4b33-97b6-d3eed202e63a/bin/ukojak-rkRKPMF4O4/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label57.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ac3f673-2d19-4b33-97b6-d3eed202e63a/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_2ac3f673-2d19-4b33-97b6-d3eed202e63a/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 0128e00bf508dfedd424bfda3d692f75ea10f378731858e87047f02277f2ca04 --- 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-15 01:46:25,911 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-15 01:46:25,913 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-15 01:46:25,931 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-15 01:46:25,931 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-15 01:46:25,932 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-15 01:46:25,933 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-15 01:46:25,935 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-15 01:46:25,936 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-15 01:46:25,937 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-15 01:46:25,938 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-15 01:46:25,939 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-15 01:46:25,939 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-15 01:46:25,940 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-15 01:46:25,941 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-15 01:46:25,942 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-15 01:46:25,943 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-15 01:46:25,943 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-15 01:46:25,945 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-15 01:46:25,947 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-15 01:46:25,948 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-15 01:46:25,949 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-15 01:46:25,950 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-15 01:46:25,951 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-15 01:46:25,954 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-15 01:46:25,955 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-15 01:46:25,955 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-15 01:46:25,956 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-15 01:46:25,956 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-15 01:46:25,957 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-15 01:46:25,958 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-15 01:46:25,958 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-15 01:46:25,959 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-15 01:46:25,960 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-15 01:46:25,960 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-15 01:46:25,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-15 01:46:25,961 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-15 01:46:25,961 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-15 01:46:25,962 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-15 01:46:25,962 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-15 01:46:25,963 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-15 01:46:25,964 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ac3f673-2d19-4b33-97b6-d3eed202e63a/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-12-15 01:46:25,983 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-15 01:46:25,983 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-15 01:46:25,984 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-15 01:46:25,984 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-12-15 01:46:25,985 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-15 01:46:25,985 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-15 01:46:25,985 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-15 01:46:25,985 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-15 01:46:25,985 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-15 01:46:25,986 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-15 01:46:25,986 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-15 01:46:25,986 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-15 01:46:25,986 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-15 01:46:25,986 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-15 01:46:25,986 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-15 01:46:25,986 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-15 01:46:25,987 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-15 01:46:25,987 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-15 01:46:25,987 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-12-15 01:46:25,987 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-12-15 01:46:25,987 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-15 01:46:25,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-15 01:46:25,988 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-15 01:46:25,988 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-15 01:46:25,988 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-15 01:46:25,988 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-12-15 01:46:25,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-15 01:46:25,988 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-15 01:46:25,989 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_2ac3f673-2d19-4b33-97b6-d3eed202e63a/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_2ac3f673-2d19-4b33-97b6-d3eed202e63a/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 -> 0128e00bf508dfedd424bfda3d692f75ea10f378731858e87047f02277f2ca04 [2022-12-15 01:46:26,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-15 01:46:26,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-15 01:46:26,192 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-15 01:46:26,193 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-15 01:46:26,193 INFO L275 PluginConnector]: CDTParser initialized [2022-12-15 01:46:26,195 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ac3f673-2d19-4b33-97b6-d3eed202e63a/bin/ukojak-rkRKPMF4O4/../../sv-benchmarks/c/eca-rers2012/Problem01_label57.c [2022-12-15 01:46:28,796 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-15 01:46:29,002 INFO L351 CDTParser]: Found 1 translation units. [2022-12-15 01:46:29,002 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ac3f673-2d19-4b33-97b6-d3eed202e63a/sv-benchmarks/c/eca-rers2012/Problem01_label57.c [2022-12-15 01:46:29,012 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ac3f673-2d19-4b33-97b6-d3eed202e63a/bin/ukojak-rkRKPMF4O4/data/42f21e65e/44839981bf3744d79805cb10c6427058/FLAG8b5802935 [2022-12-15 01:46:29,026 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ac3f673-2d19-4b33-97b6-d3eed202e63a/bin/ukojak-rkRKPMF4O4/data/42f21e65e/44839981bf3744d79805cb10c6427058 [2022-12-15 01:46:29,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-15 01:46:29,029 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-15 01:46:29,030 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-15 01:46:29,030 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-15 01:46:29,033 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-15 01:46:29,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 01:46:29" (1/1) ... [2022-12-15 01:46:29,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@789084aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:46:29, skipping insertion in model container [2022-12-15 01:46:29,035 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 01:46:29" (1/1) ... [2022-12-15 01:46:29,042 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-15 01:46:29,074 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-15 01:46:29,265 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_2ac3f673-2d19-4b33-97b6-d3eed202e63a/sv-benchmarks/c/eca-rers2012/Problem01_label57.c[15253,15266] [2022-12-15 01:46:29,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-15 01:46:29,305 INFO L203 MainTranslator]: Completed pre-run [2022-12-15 01:46:29,353 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_2ac3f673-2d19-4b33-97b6-d3eed202e63a/sv-benchmarks/c/eca-rers2012/Problem01_label57.c[15253,15266] [2022-12-15 01:46:29,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-15 01:46:29,379 INFO L208 MainTranslator]: Completed translation [2022-12-15 01:46:29,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:46:29 WrapperNode [2022-12-15 01:46:29,379 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-15 01:46:29,380 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-15 01:46:29,380 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-15 01:46:29,380 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-15 01:46:29,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:46:29" (1/1) ... [2022-12-15 01:46:29,398 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:46:29" (1/1) ... [2022-12-15 01:46:29,428 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2022-12-15 01:46:29,429 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-15 01:46:29,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-15 01:46:29,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-15 01:46:29,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-15 01:46:29,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:46:29" (1/1) ... [2022-12-15 01:46:29,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:46:29" (1/1) ... [2022-12-15 01:46:29,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:46:29" (1/1) ... [2022-12-15 01:46:29,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:46:29" (1/1) ... [2022-12-15 01:46:29,452 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:46:29" (1/1) ... [2022-12-15 01:46:29,457 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:46:29" (1/1) ... [2022-12-15 01:46:29,461 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:46:29" (1/1) ... [2022-12-15 01:46:29,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:46:29" (1/1) ... [2022-12-15 01:46:29,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-15 01:46:29,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-15 01:46:29,469 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-15 01:46:29,469 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-15 01:46:29,470 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:46:29" (1/1) ... [2022-12-15 01:46:29,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-15 01:46:29,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ac3f673-2d19-4b33-97b6-d3eed202e63a/bin/ukojak-rkRKPMF4O4/z3 [2022-12-15 01:46:29,494 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ac3f673-2d19-4b33-97b6-d3eed202e63a/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-12-15 01:46:29,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ac3f673-2d19-4b33-97b6-d3eed202e63a/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-12-15 01:46:29,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-15 01:46:29,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-15 01:46:29,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-15 01:46:29,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-15 01:46:29,584 INFO L235 CfgBuilder]: Building ICFG [2022-12-15 01:46:29,586 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-15 01:46:30,312 INFO L276 CfgBuilder]: Performing block encoding [2022-12-15 01:46:30,479 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-15 01:46:30,479 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-15 01:46:30,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 01:46:30 BoogieIcfgContainer [2022-12-15 01:46:30,482 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-15 01:46:30,483 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-12-15 01:46:30,483 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-12-15 01:46:30,493 INFO L275 PluginConnector]: CodeCheck initialized [2022-12-15 01:46:30,493 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 01:46:30" (1/1) ... [2022-12-15 01:46:30,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-15 01:46:30,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:30,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2022-12-15 01:46:30,551 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2022-12-15 01:46:30,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-15 01:46:30,554 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:30,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:30,829 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-15 01:46:31,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:31,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 145 states and 237 transitions. [2022-12-15 01:46:31,185 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 237 transitions. [2022-12-15 01:46:31,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-15 01:46:31,186 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:31,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:31,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-15 01:46:31,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:31,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 146 states and 238 transitions. [2022-12-15 01:46:31,424 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 238 transitions. [2022-12-15 01:46:31,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-12-15 01:46:31,425 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:31,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:31,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:46:31,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:31,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 150 states and 244 transitions. [2022-12-15 01:46:31,513 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 244 transitions. [2022-12-15 01:46:31,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-15 01:46:31,514 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:31,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:31,560 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-15 01:46:31,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:31,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 151 states and 245 transitions. [2022-12-15 01:46:31,661 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 245 transitions. [2022-12-15 01:46:31,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-15 01:46:31,662 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:31,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:31,737 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:46:31,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:31,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 159 states and 258 transitions. [2022-12-15 01:46:31,849 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 258 transitions. [2022-12-15 01:46:31,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-15 01:46:31,850 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:31,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:31,907 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:46:31,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:31,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 160 states and 259 transitions. [2022-12-15 01:46:31,999 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 259 transitions. [2022-12-15 01:46:32,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-15 01:46:32,002 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:32,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:32,113 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-15 01:46:32,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:32,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 168 states and 268 transitions. [2022-12-15 01:46:32,197 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 268 transitions. [2022-12-15 01:46:32,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-12-15 01:46:32,198 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:32,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:32,294 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:46:32,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:32,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 182 states and 286 transitions. [2022-12-15 01:46:32,488 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 286 transitions. [2022-12-15 01:46:32,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-12-15 01:46:32,489 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:32,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:32,569 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:46:32,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:32,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 197 states and 306 transitions. [2022-12-15 01:46:32,873 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 306 transitions. [2022-12-15 01:46:32,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-12-15 01:46:32,874 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:32,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:32,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:32,971 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-15 01:46:33,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:33,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 212 states and 327 transitions. [2022-12-15 01:46:33,377 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 327 transitions. [2022-12-15 01:46:33,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-12-15 01:46:33,378 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:33,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:33,438 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:46:33,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:33,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 230 states and 356 transitions. [2022-12-15 01:46:33,935 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2022-12-15 01:46:33,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-12-15 01:46:33,936 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:33,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:34,017 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:46:34,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:34,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 232 states and 369 transitions. [2022-12-15 01:46:34,263 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 369 transitions. [2022-12-15 01:46:34,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-12-15 01:46:34,263 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:34,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:34,313 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:46:34,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:34,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 246 states and 387 transitions. [2022-12-15 01:46:34,640 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 387 transitions. [2022-12-15 01:46:34,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-12-15 01:46:34,640 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:34,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:34,689 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-15 01:46:34,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:34,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 251 states and 393 transitions. [2022-12-15 01:46:34,759 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 393 transitions. [2022-12-15 01:46:34,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-12-15 01:46:34,759 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:34,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:34,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:34,830 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-15 01:46:34,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:34,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 252 states and 394 transitions. [2022-12-15 01:46:34,963 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 394 transitions. [2022-12-15 01:46:34,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-12-15 01:46:34,964 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:34,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:35,033 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:46:35,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:35,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 271 states and 424 transitions. [2022-12-15 01:46:35,636 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 424 transitions. [2022-12-15 01:46:35,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-12-15 01:46:35,637 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:35,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:35,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:35,677 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:46:35,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:35,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 272 states and 425 transitions. [2022-12-15 01:46:35,793 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 425 transitions. [2022-12-15 01:46:35,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-12-15 01:46:35,794 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:35,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:35,879 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-15 01:46:36,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:36,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 287 states and 444 transitions. [2022-12-15 01:46:36,283 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 444 transitions. [2022-12-15 01:46:36,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-12-15 01:46:36,283 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:36,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:36,325 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-15 01:46:36,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:36,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 305 states and 464 transitions. [2022-12-15 01:46:36,783 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 464 transitions. [2022-12-15 01:46:36,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-12-15 01:46:36,783 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:36,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:36,829 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:46:36,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:36,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 309 states and 468 transitions. [2022-12-15 01:46:36,858 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 468 transitions. [2022-12-15 01:46:36,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-12-15 01:46:36,859 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:36,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:36,935 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-15 01:46:37,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:37,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 313 states and 475 transitions. [2022-12-15 01:46:37,179 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 475 transitions. [2022-12-15 01:46:37,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-12-15 01:46:37,180 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:37,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:37,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:37,240 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-15 01:46:37,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:37,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 314 states and 477 transitions. [2022-12-15 01:46:37,349 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 477 transitions. [2022-12-15 01:46:37,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-15 01:46:37,349 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:37,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:37,399 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-15 01:46:37,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:37,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 322 states and 492 transitions. [2022-12-15 01:46:37,749 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 492 transitions. [2022-12-15 01:46:37,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-15 01:46:37,750 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:37,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:37,797 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-15 01:46:38,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:38,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 328 states and 501 transitions. [2022-12-15 01:46:38,031 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 501 transitions. [2022-12-15 01:46:38,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-15 01:46:38,031 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:38,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:38,075 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-15 01:46:38,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:38,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 331 states and 506 transitions. [2022-12-15 01:46:38,234 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 506 transitions. [2022-12-15 01:46:38,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-15 01:46:38,235 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:38,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:38,282 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:46:38,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:38,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 346 states and 527 transitions. [2022-12-15 01:46:38,586 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 527 transitions. [2022-12-15 01:46:38,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-12-15 01:46:38,586 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:38,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:38,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:38,662 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-15 01:46:38,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:38,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 360 states and 544 transitions. [2022-12-15 01:46:38,876 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 544 transitions. [2022-12-15 01:46:38,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-12-15 01:46:38,877 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:38,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:38,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:39,000 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:46:39,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:39,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 362 states and 546 transitions. [2022-12-15 01:46:39,210 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 546 transitions. [2022-12-15 01:46:39,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-12-15 01:46:39,211 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:39,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:39,262 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-15 01:46:39,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:39,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 368 states and 553 transitions. [2022-12-15 01:46:39,510 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 553 transitions. [2022-12-15 01:46:39,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-12-15 01:46:39,511 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:39,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:39,547 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-15 01:46:39,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:39,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 372 states and 556 transitions. [2022-12-15 01:46:39,573 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 556 transitions. [2022-12-15 01:46:39,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-12-15 01:46:39,574 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:39,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:39,667 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:46:39,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:39,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 374 states and 559 transitions. [2022-12-15 01:46:39,699 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 559 transitions. [2022-12-15 01:46:39,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-12-15 01:46:39,700 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:39,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:39,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:39,796 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-15 01:46:40,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:40,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 388 states and 577 transitions. [2022-12-15 01:46:40,154 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 577 transitions. [2022-12-15 01:46:40,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-12-15 01:46:40,154 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:40,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:40,233 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-15 01:46:40,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:40,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 392 states and 582 transitions. [2022-12-15 01:46:40,431 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 582 transitions. [2022-12-15 01:46:40,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-12-15 01:46:40,432 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:40,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:40,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:40,496 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-15 01:46:40,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:40,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 394 states and 585 transitions. [2022-12-15 01:46:40,629 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 585 transitions. [2022-12-15 01:46:40,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-12-15 01:46:40,629 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:40,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:40,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:40,696 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-15 01:46:40,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:40,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 397 states and 589 transitions. [2022-12-15 01:46:40,751 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 589 transitions. [2022-12-15 01:46:40,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-12-15 01:46:40,752 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:40,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:40,811 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-15 01:46:41,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:41,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 406 states and 599 transitions. [2022-12-15 01:46:41,125 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 599 transitions. [2022-12-15 01:46:41,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-12-15 01:46:41,126 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:41,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:41,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:41,192 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-15 01:46:41,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:41,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 410 states and 602 transitions. [2022-12-15 01:46:41,407 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 602 transitions. [2022-12-15 01:46:41,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-12-15 01:46:41,408 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:41,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:41,504 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-15 01:46:41,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:41,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 413 states and 605 transitions. [2022-12-15 01:46:41,665 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 605 transitions. [2022-12-15 01:46:41,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-12-15 01:46:41,666 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:41,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:41,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:41,779 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:46:42,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:42,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 483 states and 683 transitions. [2022-12-15 01:46:42,268 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 683 transitions. [2022-12-15 01:46:42,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-12-15 01:46:42,268 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:42,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:42,308 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-15 01:46:42,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:42,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 497 states and 700 transitions. [2022-12-15 01:46:42,382 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 700 transitions. [2022-12-15 01:46:42,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-15 01:46:42,383 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:42,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:42,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:42,416 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-15 01:46:42,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:42,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 508 states and 714 transitions. [2022-12-15 01:46:42,532 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 714 transitions. [2022-12-15 01:46:42,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-12-15 01:46:42,532 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:42,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:42,580 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-15 01:46:43,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:43,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 532 states and 747 transitions. [2022-12-15 01:46:43,067 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 747 transitions. [2022-12-15 01:46:43,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-12-15 01:46:43,068 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:43,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:43,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:43,119 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-15 01:46:43,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:43,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 536 states and 751 transitions. [2022-12-15 01:46:43,364 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 751 transitions. [2022-12-15 01:46:43,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-15 01:46:43,365 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:43,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:43,399 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-15 01:46:43,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:43,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 538 states and 753 transitions. [2022-12-15 01:46:43,488 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 753 transitions. [2022-12-15 01:46:43,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-15 01:46:43,489 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:43,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:43,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-15 01:46:43,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:43,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 545 states and 760 transitions. [2022-12-15 01:46:43,706 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 760 transitions. [2022-12-15 01:46:43,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-12-15 01:46:43,706 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:43,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:43,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:43,758 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:46:44,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:44,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 583 states and 804 transitions. [2022-12-15 01:46:44,277 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 804 transitions. [2022-12-15 01:46:44,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-12-15 01:46:44,277 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:44,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:44,322 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:46:44,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:44,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 586 states and 806 transitions. [2022-12-15 01:46:44,483 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 806 transitions. [2022-12-15 01:46:44,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-12-15 01:46:44,484 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:44,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:44,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:44,539 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:46:44,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:44,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 589 states and 808 transitions. [2022-12-15 01:46:44,724 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 808 transitions. [2022-12-15 01:46:44,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-12-15 01:46:44,724 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:44,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:44,808 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-15 01:46:44,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:44,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 603 states and 825 transitions. [2022-12-15 01:46:44,942 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 825 transitions. [2022-12-15 01:46:44,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-12-15 01:46:44,943 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:44,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:44,978 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-15 01:46:45,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:45,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 612 states and 834 transitions. [2022-12-15 01:46:45,205 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 834 transitions. [2022-12-15 01:46:45,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-12-15 01:46:45,206 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:45,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:45,280 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:46:45,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:45,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 620 states and 843 transitions. [2022-12-15 01:46:45,396 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 843 transitions. [2022-12-15 01:46:45,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-12-15 01:46:45,396 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:45,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:45,449 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-12-15 01:46:46,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:46,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 704 states and 930 transitions. [2022-12-15 01:46:46,173 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 930 transitions. [2022-12-15 01:46:46,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-12-15 01:46:46,174 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:46,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:46,298 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-15 01:46:46,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:46,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 717 states and 945 transitions. [2022-12-15 01:46:46,552 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 945 transitions. [2022-12-15 01:46:46,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-12-15 01:46:46,553 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:46,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:46,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:46,620 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-15 01:46:46,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:46,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 722 states and 949 transitions. [2022-12-15 01:46:46,744 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 949 transitions. [2022-12-15 01:46:46,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-12-15 01:46:46,745 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:46,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:46,807 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-15 01:46:46,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:46,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 727 states and 953 transitions. [2022-12-15 01:46:46,940 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 953 transitions. [2022-12-15 01:46:46,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-12-15 01:46:46,940 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:46,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:47,037 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-12-15 01:46:47,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:47,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 730 states and 956 transitions. [2022-12-15 01:46:47,086 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 956 transitions. [2022-12-15 01:46:47,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-12-15 01:46:47,086 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:47,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:47,125 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-15 01:46:47,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:47,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 744 states and 973 transitions. [2022-12-15 01:46:47,416 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 973 transitions. [2022-12-15 01:46:47,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-12-15 01:46:47,417 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:47,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:47,477 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:46:47,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:47,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 771 states and 1001 transitions. [2022-12-15 01:46:47,594 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1001 transitions. [2022-12-15 01:46:47,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-12-15 01:46:47,594 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:47,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:47,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:47,663 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-15 01:46:47,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:47,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 788 states and 1019 transitions. [2022-12-15 01:46:47,917 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1019 transitions. [2022-12-15 01:46:47,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-12-15 01:46:47,918 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:47,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:47,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:47,998 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:46:48,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:48,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 811 states and 1043 transitions. [2022-12-15 01:46:48,221 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1043 transitions. [2022-12-15 01:46:48,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-12-15 01:46:48,222 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:48,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:48,273 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-12-15 01:46:48,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:48,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 812 states and 1043 transitions. [2022-12-15 01:46:48,312 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1043 transitions. [2022-12-15 01:46:48,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-12-15 01:46:48,312 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:48,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:48,408 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-15 01:46:48,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:48,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 832 states and 1064 transitions. [2022-12-15 01:46:48,980 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1064 transitions. [2022-12-15 01:46:48,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-12-15 01:46:48,980 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:48,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:49,066 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:46:49,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:49,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 859 states and 1096 transitions. [2022-12-15 01:46:49,652 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1096 transitions. [2022-12-15 01:46:49,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-12-15 01:46:49,653 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:49,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:49,706 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:46:49,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:49,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 866 states and 1102 transitions. [2022-12-15 01:46:49,753 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1102 transitions. [2022-12-15 01:46:49,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-12-15 01:46:49,753 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:49,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:49,873 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-15 01:46:51,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:51,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 928 states and 1171 transitions. [2022-12-15 01:46:51,361 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1171 transitions. [2022-12-15 01:46:51,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-12-15 01:46:51,363 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:51,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:51,451 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-15 01:46:51,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:51,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 950 states and 1192 transitions. [2022-12-15 01:46:51,546 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1192 transitions. [2022-12-15 01:46:51,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-12-15 01:46:51,546 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:51,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:51,592 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-15 01:46:51,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:51,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 961 states and 1204 transitions. [2022-12-15 01:46:51,649 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1204 transitions. [2022-12-15 01:46:51,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-12-15 01:46:51,650 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:51,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:51,706 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-15 01:46:51,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:51,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 965 states and 1208 transitions. [2022-12-15 01:46:51,991 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1208 transitions. [2022-12-15 01:46:51,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-12-15 01:46:51,991 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:51,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:52,048 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-15 01:46:52,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:52,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 979 states and 1224 transitions. [2022-12-15 01:46:52,480 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1224 transitions. [2022-12-15 01:46:52,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-12-15 01:46:52,481 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:52,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:52,739 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 82 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:46:54,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:54,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1062 states and 1324 transitions. [2022-12-15 01:46:54,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1324 transitions. [2022-12-15 01:46:54,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-12-15 01:46:54,181 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:54,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:54,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:54,259 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-15 01:46:54,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:54,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1081 states and 1343 transitions. [2022-12-15 01:46:54,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1343 transitions. [2022-12-15 01:46:54,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-12-15 01:46:54,375 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:54,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:54,469 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-15 01:46:56,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:56,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1142 states and 1416 transitions. [2022-12-15 01:46:56,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1416 transitions. [2022-12-15 01:46:56,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-12-15 01:46:56,053 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:56,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:56,575 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 91 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:46:58,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:58,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1211 states and 1503 transitions. [2022-12-15 01:46:58,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1503 transitions. [2022-12-15 01:46:58,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-12-15 01:46:58,593 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:58,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:58,844 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 91 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:46:59,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:59,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1216 states and 1506 transitions. [2022-12-15 01:46:59,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1506 transitions. [2022-12-15 01:46:59,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-12-15 01:46:59,238 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:59,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:46:59,420 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 91 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:46:59,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:46:59,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1221 states and 1513 transitions. [2022-12-15 01:46:59,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1513 transitions. [2022-12-15 01:46:59,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-12-15 01:46:59,911 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:46:59,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:46:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:00,070 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 91 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:47:00,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:00,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1225 states and 1518 transitions. [2022-12-15 01:47:00,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1518 transitions. [2022-12-15 01:47:00,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-12-15 01:47:00,326 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:00,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:00,503 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 91 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:47:01,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:01,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1234 states and 1529 transitions. [2022-12-15 01:47:01,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1529 transitions. [2022-12-15 01:47:01,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-12-15 01:47:01,032 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:01,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:01,282 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-15 01:47:02,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:02,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1283 states and 1579 transitions. [2022-12-15 01:47:02,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1579 transitions. [2022-12-15 01:47:02,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-12-15 01:47:02,519 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:02,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:02,700 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-15 01:47:02,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:02,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1305 states and 1600 transitions. [2022-12-15 01:47:02,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1600 transitions. [2022-12-15 01:47:02,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-12-15 01:47:02,875 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:02,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:02,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:02,941 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-12-15 01:47:03,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:03,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1619 states to 1320 states and 1619 transitions. [2022-12-15 01:47:03,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1619 transitions. [2022-12-15 01:47:03,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-12-15 01:47:03,511 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:03,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:03,574 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-15 01:47:05,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:05,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1688 states to 1382 states and 1688 transitions. [2022-12-15 01:47:05,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1688 transitions. [2022-12-15 01:47:05,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-12-15 01:47:05,503 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:05,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:05,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:05,567 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-15 01:47:05,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:05,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1391 states and 1696 transitions. [2022-12-15 01:47:05,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 1696 transitions. [2022-12-15 01:47:05,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-12-15 01:47:05,920 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:05,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:05,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:05,969 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-15 01:47:06,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:06,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1403 states and 1708 transitions. [2022-12-15 01:47:06,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 1708 transitions. [2022-12-15 01:47:06,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-12-15 01:47:06,589 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:06,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:06,638 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-15 01:47:07,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:07,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1417 states and 1722 transitions. [2022-12-15 01:47:07,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1722 transitions. [2022-12-15 01:47:07,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-12-15 01:47:07,174 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:07,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:07,223 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-15 01:47:07,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:07,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1421 states and 1725 transitions. [2022-12-15 01:47:07,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 1725 transitions. [2022-12-15 01:47:07,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-12-15 01:47:07,429 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:07,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:07,499 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-12-15 01:47:07,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:07,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1432 states and 1735 transitions. [2022-12-15 01:47:07,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1735 transitions. [2022-12-15 01:47:07,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-12-15 01:47:07,899 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:07,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:07,949 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-12-15 01:47:08,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:08,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1439 states and 1741 transitions. [2022-12-15 01:47:08,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 1741 transitions. [2022-12-15 01:47:08,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-12-15 01:47:08,440 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:08,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:08,507 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-15 01:47:09,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:09,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1749 states to 1444 states and 1749 transitions. [2022-12-15 01:47:09,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1749 transitions. [2022-12-15 01:47:09,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-12-15 01:47:09,091 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:09,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:09,189 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-15 01:47:09,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:09,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1457 states and 1763 transitions. [2022-12-15 01:47:09,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 1763 transitions. [2022-12-15 01:47:09,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-12-15 01:47:09,712 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:09,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:09,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:09,780 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-15 01:47:09,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:09,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1460 states and 1765 transitions. [2022-12-15 01:47:09,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 1765 transitions. [2022-12-15 01:47:09,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-12-15 01:47:09,936 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:09,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:10,021 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-15 01:47:10,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:10,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1485 states and 1791 transitions. [2022-12-15 01:47:10,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 1791 transitions. [2022-12-15 01:47:10,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-12-15 01:47:10,587 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:10,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:10,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:10,671 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-15 01:47:10,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:10,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1489 states and 1794 transitions. [2022-12-15 01:47:10,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 1794 transitions. [2022-12-15 01:47:10,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-12-15 01:47:10,962 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:10,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:11,131 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-12-15 01:47:11,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:11,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1559 states and 1872 transitions. [2022-12-15 01:47:11,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 1872 transitions. [2022-12-15 01:47:11,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-12-15 01:47:11,696 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:11,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:11,789 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-15 01:47:12,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:12,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1561 states and 1873 transitions. [2022-12-15 01:47:12,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1873 transitions. [2022-12-15 01:47:12,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-12-15 01:47:12,070 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:12,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:12,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:12,156 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-15 01:47:12,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:12,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1581 states and 1893 transitions. [2022-12-15 01:47:12,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 1893 transitions. [2022-12-15 01:47:12,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-12-15 01:47:12,291 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:12,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:12,377 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-12-15 01:47:12,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:12,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1582 states and 1893 transitions. [2022-12-15 01:47:12,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1893 transitions. [2022-12-15 01:47:12,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-12-15 01:47:12,429 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:12,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:13,068 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 6 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:47:15,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:15,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 1737 states and 2063 transitions. [2022-12-15 01:47:15,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 2063 transitions. [2022-12-15 01:47:15,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-12-15 01:47:15,483 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:15,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:15,604 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-12-15 01:47:15,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:15,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 1744 states and 2069 transitions. [2022-12-15 01:47:15,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 2069 transitions. [2022-12-15 01:47:15,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-12-15 01:47:15,731 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:15,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:15,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:15,837 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-12-15 01:47:16,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:16,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 1751 states and 2076 transitions. [2022-12-15 01:47:16,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2076 transitions. [2022-12-15 01:47:16,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-12-15 01:47:16,090 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:16,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:16,512 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 164 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:47:18,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:18,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 1790 states and 2125 transitions. [2022-12-15 01:47:18,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 2125 transitions. [2022-12-15 01:47:18,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-12-15 01:47:18,048 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:18,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:18,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:18,310 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 164 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:47:19,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:19,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 1797 states and 2140 transitions. [2022-12-15 01:47:19,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2140 transitions. [2022-12-15 01:47:19,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-12-15 01:47:19,128 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:19,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:19,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:19,434 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 164 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:47:19,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:19,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2143 states to 1800 states and 2143 transitions. [2022-12-15 01:47:19,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2143 transitions. [2022-12-15 01:47:19,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-12-15 01:47:19,770 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:19,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:20,056 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 164 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:47:20,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:20,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 1803 states and 2147 transitions. [2022-12-15 01:47:20,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2147 transitions. [2022-12-15 01:47:20,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-12-15 01:47:20,456 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:20,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:20,716 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 164 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:47:21,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:21,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2160 states to 1813 states and 2160 transitions. [2022-12-15 01:47:21,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 2160 transitions. [2022-12-15 01:47:21,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-12-15 01:47:21,580 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:21,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:22,011 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 164 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:47:22,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:22,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2161 states to 1815 states and 2161 transitions. [2022-12-15 01:47:22,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2161 transitions. [2022-12-15 01:47:22,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-12-15 01:47:22,257 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:22,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:22,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:22,624 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 164 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:47:22,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:22,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 1817 states and 2163 transitions. [2022-12-15 01:47:22,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2163 transitions. [2022-12-15 01:47:22,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-12-15 01:47:22,962 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:22,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:22,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:23,243 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 164 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:47:23,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:23,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 1820 states and 2166 transitions. [2022-12-15 01:47:23,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 2166 transitions. [2022-12-15 01:47:23,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-12-15 01:47:23,541 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:23,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:23,797 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 164 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:47:24,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:24,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 1821 states and 2166 transitions. [2022-12-15 01:47:24,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2166 transitions. [2022-12-15 01:47:24,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-12-15 01:47:24,174 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:24,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:24,453 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 164 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:47:24,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:24,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 1824 states and 2169 transitions. [2022-12-15 01:47:24,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2169 transitions. [2022-12-15 01:47:24,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-12-15 01:47:24,863 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:24,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:25,134 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 135 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:47:26,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:26,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2230 states to 1874 states and 2230 transitions. [2022-12-15 01:47:26,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2230 transitions. [2022-12-15 01:47:26,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-12-15 01:47:26,716 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:26,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:26,919 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 135 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:47:27,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:27,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2241 states to 1879 states and 2241 transitions. [2022-12-15 01:47:27,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 2241 transitions. [2022-12-15 01:47:27,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-12-15 01:47:27,330 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:27,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:27,502 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 135 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:47:27,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:27,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 1884 states and 2245 transitions. [2022-12-15 01:47:27,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 2245 transitions. [2022-12-15 01:47:27,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-12-15 01:47:27,841 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:27,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:27,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:28,013 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 135 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:47:28,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:28,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2249 states to 1889 states and 2249 transitions. [2022-12-15 01:47:28,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 2249 transitions. [2022-12-15 01:47:28,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-12-15 01:47:28,512 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:28,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:28,630 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-12-15 01:47:28,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:28,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2252 states to 1893 states and 2252 transitions. [2022-12-15 01:47:28,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2252 transitions. [2022-12-15 01:47:28,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-12-15 01:47:28,884 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:28,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:29,012 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-12-15 01:47:29,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:29,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 1895 states and 2254 transitions. [2022-12-15 01:47:29,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 2254 transitions. [2022-12-15 01:47:29,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-12-15 01:47:29,109 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:29,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:29,221 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-12-15 01:47:29,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:29,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 1908 states and 2267 transitions. [2022-12-15 01:47:29,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 2267 transitions. [2022-12-15 01:47:29,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-12-15 01:47:29,586 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:29,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:29,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:29,646 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-12-15 01:47:29,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:29,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2275 states to 1913 states and 2275 transitions. [2022-12-15 01:47:29,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 2275 transitions. [2022-12-15 01:47:29,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-12-15 01:47:29,918 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:29,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:29,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:30,029 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-15 01:47:30,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:30,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 1942 states and 2302 transitions. [2022-12-15 01:47:30,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2302 transitions. [2022-12-15 01:47:30,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-12-15 01:47:30,716 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:30,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:30,830 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-12-15 01:47:31,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:31,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 1959 states and 2318 transitions. [2022-12-15 01:47:31,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 2318 transitions. [2022-12-15 01:47:31,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-12-15 01:47:31,156 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:31,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:31,224 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-12-15 01:47:31,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:31,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2029 states and 2390 transitions. [2022-12-15 01:47:31,638 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 2390 transitions. [2022-12-15 01:47:31,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-12-15 01:47:31,639 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:31,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:31,732 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-12-15 01:47:33,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:33,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2045 states and 2411 transitions. [2022-12-15 01:47:33,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 2411 transitions. [2022-12-15 01:47:33,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-12-15 01:47:33,025 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:33,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:33,119 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-12-15 01:47:33,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:33,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2412 states to 2048 states and 2412 transitions. [2022-12-15 01:47:33,369 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 2412 transitions. [2022-12-15 01:47:33,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-12-15 01:47:33,371 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:33,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:33,463 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-12-15 01:47:33,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:33,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2414 states to 2050 states and 2414 transitions. [2022-12-15 01:47:33,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 2414 transitions. [2022-12-15 01:47:33,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-12-15 01:47:33,697 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:33,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:33,791 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-12-15 01:47:34,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:34,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2055 states and 2418 transitions. [2022-12-15 01:47:34,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 2418 transitions. [2022-12-15 01:47:34,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2022-12-15 01:47:34,035 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:34,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:34,675 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 236 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:47:35,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:35,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2489 states to 2125 states and 2489 transitions. [2022-12-15 01:47:35,751 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 2489 transitions. [2022-12-15 01:47:35,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2022-12-15 01:47:35,752 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:35,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:35,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:36,020 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 278 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:47:38,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:38,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2604 states to 2217 states and 2604 transitions. [2022-12-15 01:47:38,465 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 2604 transitions. [2022-12-15 01:47:38,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2022-12-15 01:47:38,466 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:38,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:38,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:38,659 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 278 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:47:39,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:39,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2620 states to 2234 states and 2620 transitions. [2022-12-15 01:47:39,327 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 2620 transitions. [2022-12-15 01:47:39,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2022-12-15 01:47:39,328 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:39,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:39,495 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 278 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:47:40,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:40,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2637 states to 2251 states and 2637 transitions. [2022-12-15 01:47:40,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2251 states and 2637 transitions. [2022-12-15 01:47:40,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2022-12-15 01:47:40,178 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:40,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:40,259 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2022-12-15 01:47:40,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:40,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2709 states to 2321 states and 2709 transitions. [2022-12-15 01:47:40,785 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 2709 transitions. [2022-12-15 01:47:40,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2022-12-15 01:47:40,786 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:40,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:40,860 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-12-15 01:47:41,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:41,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2736 states to 2346 states and 2736 transitions. [2022-12-15 01:47:41,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 2736 transitions. [2022-12-15 01:47:41,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2022-12-15 01:47:41,420 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:41,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:41,765 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-12-15 01:47:43,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:43,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2796 states to 2400 states and 2796 transitions. [2022-12-15 01:47:43,334 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 2796 transitions. [2022-12-15 01:47:43,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2022-12-15 01:47:43,335 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:43,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:43,571 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-12-15 01:47:44,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:44,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2814 states to 2418 states and 2814 transitions. [2022-12-15 01:47:44,069 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 2814 transitions. [2022-12-15 01:47:44,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-12-15 01:47:44,070 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:44,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:44,337 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 6 proven. 284 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-12-15 01:47:45,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:45,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2885 states to 2488 states and 2885 transitions. [2022-12-15 01:47:45,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2488 states and 2885 transitions. [2022-12-15 01:47:45,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-12-15 01:47:45,370 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:45,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:45,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:47:45,662 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 6 proven. 284 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-12-15 01:47:46,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:47:46,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2493 states and 2890 transitions. [2022-12-15 01:47:46,187 INFO L276 IsEmpty]: Start isEmpty. Operand 2493 states and 2890 transitions. [2022-12-15 01:47:46,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-12-15 01:47:46,188 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:47:46,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:47:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 01:47:46,220 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-15 01:47:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 01:47:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 01:47:46,407 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-15 01:47:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 01:47:46,512 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 135 iterations. [2022-12-15 01:47:46,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 15.12 01:47:46 ImpRootNode [2022-12-15 01:47:46,683 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-12-15 01:47:46,683 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-15 01:47:46,683 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-15 01:47:46,683 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-15 01:47:46,683 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 01:46:30" (3/4) ... [2022-12-15 01:47:46,685 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-15 01:47:46,783 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ac3f673-2d19-4b33-97b6-d3eed202e63a/bin/ukojak-rkRKPMF4O4/witness.graphml [2022-12-15 01:47:46,784 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-15 01:47:46,784 INFO L158 Benchmark]: Toolchain (without parser) took 77755.24ms. Allocated memory was 159.4MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 124.1MB in the beginning and 903.1MB in the end (delta: -779.0MB). Peak memory consumption was 530.1MB. Max. memory is 16.1GB. [2022-12-15 01:47:46,784 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory is still 50.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-15 01:47:46,784 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.25ms. Allocated memory is still 159.4MB. Free memory was 124.1MB in the beginning and 96.9MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-15 01:47:46,785 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.84ms. Allocated memory is still 159.4MB. Free memory was 96.9MB in the beginning and 91.1MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-15 01:47:46,785 INFO L158 Benchmark]: Boogie Preprocessor took 39.06ms. Allocated memory is still 159.4MB. Free memory was 91.1MB in the beginning and 86.3MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-15 01:47:46,785 INFO L158 Benchmark]: RCFGBuilder took 1013.58ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 86.3MB in the beginning and 128.9MB in the end (delta: -42.6MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2022-12-15 01:47:46,785 INFO L158 Benchmark]: CodeCheck took 76199.48ms. Allocated memory was 192.9MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 128.9MB in the beginning and 927.2MB in the end (delta: -798.2MB). Peak memory consumption was 475.8MB. Max. memory is 16.1GB. [2022-12-15 01:47:46,785 INFO L158 Benchmark]: Witness Printer took 100.81ms. Allocated memory is still 1.5GB. Free memory was 927.2MB in the beginning and 903.1MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-12-15 01:47:46,786 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: 76.0s, OverallIterations: 135, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 303715 SdHoareTripleChecker+Valid, 548.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 299456 mSDsluCounter, 39874 SdHoareTripleChecker+Invalid, 469.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33656 mSDsCounter, 81394 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 663250 IncrementalHoareTripleChecker+Invalid, 744644 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81394 mSolverCounterUnsat, 6218 mSDtfsCounter, 663250 mSolverCounterSat, 4.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 143240 GetRequests, 137765 SyntacticMatches, 4579 SemanticMatches, 896 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522437 ImplicationChecksByTransitivity, 46.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.6s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 14.0s InterpolantComputationTime, 20845 NumberOfCodeBlocks, 20845 NumberOfCodeBlocksAsserted, 135 NumberOfCheckSat, 20448 ConstructedInterpolants, 0 QuantifiedInterpolants, 84704 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 134 InterpolantComputations, 107 PerfectInterpolantSequences, 14736/16899 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 420]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int d= 4; [L19] int e= 5; [L20] int f= 6; [L21] int c= 3; [L22] int b= 2; [L25] int u = 21; [L26] int v = 22; [L27] int w = 23; [L28] int x = 24; [L29] int y = 25; [L30] int z = 26; [L32] int a17 = 1; [L33] int a7 = 0; [L34] int a20 = 1; [L35] int a8 = 15; [L36] int a12 = 8; [L37] int a16 = 5; [L38] int a21 = 1; [L590] int output = -1; VAL [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)=1, 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=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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L83] a7 = 1 [L84] a17 = 1 [L85] a21 = 0 [L86] a20 = 1 [L87] a8 = 13 [L88] a16 = 5 [L89] return 26; VAL [\old(input)=1, \result=26, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, 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)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND TRUE ((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5)) [L376] a21 = 1 [L377] a7 = 0 [L378] a17 = 0 [L379] a8 = 14 [L380] a20 = 0 [L381] return -1; VAL [\old(input)=5, \result=-1, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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=5, a17=0, a20=0, 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))) VAL [\old(input)=1, a=1, a12=8, a16=5, a17=0, a20=0, 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] [L419] COND TRUE ((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1)) VAL [\old(input)=1, a=1, a12=8, a16=5, a17=0, a20=0, 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] [L420] reach_error() VAL [\old(input)=1, a=1, a12=8, a16=5, a17=0, a20=0, 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.18ms. Allocated memory is still 100.7MB. Free memory is still 50.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.25ms. Allocated memory is still 159.4MB. Free memory was 124.1MB in the beginning and 96.9MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.84ms. Allocated memory is still 159.4MB. Free memory was 96.9MB in the beginning and 91.1MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.06ms. Allocated memory is still 159.4MB. Free memory was 91.1MB in the beginning and 86.3MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1013.58ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 86.3MB in the beginning and 128.9MB in the end (delta: -42.6MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * CodeCheck took 76199.48ms. Allocated memory was 192.9MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 128.9MB in the beginning and 927.2MB in the end (delta: -798.2MB). Peak memory consumption was 475.8MB. Max. memory is 16.1GB. * Witness Printer took 100.81ms. Allocated memory is still 1.5GB. Free memory was 927.2MB in the beginning and 903.1MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2022-12-15 01:47:46,801 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ac3f673-2d19-4b33-97b6-d3eed202e63a/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