./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label33.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31c6c6fa-3037-4d74-9742-e2f672c242ca/bin/ukojak-LBtLqBUTdQ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31c6c6fa-3037-4d74-9742-e2f672c242ca/bin/ukojak-LBtLqBUTdQ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31c6c6fa-3037-4d74-9742-e2f672c242ca/bin/ukojak-LBtLqBUTdQ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31c6c6fa-3037-4d74-9742-e2f672c242ca/bin/ukojak-LBtLqBUTdQ/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label33.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31c6c6fa-3037-4d74-9742-e2f672c242ca/bin/ukojak-LBtLqBUTdQ/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31c6c6fa-3037-4d74-9742-e2f672c242ca/bin/ukojak-LBtLqBUTdQ --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 a90366a5085659577cb1c98c7b11041979a96aff31e8f044fed2c2fa31b4a389 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 01:08:45,763 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 01:08:45,765 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 01:08:45,796 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 01:08:45,797 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 01:08:45,798 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 01:08:45,804 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 01:08:45,806 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 01:08:45,808 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 01:08:45,809 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 01:08:45,811 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 01:08:45,812 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 01:08:45,813 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 01:08:45,814 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 01:08:45,819 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 01:08:45,826 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 01:08:45,829 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 01:08:45,836 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 01:08:45,838 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 01:08:45,841 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 01:08:45,843 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 01:08:45,851 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 01:08:45,855 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 01:08:45,856 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 01:08:45,865 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 01:08:45,865 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 01:08:45,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 01:08:45,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 01:08:45,867 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 01:08:45,869 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 01:08:45,869 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 01:08:45,880 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 01:08:45,882 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 01:08:45,884 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 01:08:45,885 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 01:08:45,885 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 01:08:45,886 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 01:08:45,886 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 01:08:45,886 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 01:08:45,887 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 01:08:45,888 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 01:08:45,889 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31c6c6fa-3037-4d74-9742-e2f672c242ca/bin/ukojak-LBtLqBUTdQ/config/svcomp-Reach-32bit-Kojak_Default.epf [2021-11-23 01:08:45,950 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 01:08:45,950 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 01:08:45,951 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 01:08:45,951 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2021-11-23 01:08:45,952 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 01:08:45,952 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 01:08:45,952 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 01:08:45,952 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 01:08:45,953 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 01:08:45,953 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 01:08:45,953 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 01:08:45,953 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 01:08:45,953 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 01:08:45,953 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 01:08:45,954 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 01:08:45,954 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 01:08:45,954 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 01:08:45,954 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 01:08:45,962 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2021-11-23 01:08:45,963 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2021-11-23 01:08:45,963 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 01:08:45,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-23 01:08:45,963 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 01:08:45,964 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 01:08:45,964 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 01:08:45,964 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2021-11-23 01:08:45,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 01:08:45,965 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 01:08:45,965 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_31c6c6fa-3037-4d74-9742-e2f672c242ca/bin/ukojak-LBtLqBUTdQ/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_31c6c6fa-3037-4d74-9742-e2f672c242ca/bin/ukojak-LBtLqBUTdQ 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 -> a90366a5085659577cb1c98c7b11041979a96aff31e8f044fed2c2fa31b4a389 [2021-11-23 01:08:46,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 01:08:46,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 01:08:46,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 01:08:46,296 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 01:08:46,298 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 01:08:46,300 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31c6c6fa-3037-4d74-9742-e2f672c242ca/bin/ukojak-LBtLqBUTdQ/../../sv-benchmarks/c/eca-rers2012/Problem01_label33.c [2021-11-23 01:08:46,366 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31c6c6fa-3037-4d74-9742-e2f672c242ca/bin/ukojak-LBtLqBUTdQ/data/9b9d78281/70d96391a34a405aaba28c34433d926e/FLAG3d1b07d55 [2021-11-23 01:08:46,980 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 01:08:46,981 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31c6c6fa-3037-4d74-9742-e2f672c242ca/sv-benchmarks/c/eca-rers2012/Problem01_label33.c [2021-11-23 01:08:46,996 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31c6c6fa-3037-4d74-9742-e2f672c242ca/bin/ukojak-LBtLqBUTdQ/data/9b9d78281/70d96391a34a405aaba28c34433d926e/FLAG3d1b07d55 [2021-11-23 01:08:47,215 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31c6c6fa-3037-4d74-9742-e2f672c242ca/bin/ukojak-LBtLqBUTdQ/data/9b9d78281/70d96391a34a405aaba28c34433d926e [2021-11-23 01:08:47,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 01:08:47,219 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 01:08:47,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 01:08:47,235 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 01:08:47,238 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 01:08:47,239 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:08:47" (1/1) ... [2021-11-23 01:08:47,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18b86e6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:47, skipping insertion in model container [2021-11-23 01:08:47,241 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:08:47" (1/1) ... [2021-11-23 01:08:47,248 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 01:08:47,303 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 01:08:47,712 WARN L230 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_31c6c6fa-3037-4d74-9742-e2f672c242ca/sv-benchmarks/c/eca-rers2012/Problem01_label33.c[15127,15140] [2021-11-23 01:08:47,781 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 01:08:47,796 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 01:08:47,917 WARN L230 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_31c6c6fa-3037-4d74-9742-e2f672c242ca/sv-benchmarks/c/eca-rers2012/Problem01_label33.c[15127,15140] [2021-11-23 01:08:47,936 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 01:08:47,952 INFO L208 MainTranslator]: Completed translation [2021-11-23 01:08:47,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:47 WrapperNode [2021-11-23 01:08:47,953 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 01:08:47,954 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 01:08:47,955 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 01:08:47,955 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 01:08:47,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:47" (1/1) ... [2021-11-23 01:08:47,989 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:47" (1/1) ... [2021-11-23 01:08:48,053 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2021-11-23 01:08:48,054 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 01:08:48,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 01:08:48,055 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 01:08:48,055 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 01:08:48,064 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:47" (1/1) ... [2021-11-23 01:08:48,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:47" (1/1) ... [2021-11-23 01:08:48,069 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:47" (1/1) ... [2021-11-23 01:08:48,069 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:47" (1/1) ... [2021-11-23 01:08:48,097 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:47" (1/1) ... [2021-11-23 01:08:48,131 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:47" (1/1) ... [2021-11-23 01:08:48,136 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:47" (1/1) ... [2021-11-23 01:08:48,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 01:08:48,155 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 01:08:48,156 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 01:08:48,156 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 01:08:48,157 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:47" (1/1) ... [2021-11-23 01:08:48,165 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-23 01:08:48,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31c6c6fa-3037-4d74-9742-e2f672c242ca/bin/ukojak-LBtLqBUTdQ/z3 [2021-11-23 01:08:48,191 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31c6c6fa-3037-4d74-9742-e2f672c242ca/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2021-11-23 01:08:48,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31c6c6fa-3037-4d74-9742-e2f672c242ca/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2021-11-23 01:08:48,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 01:08:48,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 01:08:48,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 01:08:48,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 01:08:48,359 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 01:08:48,361 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 01:08:49,504 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 01:08:49,753 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 01:08:49,753 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-23 01:08:49,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:08:49 BoogieIcfgContainer [2021-11-23 01:08:49,757 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 01:08:49,758 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2021-11-23 01:08:49,758 INFO L271 PluginConnector]: Initializing CodeCheck... [2021-11-23 01:08:49,770 INFO L275 PluginConnector]: CodeCheck initialized [2021-11-23 01:08:49,770 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:08:49" (1/1) ... [2021-11-23 01:08:49,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:08:49,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:08:49,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2021-11-23 01:08:49,858 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2021-11-23 01:08:49,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-23 01:08:49,865 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:08:49,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:08:50,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:08:50,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:08:50,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:08:50,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 145 states and 237 transitions. [2021-11-23 01:08:50,856 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 237 transitions. [2021-11-23 01:08:50,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-23 01:08:50,860 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:08:50,861 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:08:50,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:08:51,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 01:08:51,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:08:51,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 146 states and 238 transitions. [2021-11-23 01:08:51,267 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 238 transitions. [2021-11-23 01:08:51,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-23 01:08:51,277 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:08:51,278 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:08:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:08:51,352 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:08:51,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:08:51,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 150 states and 244 transitions. [2021-11-23 01:08:51,433 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 244 transitions. [2021-11-23 01:08:51,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-23 01:08:51,435 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:08:51,435 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:08:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:08:51,483 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 01:08:51,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:08:51,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 151 states and 245 transitions. [2021-11-23 01:08:51,627 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 245 transitions. [2021-11-23 01:08:51,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-23 01:08:51,628 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:08:51,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:08:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:08:51,713 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:08:51,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:08:51,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 159 states and 258 transitions. [2021-11-23 01:08:51,884 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 258 transitions. [2021-11-23 01:08:51,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-23 01:08:51,888 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:08:51,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:08:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:08:51,949 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:08:52,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:08:52,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 160 states and 259 transitions. [2021-11-23 01:08:52,061 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 259 transitions. [2021-11-23 01:08:52,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-23 01:08:52,064 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:08:52,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:08:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:08:52,108 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:08:52,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:08:52,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 168 states and 268 transitions. [2021-11-23 01:08:52,227 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 268 transitions. [2021-11-23 01:08:52,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-23 01:08:52,228 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:08:52,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:08:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:08:52,313 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:08:52,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:08:52,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 182 states and 286 transitions. [2021-11-23 01:08:52,597 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 286 transitions. [2021-11-23 01:08:52,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-23 01:08:52,599 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:08:52,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:08:52,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:08:52,709 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:08:53,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:08:53,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 197 states and 306 transitions. [2021-11-23 01:08:53,138 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 306 transitions. [2021-11-23 01:08:53,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-23 01:08:53,139 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:08:53,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:08:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:08:53,202 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:08:53,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:08:53,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 212 states and 327 transitions. [2021-11-23 01:08:53,824 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 327 transitions. [2021-11-23 01:08:53,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-23 01:08:53,827 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:08:53,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:08:53,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:08:53,883 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:08:54,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:08:54,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 230 states and 356 transitions. [2021-11-23 01:08:54,543 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2021-11-23 01:08:54,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-23 01:08:54,544 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:08:54,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:08:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:08:54,636 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:08:55,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:08:55,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 232 states and 369 transitions. [2021-11-23 01:08:55,018 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 369 transitions. [2021-11-23 01:08:55,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-23 01:08:55,019 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:08:55,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:08:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:08:55,087 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:08:55,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:08:55,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 246 states and 387 transitions. [2021-11-23 01:08:55,660 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 387 transitions. [2021-11-23 01:08:55,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-23 01:08:55,662 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:08:55,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:08:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:08:55,724 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:08:55,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:08:55,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 251 states and 393 transitions. [2021-11-23 01:08:55,848 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 393 transitions. [2021-11-23 01:08:55,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-23 01:08:55,858 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:08:55,859 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:08:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:08:55,913 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 01:08:56,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:08:56,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 252 states and 394 transitions. [2021-11-23 01:08:56,077 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 394 transitions. [2021-11-23 01:08:56,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-23 01:08:56,078 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:08:56,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:08:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:08:56,155 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:08:57,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:08:57,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 271 states and 424 transitions. [2021-11-23 01:08:57,084 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 424 transitions. [2021-11-23 01:08:57,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-23 01:08:57,086 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:08:57,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:08:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:08:57,138 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:08:57,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:08:57,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 272 states and 425 transitions. [2021-11-23 01:08:57,338 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 425 transitions. [2021-11-23 01:08:57,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-23 01:08:57,341 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:08:57,342 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:08:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:08:57,440 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:08:58,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:08:58,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 287 states and 444 transitions. [2021-11-23 01:08:58,061 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 444 transitions. [2021-11-23 01:08:58,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-11-23 01:08:58,063 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:08:58,063 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:08:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:08:58,099 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 01:08:58,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:08:58,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 305 states and 464 transitions. [2021-11-23 01:08:58,755 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 464 transitions. [2021-11-23 01:08:58,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-11-23 01:08:58,757 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:08:58,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:08:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:08:58,830 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:08:58,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:08:58,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 309 states and 468 transitions. [2021-11-23 01:08:58,872 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 468 transitions. [2021-11-23 01:08:58,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-23 01:08:58,874 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:08:58,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:08:58,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:08:58,911 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 01:08:59,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:08:59,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 313 states and 475 transitions. [2021-11-23 01:08:59,253 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 475 transitions. [2021-11-23 01:08:59,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-23 01:08:59,254 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:08:59,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:08:59,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:08:59,304 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 01:08:59,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:08:59,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 314 states and 477 transitions. [2021-11-23 01:08:59,442 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 477 transitions. [2021-11-23 01:08:59,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-23 01:08:59,443 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:08:59,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:08:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:08:59,478 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 01:08:59,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:08:59,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 322 states and 492 transitions. [2021-11-23 01:08:59,950 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 492 transitions. [2021-11-23 01:08:59,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-23 01:08:59,951 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:08:59,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:08:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:08:59,978 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 01:09:00,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:00,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 325 states and 496 transitions. [2021-11-23 01:09:00,114 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 496 transitions. [2021-11-23 01:09:00,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-23 01:09:00,118 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:00,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:00,167 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 01:09:00,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:00,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 328 states and 501 transitions. [2021-11-23 01:09:00,332 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 501 transitions. [2021-11-23 01:09:00,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-23 01:09:00,333 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:00,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:00,367 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 01:09:00,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:00,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 331 states and 506 transitions. [2021-11-23 01:09:00,586 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 506 transitions. [2021-11-23 01:09:00,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-23 01:09:00,587 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:00,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:00,618 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:09:01,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:01,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 346 states and 527 transitions. [2021-11-23 01:09:01,021 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 527 transitions. [2021-11-23 01:09:01,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-23 01:09:01,022 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:01,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:01,060 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:09:01,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:01,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 360 states and 544 transitions. [2021-11-23 01:09:01,371 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 544 transitions. [2021-11-23 01:09:01,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-23 01:09:01,373 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:01,374 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:01,473 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:09:01,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:01,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 362 states and 546 transitions. [2021-11-23 01:09:01,754 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 546 transitions. [2021-11-23 01:09:01,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-23 01:09:01,756 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:01,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:01,801 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 01:09:02,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:02,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 368 states and 553 transitions. [2021-11-23 01:09:02,124 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 553 transitions. [2021-11-23 01:09:02,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-23 01:09:02,126 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:02,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:02,173 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 01:09:02,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:02,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 372 states and 556 transitions. [2021-11-23 01:09:02,210 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 556 transitions. [2021-11-23 01:09:02,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-23 01:09:02,211 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:02,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:02,257 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:09:02,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:02,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 374 states and 559 transitions. [2021-11-23 01:09:02,300 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 559 transitions. [2021-11-23 01:09:02,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-23 01:09:02,301 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:02,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:02,377 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:09:02,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:02,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 388 states and 577 transitions. [2021-11-23 01:09:02,948 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 577 transitions. [2021-11-23 01:09:02,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-23 01:09:02,949 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:02,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:03,000 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:09:03,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:03,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 392 states and 582 transitions. [2021-11-23 01:09:03,256 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 582 transitions. [2021-11-23 01:09:03,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-11-23 01:09:03,258 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:03,259 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:03,304 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 01:09:03,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:03,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 394 states and 585 transitions. [2021-11-23 01:09:03,478 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 585 transitions. [2021-11-23 01:09:03,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-23 01:09:03,480 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:03,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:03,529 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:09:03,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:03,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 397 states and 589 transitions. [2021-11-23 01:09:03,591 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 589 transitions. [2021-11-23 01:09:03,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-23 01:09:03,592 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:03,592 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:03,641 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 01:09:04,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:04,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 406 states and 599 transitions. [2021-11-23 01:09:04,017 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 599 transitions. [2021-11-23 01:09:04,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-23 01:09:04,019 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:04,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:04,066 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 01:09:04,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:04,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 410 states and 602 transitions. [2021-11-23 01:09:04,378 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 602 transitions. [2021-11-23 01:09:04,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-23 01:09:04,382 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:04,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:04,433 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 01:09:04,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:04,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 413 states and 605 transitions. [2021-11-23 01:09:04,704 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 605 transitions. [2021-11-23 01:09:04,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-11-23 01:09:04,706 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:04,707 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:04,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:04,858 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:09:05,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:05,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 483 states and 683 transitions. [2021-11-23 01:09:05,475 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 683 transitions. [2021-11-23 01:09:05,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-11-23 01:09:05,477 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:05,477 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:05,522 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:09:05,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:05,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 497 states and 700 transitions. [2021-11-23 01:09:05,611 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 700 transitions. [2021-11-23 01:09:05,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-23 01:09:05,612 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:05,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:05,652 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:09:05,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:05,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 508 states and 714 transitions. [2021-11-23 01:09:05,834 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 714 transitions. [2021-11-23 01:09:05,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-11-23 01:09:05,835 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:05,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:05,881 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:09:06,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:06,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 532 states and 747 transitions. [2021-11-23 01:09:06,374 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 747 transitions. [2021-11-23 01:09:06,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-11-23 01:09:06,376 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:06,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:06,411 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:09:06,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:06,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 536 states and 751 transitions. [2021-11-23 01:09:06,631 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 751 transitions. [2021-11-23 01:09:06,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-11-23 01:09:06,632 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:06,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:06,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:06,666 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 01:09:06,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:06,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 538 states and 753 transitions. [2021-11-23 01:09:06,796 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 753 transitions. [2021-11-23 01:09:06,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-11-23 01:09:06,798 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:06,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:06,839 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 01:09:07,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:07,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 545 states and 760 transitions. [2021-11-23 01:09:07,162 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 760 transitions. [2021-11-23 01:09:07,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-11-23 01:09:07,166 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:07,167 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:07,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:07,222 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:09:08,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:08,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 583 states and 804 transitions. [2021-11-23 01:09:08,110 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 804 transitions. [2021-11-23 01:09:08,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-11-23 01:09:08,111 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:08,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:08,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:08,150 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:09:08,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:08,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 586 states and 806 transitions. [2021-11-23 01:09:08,412 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 806 transitions. [2021-11-23 01:09:08,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-11-23 01:09:08,413 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:08,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:08,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:08,457 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:09:08,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:08,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 589 states and 808 transitions. [2021-11-23 01:09:08,710 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 808 transitions. [2021-11-23 01:09:08,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-11-23 01:09:08,711 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:08,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:08,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:08,817 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:09:09,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:09,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 603 states and 825 transitions. [2021-11-23 01:09:09,067 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 825 transitions. [2021-11-23 01:09:09,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-11-23 01:09:09,068 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:09,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:09,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:09,109 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 01:09:09,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:09,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 612 states and 834 transitions. [2021-11-23 01:09:09,371 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 834 transitions. [2021-11-23 01:09:09,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-11-23 01:09:09,373 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:09,373 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:09,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:09,416 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:09:09,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:09,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 620 states and 843 transitions. [2021-11-23 01:09:09,614 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 843 transitions. [2021-11-23 01:09:09,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-11-23 01:09:09,615 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:09,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:09,685 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-11-23 01:09:11,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:11,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 717 states and 950 transitions. [2021-11-23 01:09:11,123 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 950 transitions. [2021-11-23 01:09:11,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-11-23 01:09:11,124 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:11,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:11,170 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-23 01:09:11,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:11,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 739 states and 973 transitions. [2021-11-23 01:09:11,671 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 973 transitions. [2021-11-23 01:09:11,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-11-23 01:09:11,672 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:11,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:11,713 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-23 01:09:11,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:11,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 742 states and 975 transitions. [2021-11-23 01:09:11,859 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 975 transitions. [2021-11-23 01:09:11,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-11-23 01:09:11,860 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:11,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:11,977 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-23 01:09:12,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:12,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 753 states and 988 transitions. [2021-11-23 01:09:12,297 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 988 transitions. [2021-11-23 01:09:12,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-11-23 01:09:12,298 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:12,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:12,344 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-23 01:09:12,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:12,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 767 states and 1005 transitions. [2021-11-23 01:09:12,791 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1005 transitions. [2021-11-23 01:09:12,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-11-23 01:09:12,792 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:12,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:12,840 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-23 01:09:13,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:13,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 786 states and 1025 transitions. [2021-11-23 01:09:13,303 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1025 transitions. [2021-11-23 01:09:13,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-23 01:09:13,304 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:13,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:13,367 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-23 01:09:13,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:13,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 791 states and 1029 transitions. [2021-11-23 01:09:13,540 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1029 transitions. [2021-11-23 01:09:13,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-23 01:09:13,542 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:13,542 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:13,595 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-23 01:09:13,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:13,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 796 states and 1033 transitions. [2021-11-23 01:09:13,754 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1033 transitions. [2021-11-23 01:09:13,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-11-23 01:09:13,755 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:13,755 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:13,799 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-11-23 01:09:13,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:13,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 799 states and 1036 transitions. [2021-11-23 01:09:13,860 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1036 transitions. [2021-11-23 01:09:13,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-11-23 01:09:13,862 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:13,863 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:13,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:13,962 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:09:14,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:14,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 822 states and 1059 transitions. [2021-11-23 01:09:14,189 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1059 transitions. [2021-11-23 01:09:14,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-11-23 01:09:14,192 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:14,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:14,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:14,265 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-11-23 01:09:14,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:14,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 823 states and 1059 transitions. [2021-11-23 01:09:14,315 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1059 transitions. [2021-11-23 01:09:14,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-11-23 01:09:14,319 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:14,319 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:14,386 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 01:09:14,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:14,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 843 states and 1079 transitions. [2021-11-23 01:09:14,753 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1079 transitions. [2021-11-23 01:09:14,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-11-23 01:09:14,754 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:14,755 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:14,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:14,807 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 01:09:15,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:15,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 845 states and 1082 transitions. [2021-11-23 01:09:15,173 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1082 transitions. [2021-11-23 01:09:15,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-11-23 01:09:15,174 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:15,175 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:15,220 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-11-23 01:09:15,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:15,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 856 states and 1094 transitions. [2021-11-23 01:09:15,293 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1094 transitions. [2021-11-23 01:09:15,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-11-23 01:09:15,294 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:15,294 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:15,345 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-23 01:09:16,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:16,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 887 states and 1129 transitions. [2021-11-23 01:09:16,455 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1129 transitions. [2021-11-23 01:09:16,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-11-23 01:09:16,456 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:16,457 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:16,512 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-23 01:09:17,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:17,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 932 states and 1184 transitions. [2021-11-23 01:09:17,188 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1184 transitions. [2021-11-23 01:09:17,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-11-23 01:09:17,189 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:17,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:17,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:17,249 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-23 01:09:17,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:17,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 941 states and 1193 transitions. [2021-11-23 01:09:17,671 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1193 transitions. [2021-11-23 01:09:17,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-11-23 01:09:17,674 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:17,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:17,787 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-23 01:09:17,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:17,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 942 states and 1193 transitions. [2021-11-23 01:09:17,965 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1193 transitions. [2021-11-23 01:09:17,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-11-23 01:09:17,967 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:17,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:18,397 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 91 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:09:22,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:22,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1015 states and 1291 transitions. [2021-11-23 01:09:22,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1291 transitions. [2021-11-23 01:09:22,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-11-23 01:09:22,455 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:22,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:22,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:22,558 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 91 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:09:23,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:23,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1027 states and 1302 transitions. [2021-11-23 01:09:23,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1302 transitions. [2021-11-23 01:09:23,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-11-23 01:09:23,797 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:23,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:23,883 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 91 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:09:24,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:24,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1036 states and 1313 transitions. [2021-11-23 01:09:24,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1313 transitions. [2021-11-23 01:09:24,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-11-23 01:09:24,529 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:24,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:24,618 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 91 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:09:24,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:24,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1040 states and 1318 transitions. [2021-11-23 01:09:24,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1318 transitions. [2021-11-23 01:09:24,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-11-23 01:09:24,956 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:24,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:25,039 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 91 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:09:25,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:25,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1044 states and 1323 transitions. [2021-11-23 01:09:25,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1323 transitions. [2021-11-23 01:09:25,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-11-23 01:09:25,411 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:25,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:25,461 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-23 01:09:26,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:26,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1083 states and 1380 transitions. [2021-11-23 01:09:26,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1380 transitions. [2021-11-23 01:09:26,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-11-23 01:09:26,746 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:26,746 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:26,798 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-23 01:09:28,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:28,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1112 states and 1414 transitions. [2021-11-23 01:09:28,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1414 transitions. [2021-11-23 01:09:28,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-11-23 01:09:28,039 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:28,040 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:28,093 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-23 01:09:28,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:28,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1116 states and 1417 transitions. [2021-11-23 01:09:28,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1417 transitions. [2021-11-23 01:09:28,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-11-23 01:09:28,480 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:28,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:28,539 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-23 01:09:28,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:28,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1121 states and 1422 transitions. [2021-11-23 01:09:28,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1422 transitions. [2021-11-23 01:09:28,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-11-23 01:09:28,892 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:28,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:29,383 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 90 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:09:33,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:33,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1205 states and 1526 transitions. [2021-11-23 01:09:33,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1526 transitions. [2021-11-23 01:09:33,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-11-23 01:09:33,119 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:33,120 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:33,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:33,515 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-23 01:09:35,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:35,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1261 states and 1582 transitions. [2021-11-23 01:09:35,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1582 transitions. [2021-11-23 01:09:35,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-11-23 01:09:35,216 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:35,216 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:35,295 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-23 01:09:35,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:35,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1276 states and 1597 transitions. [2021-11-23 01:09:35,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1597 transitions. [2021-11-23 01:09:35,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-11-23 01:09:35,445 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:35,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:35,507 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-23 01:09:36,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:36,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1292 states and 1612 transitions. [2021-11-23 01:09:36,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1612 transitions. [2021-11-23 01:09:36,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-11-23 01:09:36,179 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:36,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:36,230 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-23 01:09:36,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:36,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1303 states and 1622 transitions. [2021-11-23 01:09:36,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1303 states and 1622 transitions. [2021-11-23 01:09:36,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-11-23 01:09:36,943 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:36,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:37,006 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-23 01:09:37,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:37,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1312 states and 1632 transitions. [2021-11-23 01:09:37,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1632 transitions. [2021-11-23 01:09:37,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-11-23 01:09:37,698 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:37,698 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:37,750 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-23 01:09:37,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:37,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1315 states and 1634 transitions. [2021-11-23 01:09:37,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1634 transitions. [2021-11-23 01:09:37,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-11-23 01:09:37,962 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:37,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:37,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:38,008 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-11-23 01:09:39,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:39,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1323 states and 1641 transitions. [2021-11-23 01:09:39,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1641 transitions. [2021-11-23 01:09:39,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-11-23 01:09:39,035 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:39,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:39,091 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-11-23 01:09:39,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:39,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1348 states and 1668 transitions. [2021-11-23 01:09:39,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1668 transitions. [2021-11-23 01:09:39,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-11-23 01:09:39,768 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:39,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:39,830 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-11-23 01:09:40,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:40,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1352 states and 1671 transitions. [2021-11-23 01:09:40,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1671 transitions. [2021-11-23 01:09:40,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-11-23 01:09:40,228 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:40,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:40,290 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2021-11-23 01:09:41,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:41,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1375 states and 1697 transitions. [2021-11-23 01:09:41,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 1697 transitions. [2021-11-23 01:09:41,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-11-23 01:09:41,395 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:41,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:41,451 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-11-23 01:09:41,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:41,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1381 states and 1701 transitions. [2021-11-23 01:09:41,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1701 transitions. [2021-11-23 01:09:41,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2021-11-23 01:09:41,994 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:41,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:42,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:42,050 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-11-23 01:09:42,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:42,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1420 states and 1740 transitions. [2021-11-23 01:09:42,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 1740 transitions. [2021-11-23 01:09:42,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-11-23 01:09:42,260 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:42,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:42,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:42,337 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-11-23 01:09:42,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:42,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1421 states and 1740 transitions. [2021-11-23 01:09:42,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 1740 transitions. [2021-11-23 01:09:42,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2021-11-23 01:09:42,388 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:42,389 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:42,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:42,432 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-11-23 01:09:44,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:44,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1483 states and 1808 transitions. [2021-11-23 01:09:44,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 1808 transitions. [2021-11-23 01:09:44,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2021-11-23 01:09:44,694 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:44,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:44,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:44,732 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-11-23 01:09:45,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:45,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1494 states and 1817 transitions. [2021-11-23 01:09:45,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1817 transitions. [2021-11-23 01:09:45,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-11-23 01:09:45,456 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:45,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:45,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:45,503 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-11-23 01:09:45,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:45,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1831 states to 1506 states and 1831 transitions. [2021-11-23 01:09:45,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 1831 transitions. [2021-11-23 01:09:45,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-11-23 01:09:45,821 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:45,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:45,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:45,882 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-11-23 01:09:46,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:46,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1508 states and 1833 transitions. [2021-11-23 01:09:46,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 1833 transitions. [2021-11-23 01:09:46,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-11-23 01:09:46,118 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:46,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:46,172 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-11-23 01:09:46,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:46,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1517 states and 1841 transitions. [2021-11-23 01:09:46,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 1841 transitions. [2021-11-23 01:09:46,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-11-23 01:09:46,810 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:46,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:46,853 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2021-11-23 01:09:47,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:47,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1520 states and 1842 transitions. [2021-11-23 01:09:47,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 1842 transitions. [2021-11-23 01:09:47,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-11-23 01:09:47,229 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:47,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:47,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:47,281 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2021-11-23 01:09:47,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:47,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1524 states and 1848 transitions. [2021-11-23 01:09:47,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 1848 transitions. [2021-11-23 01:09:47,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-11-23 01:09:47,674 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:47,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:48,318 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 145 proven. 23 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-11-23 01:09:50,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:50,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1558 states and 1889 transitions. [2021-11-23 01:09:50,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 1889 transitions. [2021-11-23 01:09:50,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-11-23 01:09:50,387 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:50,387 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:50,434 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-11-23 01:09:50,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:50,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1560 states and 1890 transitions. [2021-11-23 01:09:50,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 1890 transitions. [2021-11-23 01:09:50,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-11-23 01:09:50,624 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:50,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:50,671 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-11-23 01:09:50,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:50,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1562 states and 1891 transitions. [2021-11-23 01:09:50,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 1891 transitions. [2021-11-23 01:09:50,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-11-23 01:09:50,875 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:50,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:50,913 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-11-23 01:09:51,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:51,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1564 states and 1892 transitions. [2021-11-23 01:09:51,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 1892 transitions. [2021-11-23 01:09:51,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-11-23 01:09:51,108 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:51,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:51,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:51,175 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2021-11-23 01:09:51,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:51,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1565 states and 1892 transitions. [2021-11-23 01:09:51,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 1892 transitions. [2021-11-23 01:09:51,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2021-11-23 01:09:51,232 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:51,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:51,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:51,638 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 194 proven. 35 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-11-23 01:09:52,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:52,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1590 states and 1920 transitions. [2021-11-23 01:09:52,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 1920 transitions. [2021-11-23 01:09:52,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2021-11-23 01:09:52,739 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:52,739 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:52,805 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-23 01:09:53,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:53,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1980 states to 1650 states and 1980 transitions. [2021-11-23 01:09:53,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 1980 transitions. [2021-11-23 01:09:53,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2021-11-23 01:09:53,222 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:53,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:53,279 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2021-11-23 01:09:53,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:53,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1981 states to 1652 states and 1981 transitions. [2021-11-23 01:09:53,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 1981 transitions. [2021-11-23 01:09:53,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2021-11-23 01:09:53,333 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:53,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 01:09:53,372 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 01:09:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 01:09:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 01:09:53,652 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 01:09:53,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 01:09:53,817 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 109 iterations. [2021-11-23 01:09:54,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 01:09:54 ImpRootNode [2021-11-23 01:09:54,134 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2021-11-23 01:09:54,135 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-23 01:09:54,135 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-23 01:09:54,135 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-23 01:09:54,136 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:08:49" (3/4) ... [2021-11-23 01:09:54,138 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-23 01:09:54,415 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31c6c6fa-3037-4d74-9742-e2f672c242ca/bin/ukojak-LBtLqBUTdQ/witness.graphml [2021-11-23 01:09:54,415 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-23 01:09:54,416 INFO L158 Benchmark]: Toolchain (without parser) took 67196.68ms. Allocated memory was 98.6MB in the beginning and 645.9MB in the end (delta: 547.4MB). Free memory was 65.2MB in the beginning and 274.0MB in the end (delta: -208.8MB). Peak memory consumption was 340.4MB. Max. memory is 16.1GB. [2021-11-23 01:09:54,417 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 98.6MB. Free memory is still 68.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 01:09:54,418 INFO L158 Benchmark]: CACSL2BoogieTranslator took 732.56ms. Allocated memory was 98.6MB in the beginning and 121.6MB in the end (delta: 23.1MB). Free memory was 65.0MB in the beginning and 90.0MB in the end (delta: -24.9MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. [2021-11-23 01:09:54,418 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.48ms. Allocated memory is still 121.6MB. Free memory was 90.0MB in the beginning and 84.2MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-23 01:09:54,419 INFO L158 Benchmark]: Boogie Preprocessor took 99.94ms. Allocated memory is still 121.6MB. Free memory was 84.2MB in the beginning and 80.0MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-23 01:09:54,419 INFO L158 Benchmark]: RCFGBuilder took 1601.79ms. Allocated memory is still 121.6MB. Free memory was 80.0MB in the beginning and 78.1MB in the end (delta: 1.9MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. [2021-11-23 01:09:54,420 INFO L158 Benchmark]: CodeCheck took 64376.09ms. Allocated memory was 121.6MB in the beginning and 645.9MB in the end (delta: 524.3MB). Free memory was 78.1MB in the beginning and 303.4MB in the end (delta: -225.3MB). Peak memory consumption was 300.1MB. Max. memory is 16.1GB. [2021-11-23 01:09:54,420 INFO L158 Benchmark]: Witness Printer took 280.67ms. Allocated memory is still 645.9MB. Free memory was 303.4MB in the beginning and 274.0MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2021-11-23 01:09:54,423 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: 64.0s, OverallIterations: 109, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 172647 SdHoareTripleChecker+Valid, 455.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 169220 mSDsluCounter, 26470 SdHoareTripleChecker+Invalid, 374.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22260 mSDsCounter, 55995 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 387315 IncrementalHoareTripleChecker+Invalid, 443310 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55995 mSolverCounterUnsat, 4210 mSDtfsCounter, 387315 mSolverCounterSat, 4.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 102912 GetRequests, 99756 SyntacticMatches, 2452 SemanticMatches, 704 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303942 ImplicationChecksByTransitivity, 44.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.7s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 14622 NumberOfCodeBlocks, 14622 NumberOfCodeBlocksAsserted, 109 NumberOfCheckSat, 14301 ConstructedInterpolants, 0 QuantifiedInterpolants, 42854 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 108 InterpolantComputations, 100 PerfectInterpolantSequences, 8861/9104 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 417]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int d= 4; [L19] int e= 5; [L20] int f= 6; [L21] int c= 3; [L22] int b= 2; [L25] int u = 21; [L26] int v = 22; [L27] int w = 23; [L28] int x = 24; [L29] int y = 25; [L30] int z = 26; [L32] int a17 = 1; [L33] int a7 = 0; [L34] int a20 = 1; [L35] int a8 = 15; [L36] int a12 = 8; [L37] int a16 = 5; [L38] int a21 = 1; [L590] int output = -1; VAL [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)=3, 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=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=0, a7=1, a8=13, 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=0, a7=1, a8=13, 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=0, a7=1, a8=13, 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=0, a7=1, a8=13, 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=0, a7=1, a8=13, 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=0, a7=1, a8=13, 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=0, a7=1, a8=13, 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=0, a7=1, a8=13, 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=0, a7=1, a8=13, 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=0, a7=1, a8=13, 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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND TRUE (((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1)) [L113] a20 = 0 [L114] a8 = 15 [L115] a17 = 0 [L116] a21 = 1 [L117] return -1; VAL [\old(input)=3, \result=-1, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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=0, a20=0, a21=1, a7=1, a8=15, 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 FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L410] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L413] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L416] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1)) VAL [\old(input)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L417] reach_error() VAL [\old(input)=5, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=5, 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.33ms. Allocated memory is still 98.6MB. Free memory is still 68.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 732.56ms. Allocated memory was 98.6MB in the beginning and 121.6MB in the end (delta: 23.1MB). Free memory was 65.0MB in the beginning and 90.0MB in the end (delta: -24.9MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.48ms. Allocated memory is still 121.6MB. Free memory was 90.0MB in the beginning and 84.2MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.94ms. Allocated memory is still 121.6MB. Free memory was 84.2MB in the beginning and 80.0MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1601.79ms. Allocated memory is still 121.6MB. Free memory was 80.0MB in the beginning and 78.1MB in the end (delta: 1.9MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. * CodeCheck took 64376.09ms. Allocated memory was 121.6MB in the beginning and 645.9MB in the end (delta: 524.3MB). Free memory was 78.1MB in the beginning and 303.4MB in the end (delta: -225.3MB). Peak memory consumption was 300.1MB. Max. memory is 16.1GB. * Witness Printer took 280.67ms. Allocated memory is still 645.9MB. Free memory was 303.4MB in the beginning and 274.0MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2021-11-23 01:09:54,499 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31c6c6fa-3037-4d74-9742-e2f672c242ca/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE