./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label59.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6027edd3-b92a-461d-a421-bae0b4d2b060/bin/ukojak-rkRKPMF4O4/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6027edd3-b92a-461d-a421-bae0b4d2b060/bin/ukojak-rkRKPMF4O4/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6027edd3-b92a-461d-a421-bae0b4d2b060/bin/ukojak-rkRKPMF4O4/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6027edd3-b92a-461d-a421-bae0b4d2b060/bin/ukojak-rkRKPMF4O4/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label59.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6027edd3-b92a-461d-a421-bae0b4d2b060/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6027edd3-b92a-461d-a421-bae0b4d2b060/bin/ukojak-rkRKPMF4O4 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ebf0329a50f76ec68cef55e212088793910caa2b453acd0416a520032501892b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 21:47:28,706 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 21:47:28,708 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 21:47:28,727 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 21:47:28,728 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 21:47:28,729 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 21:47:28,730 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 21:47:28,732 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 21:47:28,733 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 21:47:28,734 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 21:47:28,735 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 21:47:28,736 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 21:47:28,737 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 21:47:28,738 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 21:47:28,739 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 21:47:28,740 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 21:47:28,741 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 21:47:28,742 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 21:47:28,744 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 21:47:28,745 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 21:47:28,747 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 21:47:28,748 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 21:47:28,749 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 21:47:28,750 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 21:47:28,754 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 21:47:28,754 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 21:47:28,755 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 21:47:28,756 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 21:47:28,756 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 21:47:28,757 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 21:47:28,757 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 21:47:28,758 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 21:47:28,759 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 21:47:28,760 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 21:47:28,761 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 21:47:28,761 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 21:47:28,761 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 21:47:28,762 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 21:47:28,762 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 21:47:28,763 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 21:47:28,763 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 21:47:28,764 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6027edd3-b92a-461d-a421-bae0b4d2b060/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-12-14 21:47:28,784 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 21:47:28,784 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 21:47:28,785 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 21:47:28,785 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-12-14 21:47:28,786 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 21:47:28,786 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 21:47:28,786 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 21:47:28,787 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 21:47:28,787 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 21:47:28,787 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 21:47:28,787 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 21:47:28,787 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 21:47:28,787 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 21:47:28,788 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 21:47:28,788 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 21:47:28,788 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 21:47:28,788 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 21:47:28,788 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 21:47:28,789 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-12-14 21:47:28,789 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-12-14 21:47:28,789 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 21:47:28,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 21:47:28,789 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 21:47:28,790 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 21:47:28,790 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 21:47:28,790 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-12-14 21:47:28,790 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 21:47:28,790 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 21:47:28,790 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_6027edd3-b92a-461d-a421-bae0b4d2b060/bin/ukojak-rkRKPMF4O4/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6027edd3-b92a-461d-a421-bae0b4d2b060/bin/ukojak-rkRKPMF4O4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ebf0329a50f76ec68cef55e212088793910caa2b453acd0416a520032501892b [2022-12-14 21:47:28,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 21:47:29,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 21:47:29,020 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 21:47:29,021 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 21:47:29,021 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 21:47:29,022 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6027edd3-b92a-461d-a421-bae0b4d2b060/bin/ukojak-rkRKPMF4O4/../../sv-benchmarks/c/eca-rers2012/Problem02_label59.c [2022-12-14 21:47:31,603 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 21:47:31,802 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 21:47:31,803 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6027edd3-b92a-461d-a421-bae0b4d2b060/sv-benchmarks/c/eca-rers2012/Problem02_label59.c [2022-12-14 21:47:31,812 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6027edd3-b92a-461d-a421-bae0b4d2b060/bin/ukojak-rkRKPMF4O4/data/69f80ae0e/f4f20b15b956499781943178f6adc7a2/FLAGb04f11430 [2022-12-14 21:47:31,826 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6027edd3-b92a-461d-a421-bae0b4d2b060/bin/ukojak-rkRKPMF4O4/data/69f80ae0e/f4f20b15b956499781943178f6adc7a2 [2022-12-14 21:47:31,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 21:47:31,830 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 21:47:31,831 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 21:47:31,831 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 21:47:31,835 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 21:47:31,835 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:47:31" (1/1) ... [2022-12-14 21:47:31,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a36464a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:47:31, skipping insertion in model container [2022-12-14 21:47:31,836 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:47:31" (1/1) ... [2022-12-14 21:47:31,844 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 21:47:31,882 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 21:47:32,111 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6027edd3-b92a-461d-a421-bae0b4d2b060/sv-benchmarks/c/eca-rers2012/Problem02_label59.c[14857,14870] [2022-12-14 21:47:32,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 21:47:32,153 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 21:47:32,213 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6027edd3-b92a-461d-a421-bae0b4d2b060/sv-benchmarks/c/eca-rers2012/Problem02_label59.c[14857,14870] [2022-12-14 21:47:32,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 21:47:32,246 INFO L208 MainTranslator]: Completed translation [2022-12-14 21:47:32,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:47:32 WrapperNode [2022-12-14 21:47:32,246 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 21:47:32,247 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 21:47:32,248 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 21:47:32,248 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 21:47:32,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:47:32" (1/1) ... [2022-12-14 21:47:32,271 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:47:32" (1/1) ... [2022-12-14 21:47:32,310 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2022-12-14 21:47:32,311 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 21:47:32,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 21:47:32,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 21:47:32,312 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 21:47:32,319 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:47:32" (1/1) ... [2022-12-14 21:47:32,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:47:32" (1/1) ... [2022-12-14 21:47:32,322 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:47:32" (1/1) ... [2022-12-14 21:47:32,322 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:47:32" (1/1) ... [2022-12-14 21:47:32,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:47:32" (1/1) ... [2022-12-14 21:47:32,339 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:47:32" (1/1) ... [2022-12-14 21:47:32,342 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:47:32" (1/1) ... [2022-12-14 21:47:32,345 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:47:32" (1/1) ... [2022-12-14 21:47:32,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 21:47:32,350 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 21:47:32,350 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 21:47:32,350 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 21:47:32,351 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:47:32" (1/1) ... [2022-12-14 21:47:32,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 21:47:32,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6027edd3-b92a-461d-a421-bae0b4d2b060/bin/ukojak-rkRKPMF4O4/z3 [2022-12-14 21:47:32,374 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6027edd3-b92a-461d-a421-bae0b4d2b060/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-12-14 21:47:32,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6027edd3-b92a-461d-a421-bae0b4d2b060/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-12-14 21:47:32,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 21:47:32,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 21:47:32,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 21:47:32,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 21:47:32,479 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 21:47:32,481 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 21:47:33,225 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 21:47:33,412 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 21:47:33,412 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 21:47:33,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:47:33 BoogieIcfgContainer [2022-12-14 21:47:33,414 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 21:47:33,415 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-12-14 21:47:33,415 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-12-14 21:47:33,422 INFO L275 PluginConnector]: CodeCheck initialized [2022-12-14 21:47:33,422 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:47:33" (1/1) ... [2022-12-14 21:47:33,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 21:47:33,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:33,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2022-12-14 21:47:33,466 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2022-12-14 21:47:33,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-14 21:47:33,469 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:33,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:33,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:34,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:34,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 163 states and 295 transitions. [2022-12-14 21:47:34,187 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 295 transitions. [2022-12-14 21:47:34,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-14 21:47:34,189 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:34,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:34,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:34,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:34,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 166 states and 300 transitions. [2022-12-14 21:47:34,379 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 300 transitions. [2022-12-14 21:47:34,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-12-14 21:47:34,380 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:34,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:34,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:35,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:35,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 245 states and 382 transitions. [2022-12-14 21:47:35,114 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 382 transitions. [2022-12-14 21:47:35,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-12-14 21:47:35,117 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:35,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:35,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:35,172 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:35,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:35,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 250 states and 391 transitions. [2022-12-14 21:47:35,274 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 391 transitions. [2022-12-14 21:47:35,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-12-14 21:47:35,277 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:35,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:35,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:35,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:35,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 253 states and 395 transitions. [2022-12-14 21:47:35,389 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 395 transitions. [2022-12-14 21:47:35,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-14 21:47:35,390 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:35,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:35,476 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:35,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:35,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 257 states and 403 transitions. [2022-12-14 21:47:35,666 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 403 transitions. [2022-12-14 21:47:35,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-12-14 21:47:35,667 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:35,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:35,714 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:35,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:35,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 266 states and 416 transitions. [2022-12-14 21:47:35,910 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 416 transitions. [2022-12-14 21:47:35,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-12-14 21:47:35,911 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:35,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:35,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:35,981 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:36,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:36,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 269 states and 424 transitions. [2022-12-14 21:47:36,184 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 424 transitions. [2022-12-14 21:47:36,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-12-14 21:47:36,185 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:36,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:36,250 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:36,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:36,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 272 states and 430 transitions. [2022-12-14 21:47:36,430 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 430 transitions. [2022-12-14 21:47:36,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-12-14 21:47:36,432 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:36,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:36,498 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:36,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:36,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 274 states and 431 transitions. [2022-12-14 21:47:36,589 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 431 transitions. [2022-12-14 21:47:36,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-12-14 21:47:36,589 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:36,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:36,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:36,673 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:36,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:36,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 278 states and 438 transitions. [2022-12-14 21:47:36,950 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 438 transitions. [2022-12-14 21:47:36,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-12-14 21:47:36,951 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:36,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:37,001 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:37,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:37,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 281 states and 441 transitions. [2022-12-14 21:47:37,038 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 441 transitions. [2022-12-14 21:47:37,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-12-14 21:47:37,039 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:37,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:37,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:37,090 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 21:47:37,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:37,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 288 states and 453 transitions. [2022-12-14 21:47:37,520 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 453 transitions. [2022-12-14 21:47:37,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-12-14 21:47:37,521 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:37,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:37,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:37,567 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 21:47:37,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:37,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 290 states and 454 transitions. [2022-12-14 21:47:37,681 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 454 transitions. [2022-12-14 21:47:37,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-12-14 21:47:37,683 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:37,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:37,762 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:37,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:37,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 291 states and 455 transitions. [2022-12-14 21:47:37,843 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 455 transitions. [2022-12-14 21:47:37,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-12-14 21:47:37,844 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:37,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:37,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:37,882 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:37,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:37,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 293 states and 457 transitions. [2022-12-14 21:47:37,908 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 457 transitions. [2022-12-14 21:47:37,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-14 21:47:37,909 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:37,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:37,940 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 21:47:38,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:38,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 306 states and 474 transitions. [2022-12-14 21:47:38,075 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 474 transitions. [2022-12-14 21:47:38,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-12-14 21:47:38,077 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:38,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:38,130 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:38,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:38,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 313 states and 481 transitions. [2022-12-14 21:47:38,177 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 481 transitions. [2022-12-14 21:47:38,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-12-14 21:47:38,178 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:38,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:38,229 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 21:47:38,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:38,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 314 states and 482 transitions. [2022-12-14 21:47:38,355 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 482 transitions. [2022-12-14 21:47:38,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-12-14 21:47:38,356 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:38,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:38,420 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:38,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:38,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 331 states and 502 transitions. [2022-12-14 21:47:38,551 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 502 transitions. [2022-12-14 21:47:38,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-12-14 21:47:38,552 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:38,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:38,639 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:39,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:39,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 355 states and 532 transitions. [2022-12-14 21:47:39,137 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 532 transitions. [2022-12-14 21:47:39,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-12-14 21:47:39,138 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:39,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:39,185 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:39,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:39,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 357 states and 535 transitions. [2022-12-14 21:47:39,272 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 535 transitions. [2022-12-14 21:47:39,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-12-14 21:47:39,273 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:39,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:39,303 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:39,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:39,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 363 states and 543 transitions. [2022-12-14 21:47:39,399 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 543 transitions. [2022-12-14 21:47:39,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-12-14 21:47:39,400 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:39,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:39,456 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:40,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:40,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 387 states and 575 transitions. [2022-12-14 21:47:40,406 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 575 transitions. [2022-12-14 21:47:40,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-12-14 21:47:40,407 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:40,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:40,465 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:40,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:40,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 410 states and 601 transitions. [2022-12-14 21:47:40,718 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 601 transitions. [2022-12-14 21:47:40,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-12-14 21:47:40,719 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:40,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:40,782 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:40,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:40,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 412 states and 602 transitions. [2022-12-14 21:47:40,912 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 602 transitions. [2022-12-14 21:47:40,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-12-14 21:47:40,913 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:40,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:40,970 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 21:47:41,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:41,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 436 states and 633 transitions. [2022-12-14 21:47:41,777 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 633 transitions. [2022-12-14 21:47:41,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-12-14 21:47:41,778 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:41,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:41,822 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 21:47:41,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:41,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 438 states and 634 transitions. [2022-12-14 21:47:41,970 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 634 transitions. [2022-12-14 21:47:41,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-12-14 21:47:41,970 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:41,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:42,062 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:42,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:42,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 517 states and 726 transitions. [2022-12-14 21:47:42,651 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 726 transitions. [2022-12-14 21:47:42,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-12-14 21:47:42,652 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:42,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:42,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:42,702 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:42,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:42,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 522 states and 732 transitions. [2022-12-14 21:47:42,742 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 732 transitions. [2022-12-14 21:47:42,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-12-14 21:47:42,744 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:42,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:42,780 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 21:47:43,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:43,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 526 states and 737 transitions. [2022-12-14 21:47:43,095 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 737 transitions. [2022-12-14 21:47:43,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-12-14 21:47:43,096 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:43,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:43,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:43,336 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:44,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:44,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 558 states and 776 transitions. [2022-12-14 21:47:44,040 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 776 transitions. [2022-12-14 21:47:44,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-12-14 21:47:44,040 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:44,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:44,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:44,083 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:44,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:44,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 566 states and 786 transitions. [2022-12-14 21:47:44,139 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 786 transitions. [2022-12-14 21:47:44,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-14 21:47:44,140 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:44,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:44,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:44,195 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:44,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:44,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 573 states and 793 transitions. [2022-12-14 21:47:44,237 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 793 transitions. [2022-12-14 21:47:44,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-14 21:47:44,238 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:44,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:44,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:44,295 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:44,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:44,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 580 states and 803 transitions. [2022-12-14 21:47:44,448 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 803 transitions. [2022-12-14 21:47:44,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-14 21:47:44,449 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:44,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:44,481 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:44,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:44,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 584 states and 810 transitions. [2022-12-14 21:47:44,801 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 810 transitions. [2022-12-14 21:47:44,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-14 21:47:44,802 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:44,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:44,831 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:44,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:44,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 589 states and 816 transitions. [2022-12-14 21:47:44,962 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 816 transitions. [2022-12-14 21:47:44,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-12-14 21:47:44,963 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:44,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:45,002 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 21:47:45,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:45,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 595 states and 822 transitions. [2022-12-14 21:47:45,057 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 822 transitions. [2022-12-14 21:47:45,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-12-14 21:47:45,058 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:45,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:45,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:45,149 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:45,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:45,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 608 states and 837 transitions. [2022-12-14 21:47:45,422 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 837 transitions. [2022-12-14 21:47:45,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-12-14 21:47:45,423 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:45,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:45,461 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 21:47:46,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:46,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 618 states and 862 transitions. [2022-12-14 21:47:46,196 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 862 transitions. [2022-12-14 21:47:46,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-12-14 21:47:46,197 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:46,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:46,248 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 21:47:46,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:46,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 626 states and 872 transitions. [2022-12-14 21:47:46,536 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 872 transitions. [2022-12-14 21:47:46,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-12-14 21:47:46,537 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:46,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:46,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:46,568 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 21:47:47,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:47,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 635 states and 889 transitions. [2022-12-14 21:47:47,249 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 889 transitions. [2022-12-14 21:47:47,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-12-14 21:47:47,250 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:47,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:47,282 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 21:47:47,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:47,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 637 states and 892 transitions. [2022-12-14 21:47:47,493 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 892 transitions. [2022-12-14 21:47:47,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-12-14 21:47:47,493 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:47,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:47,603 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 21:47:48,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:48,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 651 states and 914 transitions. [2022-12-14 21:47:48,073 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 914 transitions. [2022-12-14 21:47:48,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-12-14 21:47:48,074 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:48,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:48,122 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 21:47:48,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:48,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 663 states and 930 transitions. [2022-12-14 21:47:48,636 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 930 transitions. [2022-12-14 21:47:48,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-12-14 21:47:48,636 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:48,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:48,673 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 21:47:48,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:48,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 669 states and 937 transitions. [2022-12-14 21:47:48,708 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 937 transitions. [2022-12-14 21:47:48,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-12-14 21:47:48,709 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:48,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:48,746 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:48,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:48,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 675 states and 943 transitions. [2022-12-14 21:47:48,780 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 943 transitions. [2022-12-14 21:47:48,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-12-14 21:47:48,781 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:48,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:48,852 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 21:47:49,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:49,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 683 states and 954 transitions. [2022-12-14 21:47:49,457 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 954 transitions. [2022-12-14 21:47:49,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-12-14 21:47:49,458 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:49,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:49,531 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 21:47:49,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:49,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 684 states and 957 transitions. [2022-12-14 21:47:49,777 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 957 transitions. [2022-12-14 21:47:49,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-12-14 21:47:49,778 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:49,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:49,831 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:49,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:49,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 699 states and 974 transitions. [2022-12-14 21:47:49,899 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 974 transitions. [2022-12-14 21:47:49,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-12-14 21:47:49,900 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:49,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:49,960 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-14 21:47:50,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:50,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 705 states and 982 transitions. [2022-12-14 21:47:50,356 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 982 transitions. [2022-12-14 21:47:50,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-12-14 21:47:50,357 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:50,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:50,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:50,394 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-14 21:47:50,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:50,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 710 states and 989 transitions. [2022-12-14 21:47:50,884 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 989 transitions. [2022-12-14 21:47:50,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-12-14 21:47:50,885 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:50,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:50,950 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 47 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 21:47:51,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:51,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 747 states and 1030 transitions. [2022-12-14 21:47:51,833 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1030 transitions. [2022-12-14 21:47:51,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-12-14 21:47:51,834 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:51,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:51,873 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:52,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:52,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 783 states and 1069 transitions. [2022-12-14 21:47:52,893 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1069 transitions. [2022-12-14 21:47:52,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-12-14 21:47:52,894 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:52,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:52,926 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:52,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:52,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 786 states and 1072 transitions. [2022-12-14 21:47:52,966 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1072 transitions. [2022-12-14 21:47:52,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-12-14 21:47:52,967 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:52,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:52,998 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:53,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:53,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 787 states and 1073 transitions. [2022-12-14 21:47:53,029 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1073 transitions. [2022-12-14 21:47:53,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-12-14 21:47:53,030 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:53,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:53,062 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 21:47:53,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:53,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 818 states and 1107 transitions. [2022-12-14 21:47:53,512 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1107 transitions. [2022-12-14 21:47:53,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-12-14 21:47:53,512 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:53,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:53,544 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 21:47:53,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:53,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 833 states and 1123 transitions. [2022-12-14 21:47:53,828 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1123 transitions. [2022-12-14 21:47:53,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-12-14 21:47:53,828 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:53,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:53,868 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:53,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:53,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 840 states and 1131 transitions. [2022-12-14 21:47:53,930 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1131 transitions. [2022-12-14 21:47:53,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-12-14 21:47:53,931 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:53,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:53,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:53,971 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 21:47:54,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:54,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 863 states and 1160 transitions. [2022-12-14 21:47:54,707 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1160 transitions. [2022-12-14 21:47:54,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-12-14 21:47:54,708 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:54,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:54,757 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 21:47:54,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:54,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 866 states and 1163 transitions. [2022-12-14 21:47:54,798 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1163 transitions. [2022-12-14 21:47:54,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-12-14 21:47:54,798 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:54,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:54,856 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:55,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:55,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 945 states and 1249 transitions. [2022-12-14 21:47:55,554 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1249 transitions. [2022-12-14 21:47:55,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-12-14 21:47:55,555 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:55,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:55,597 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 21:47:55,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:55,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 958 states and 1265 transitions. [2022-12-14 21:47:55,878 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1265 transitions. [2022-12-14 21:47:55,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-12-14 21:47:55,879 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:55,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:56,075 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 54 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:58,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:58,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1008 states and 1325 transitions. [2022-12-14 21:47:58,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1325 transitions. [2022-12-14 21:47:58,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-12-14 21:47:58,733 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:58,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:58,841 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 54 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:47:59,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:59,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1010 states and 1326 transitions. [2022-12-14 21:47:59,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1326 transitions. [2022-12-14 21:47:59,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-12-14 21:47:59,146 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:59,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:59,179 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-12-14 21:47:59,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:47:59,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1017 states and 1333 transitions. [2022-12-14 21:47:59,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1333 transitions. [2022-12-14 21:47:59,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-12-14 21:47:59,227 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:47:59,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:47:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:47:59,261 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 21:48:00,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:00,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1047 states and 1367 transitions. [2022-12-14 21:48:00,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1367 transitions. [2022-12-14 21:48:00,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-12-14 21:48:00,102 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:00,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:00,137 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 21:48:00,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:00,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1066 states and 1386 transitions. [2022-12-14 21:48:00,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1386 transitions. [2022-12-14 21:48:00,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-12-14 21:48:00,511 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:00,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:00,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:00,577 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 21:48:00,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:00,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1071 states and 1391 transitions. [2022-12-14 21:48:00,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1391 transitions. [2022-12-14 21:48:00,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-12-14 21:48:00,954 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:00,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:00,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:00,989 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 21:48:01,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:01,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1074 states and 1395 transitions. [2022-12-14 21:48:01,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1395 transitions. [2022-12-14 21:48:01,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-12-14 21:48:01,325 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:01,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:01,360 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 21:48:01,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:01,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1076 states and 1396 transitions. [2022-12-14 21:48:01,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1396 transitions. [2022-12-14 21:48:01,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-12-14 21:48:01,468 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:01,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:01,509 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:48:01,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:01,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1084 states and 1405 transitions. [2022-12-14 21:48:01,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1405 transitions. [2022-12-14 21:48:01,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-12-14 21:48:01,556 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:01,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:01,588 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:48:01,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:01,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1085 states and 1407 transitions. [2022-12-14 21:48:01,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1407 transitions. [2022-12-14 21:48:01,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-12-14 21:48:01,807 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:01,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:01,842 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:48:03,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:03,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1111 states and 1445 transitions. [2022-12-14 21:48:03,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1445 transitions. [2022-12-14 21:48:03,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-12-14 21:48:03,110 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:03,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:03,160 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 21:48:03,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:03,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1157 states and 1497 transitions. [2022-12-14 21:48:03,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1497 transitions. [2022-12-14 21:48:03,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-12-14 21:48:03,650 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:03,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:03,722 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:48:03,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:03,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1184 states and 1527 transitions. [2022-12-14 21:48:03,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1527 transitions. [2022-12-14 21:48:03,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-12-14 21:48:03,907 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:03,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:03,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:03,966 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:48:04,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:04,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1211 states and 1558 transitions. [2022-12-14 21:48:04,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1558 transitions. [2022-12-14 21:48:04,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-12-14 21:48:04,985 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:04,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:05,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:05,037 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 21:48:05,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:05,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1225 states and 1577 transitions. [2022-12-14 21:48:05,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1577 transitions. [2022-12-14 21:48:05,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-12-14 21:48:05,510 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:05,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:05,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:05,545 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 21:48:05,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:05,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1228 states and 1581 transitions. [2022-12-14 21:48:05,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1581 transitions. [2022-12-14 21:48:05,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-12-14 21:48:05,810 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:05,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:05,872 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 21:48:06,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:06,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1241 states and 1596 transitions. [2022-12-14 21:48:06,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1596 transitions. [2022-12-14 21:48:06,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-12-14 21:48:06,143 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:06,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:06,217 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 21:48:06,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:06,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1254 states and 1611 transitions. [2022-12-14 21:48:06,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1611 transitions. [2022-12-14 21:48:06,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-12-14 21:48:06,717 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:06,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:06,757 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 21:48:06,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:06,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1257 states and 1614 transitions. [2022-12-14 21:48:06,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1614 transitions. [2022-12-14 21:48:06,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-12-14 21:48:06,803 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:06,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:06,847 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 21:48:06,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:06,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1259 states and 1616 transitions. [2022-12-14 21:48:06,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 1616 transitions. [2022-12-14 21:48:06,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-12-14 21:48:06,898 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:06,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:06,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:06,938 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:48:07,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:07,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1272 states and 1630 transitions. [2022-12-14 21:48:07,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1630 transitions. [2022-12-14 21:48:07,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-12-14 21:48:07,016 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:07,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:07,076 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 70 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 21:48:08,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:08,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1316 states and 1679 transitions. [2022-12-14 21:48:08,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1679 transitions. [2022-12-14 21:48:08,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-12-14 21:48:08,608 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:08,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:08,646 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:48:09,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:09,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1343 states and 1708 transitions. [2022-12-14 21:48:09,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1708 transitions. [2022-12-14 21:48:09,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-12-14 21:48:09,229 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:09,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:09,264 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 21:48:10,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:10,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1368 states and 1736 transitions. [2022-12-14 21:48:10,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 1736 transitions. [2022-12-14 21:48:10,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-12-14 21:48:10,427 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:10,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:10,510 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 21:48:10,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:10,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1370 states and 1738 transitions. [2022-12-14 21:48:10,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1738 transitions. [2022-12-14 21:48:10,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-12-14 21:48:10,546 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:10,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:10,611 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 21:48:10,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:10,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1372 states and 1741 transitions. [2022-12-14 21:48:10,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1741 transitions. [2022-12-14 21:48:10,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-12-14 21:48:10,652 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:10,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:10,690 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 21:48:11,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:11,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1383 states and 1753 transitions. [2022-12-14 21:48:11,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 1753 transitions. [2022-12-14 21:48:11,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-12-14 21:48:11,355 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:11,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:11,402 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 21:48:11,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:11,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1427 states and 1802 transitions. [2022-12-14 21:48:11,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1802 transitions. [2022-12-14 21:48:11,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-12-14 21:48:11,977 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:11,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:12,024 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 21:48:12,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:12,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1434 states and 1809 transitions. [2022-12-14 21:48:12,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1809 transitions. [2022-12-14 21:48:12,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-12-14 21:48:12,245 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:12,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:12,294 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 21:48:12,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:12,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1814 states to 1440 states and 1814 transitions. [2022-12-14 21:48:12,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 1814 transitions. [2022-12-14 21:48:12,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-12-14 21:48:12,551 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:12,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:12,607 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 21:48:13,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:13,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1463 states and 1839 transitions. [2022-12-14 21:48:13,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 1839 transitions. [2022-12-14 21:48:13,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-12-14 21:48:13,403 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:13,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:13,441 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 21:48:13,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:13,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1464 states and 1840 transitions. [2022-12-14 21:48:13,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 1840 transitions. [2022-12-14 21:48:13,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-12-14 21:48:13,516 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:13,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:13,565 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:48:13,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:13,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1855 states to 1477 states and 1855 transitions. [2022-12-14 21:48:13,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 1855 transitions. [2022-12-14 21:48:13,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-12-14 21:48:13,627 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:13,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:13,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:13,667 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 21:48:13,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:13,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1868 states to 1488 states and 1868 transitions. [2022-12-14 21:48:13,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1868 transitions. [2022-12-14 21:48:13,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-12-14 21:48:13,835 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:13,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:14,100 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 79 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 21:48:15,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:15,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1530 states and 1914 transitions. [2022-12-14 21:48:15,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 1914 transitions. [2022-12-14 21:48:15,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-12-14 21:48:15,574 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:15,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:15,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:15,634 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 21:48:15,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:15,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1539 states and 1923 transitions. [2022-12-14 21:48:15,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 1923 transitions. [2022-12-14 21:48:15,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-12-14 21:48:15,725 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:15,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:15,795 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:48:16,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:16,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1569 states and 1956 transitions. [2022-12-14 21:48:16,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 1956 transitions. [2022-12-14 21:48:16,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-12-14 21:48:16,653 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:16,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:16,705 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:48:17,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:17,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1587 states and 1974 transitions. [2022-12-14 21:48:17,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 1974 transitions. [2022-12-14 21:48:17,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-12-14 21:48:17,508 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:17,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:17,549 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 21:48:17,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:17,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1602 states and 1989 transitions. [2022-12-14 21:48:17,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 1989 transitions. [2022-12-14 21:48:17,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-12-14 21:48:17,739 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:17,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:17,780 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 21:48:17,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:17,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1607 states and 1996 transitions. [2022-12-14 21:48:17,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 1996 transitions. [2022-12-14 21:48:17,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-12-14 21:48:17,924 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:17,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:17,965 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 21:48:18,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:18,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1610 states and 1998 transitions. [2022-12-14 21:48:18,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 1998 transitions. [2022-12-14 21:48:18,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-12-14 21:48:18,006 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:18,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:18,047 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 21:48:18,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:18,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2000 states to 1613 states and 2000 transitions. [2022-12-14 21:48:18,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2000 transitions. [2022-12-14 21:48:18,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-12-14 21:48:18,085 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:18,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:18,125 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 21:48:18,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:18,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2018 states to 1630 states and 2018 transitions. [2022-12-14 21:48:18,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2018 transitions. [2022-12-14 21:48:18,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-12-14 21:48:18,199 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:18,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:18,261 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 21:48:18,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:18,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2049 states to 1659 states and 2049 transitions. [2022-12-14 21:48:18,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2049 transitions. [2022-12-14 21:48:18,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-12-14 21:48:18,522 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:18,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:18,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:18,737 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 90 proven. 18 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 21:48:19,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:19,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 1664 states and 2057 transitions. [2022-12-14 21:48:19,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2057 transitions. [2022-12-14 21:48:19,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-12-14 21:48:19,416 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:19,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:19,771 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:48:21,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:21,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 1735 states and 2133 transitions. [2022-12-14 21:48:21,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2133 transitions. [2022-12-14 21:48:21,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-12-14 21:48:21,497 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:21,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:21,597 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-12-14 21:48:21,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:21,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 1737 states and 2148 transitions. [2022-12-14 21:48:21,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 2148 transitions. [2022-12-14 21:48:21,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-14 21:48:21,703 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:21,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:21,791 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 21:48:21,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:21,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 1743 states and 2154 transitions. [2022-12-14 21:48:21,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 2154 transitions. [2022-12-14 21:48:21,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-12-14 21:48:21,885 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:21,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:21,967 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 21:48:22,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:22,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2164 states to 1751 states and 2164 transitions. [2022-12-14 21:48:22,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2164 transitions. [2022-12-14 21:48:22,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-14 21:48:22,048 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:22,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:22,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:22,126 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-12-14 21:48:22,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:22,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2164 states to 1752 states and 2164 transitions. [2022-12-14 21:48:22,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 2164 transitions. [2022-12-14 21:48:22,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-14 21:48:22,217 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:22,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:22,268 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 21:48:22,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:22,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2189 states to 1773 states and 2189 transitions. [2022-12-14 21:48:22,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2189 transitions. [2022-12-14 21:48:22,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-14 21:48:22,867 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:22,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:22,917 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 21:48:23,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:23,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 1776 states and 2192 transitions. [2022-12-14 21:48:23,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 2192 transitions. [2022-12-14 21:48:23,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-14 21:48:23,074 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:23,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:23,124 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 21:48:23,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:23,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2219 states to 1799 states and 2219 transitions. [2022-12-14 21:48:23,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2219 transitions. [2022-12-14 21:48:23,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-12-14 21:48:23,724 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:23,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:23,766 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-12-14 21:48:23,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:23,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2225 states to 1805 states and 2225 transitions. [2022-12-14 21:48:23,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 2225 transitions. [2022-12-14 21:48:23,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-12-14 21:48:23,933 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:23,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:23,984 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-14 21:48:24,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:24,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 1816 states and 2237 transitions. [2022-12-14 21:48:24,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 2237 transitions. [2022-12-14 21:48:24,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-12-14 21:48:24,371 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:24,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:24,413 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 21:48:24,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:24,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 1823 states and 2243 transitions. [2022-12-14 21:48:24,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1823 states and 2243 transitions. [2022-12-14 21:48:24,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-12-14 21:48:24,479 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:24,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:24,523 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-14 21:48:24,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:24,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 1824 states and 2244 transitions. [2022-12-14 21:48:24,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2244 transitions. [2022-12-14 21:48:24,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-12-14 21:48:24,861 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:24,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:24,927 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 21:48:25,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:25,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 1836 states and 2265 transitions. [2022-12-14 21:48:25,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 2265 transitions. [2022-12-14 21:48:25,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-12-14 21:48:25,721 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:25,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:25,770 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 21:48:26,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:26,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 1837 states and 2267 transitions. [2022-12-14 21:48:26,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2267 transitions. [2022-12-14 21:48:26,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-12-14 21:48:26,070 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:26,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:26,117 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 21:48:26,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:26,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2269 states to 1838 states and 2269 transitions. [2022-12-14 21:48:26,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2269 transitions. [2022-12-14 21:48:26,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-12-14 21:48:26,431 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:26,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:26,480 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 21:48:26,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:26,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2273 states to 1842 states and 2273 transitions. [2022-12-14 21:48:26,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2273 transitions. [2022-12-14 21:48:26,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-12-14 21:48:26,523 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:26,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:26,570 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 21:48:27,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:27,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 1847 states and 2279 transitions. [2022-12-14 21:48:27,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2279 transitions. [2022-12-14 21:48:27,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-12-14 21:48:27,180 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:27,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:27,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:27,226 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 21:48:27,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:27,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2283 states to 1851 states and 2283 transitions. [2022-12-14 21:48:27,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 2283 transitions. [2022-12-14 21:48:27,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-12-14 21:48:27,417 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:27,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:27,464 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 21:48:27,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:27,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2285 states to 1852 states and 2285 transitions. [2022-12-14 21:48:27,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 2285 transitions. [2022-12-14 21:48:27,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-12-14 21:48:27,765 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:27,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:27,831 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 21:48:27,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:27,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2288 states to 1855 states and 2288 transitions. [2022-12-14 21:48:27,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1855 states and 2288 transitions. [2022-12-14 21:48:27,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-12-14 21:48:27,875 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:27,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:27,945 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 21:48:27,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:27,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 1858 states and 2291 transitions. [2022-12-14 21:48:27,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2291 transitions. [2022-12-14 21:48:27,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-12-14 21:48:27,997 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:27,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:28,042 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 21:48:29,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:29,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 1909 states and 2346 transitions. [2022-12-14 21:48:29,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1909 states and 2346 transitions. [2022-12-14 21:48:29,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-12-14 21:48:29,699 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:29,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:29,745 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 21:48:30,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:30,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2351 states to 1914 states and 2351 transitions. [2022-12-14 21:48:30,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2351 transitions. [2022-12-14 21:48:30,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-12-14 21:48:30,068 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:30,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:30,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:30,116 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 21:48:30,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:30,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2354 states to 1917 states and 2354 transitions. [2022-12-14 21:48:30,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1917 states and 2354 transitions. [2022-12-14 21:48:30,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-12-14 21:48:30,370 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:30,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:30,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:30,413 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 21:48:31,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:31,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2387 states to 1946 states and 2387 transitions. [2022-12-14 21:48:31,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2387 transitions. [2022-12-14 21:48:31,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-12-14 21:48:31,269 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:31,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:31,335 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 21:48:31,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:31,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 1951 states and 2393 transitions. [2022-12-14 21:48:31,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 2393 transitions. [2022-12-14 21:48:31,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-12-14 21:48:31,623 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:31,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:31,715 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 21:48:34,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:34,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 1996 states and 2443 transitions. [2022-12-14 21:48:34,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 2443 transitions. [2022-12-14 21:48:34,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-12-14 21:48:34,459 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:34,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:34,576 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 21:48:35,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:35,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2451 states to 2003 states and 2451 transitions. [2022-12-14 21:48:35,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2003 states and 2451 transitions. [2022-12-14 21:48:35,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-12-14 21:48:35,150 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:35,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:35,260 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 95 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:48:35,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:35,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2009 states and 2459 transitions. [2022-12-14 21:48:35,399 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 2459 transitions. [2022-12-14 21:48:35,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-12-14 21:48:35,400 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:35,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:35,447 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 21:48:35,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:35,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2494 states to 2041 states and 2494 transitions. [2022-12-14 21:48:35,712 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 2494 transitions. [2022-12-14 21:48:35,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-12-14 21:48:35,713 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:35,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:35,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:35,762 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 21:48:36,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:36,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2509 states to 2056 states and 2509 transitions. [2022-12-14 21:48:36,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2509 transitions. [2022-12-14 21:48:36,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-12-14 21:48:36,030 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:36,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:36,254 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:48:37,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:37,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2529 states to 2076 states and 2529 transitions. [2022-12-14 21:48:37,194 INFO L276 IsEmpty]: Start isEmpty. Operand 2076 states and 2529 transitions. [2022-12-14 21:48:37,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-12-14 21:48:37,195 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:37,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:37,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:37,241 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:48:38,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:38,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2109 states and 2564 transitions. [2022-12-14 21:48:38,204 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 2564 transitions. [2022-12-14 21:48:38,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-12-14 21:48:38,205 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:38,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:38,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:38,484 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 146 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 21:48:39,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:39,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2600 states to 2137 states and 2600 transitions. [2022-12-14 21:48:39,650 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 2600 transitions. [2022-12-14 21:48:39,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-12-14 21:48:39,652 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:39,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:39,745 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-12-14 21:48:40,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:40,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2607 states to 2146 states and 2607 transitions. [2022-12-14 21:48:40,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 2607 transitions. [2022-12-14 21:48:40,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-12-14 21:48:40,112 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:40,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:40,197 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:48:41,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:41,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2161 states and 2623 transitions. [2022-12-14 21:48:41,384 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 2623 transitions. [2022-12-14 21:48:41,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-12-14 21:48:41,385 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:41,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:41,462 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 21:48:41,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:41,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2178 states and 2639 transitions. [2022-12-14 21:48:41,661 INFO L276 IsEmpty]: Start isEmpty. Operand 2178 states and 2639 transitions. [2022-12-14 21:48:41,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-12-14 21:48:41,662 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:41,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:41,738 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 21:48:41,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:41,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2196 states and 2658 transitions. [2022-12-14 21:48:41,863 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 2658 transitions. [2022-12-14 21:48:41,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-12-14 21:48:41,864 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:41,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:41,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:41,940 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 21:48:42,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:42,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2659 states to 2198 states and 2659 transitions. [2022-12-14 21:48:42,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2198 states and 2659 transitions. [2022-12-14 21:48:42,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-12-14 21:48:42,155 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:42,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:42,231 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 21:48:42,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:42,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2660 states to 2200 states and 2660 transitions. [2022-12-14 21:48:42,406 INFO L276 IsEmpty]: Start isEmpty. Operand 2200 states and 2660 transitions. [2022-12-14 21:48:42,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-12-14 21:48:42,407 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:42,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:42,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:42,471 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-12-14 21:48:42,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:42,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2671 states to 2209 states and 2671 transitions. [2022-12-14 21:48:42,533 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 2671 transitions. [2022-12-14 21:48:42,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-12-14 21:48:42,534 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:42,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:42,661 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 117 proven. 46 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 21:48:44,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:44,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2240 states and 2706 transitions. [2022-12-14 21:48:44,411 INFO L276 IsEmpty]: Start isEmpty. Operand 2240 states and 2706 transitions. [2022-12-14 21:48:44,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-12-14 21:48:44,412 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:44,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:44,569 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 117 proven. 46 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 21:48:45,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:45,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2713 states to 2248 states and 2713 transitions. [2022-12-14 21:48:45,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 2713 transitions. [2022-12-14 21:48:45,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-12-14 21:48:45,194 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:45,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:45,624 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 29 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:48:49,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:49,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2834 states to 2367 states and 2834 transitions. [2022-12-14 21:48:49,079 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 2834 transitions. [2022-12-14 21:48:49,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-12-14 21:48:49,080 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:49,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:49,136 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 21:48:50,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:50,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2380 states and 2852 transitions. [2022-12-14 21:48:50,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 2852 transitions. [2022-12-14 21:48:50,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-12-14 21:48:50,007 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:50,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:50,064 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 21:48:51,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:51,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2872 states to 2392 states and 2872 transitions. [2022-12-14 21:48:51,541 INFO L276 IsEmpty]: Start isEmpty. Operand 2392 states and 2872 transitions. [2022-12-14 21:48:51,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-12-14 21:48:51,542 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:51,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:51,599 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 21:48:51,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:51,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2874 states to 2393 states and 2874 transitions. [2022-12-14 21:48:51,908 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 2874 transitions. [2022-12-14 21:48:51,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-12-14 21:48:51,909 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:51,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:51,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:52,004 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 21:48:52,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:52,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2903 states to 2421 states and 2903 transitions. [2022-12-14 21:48:52,160 INFO L276 IsEmpty]: Start isEmpty. Operand 2421 states and 2903 transitions. [2022-12-14 21:48:52,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-12-14 21:48:52,161 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:52,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:52,223 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 21:48:52,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:52,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2906 states to 2425 states and 2906 transitions. [2022-12-14 21:48:52,420 INFO L276 IsEmpty]: Start isEmpty. Operand 2425 states and 2906 transitions. [2022-12-14 21:48:52,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-12-14 21:48:52,421 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:52,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:52,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:52,586 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 111 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-14 21:48:53,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:53,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2969 states to 2487 states and 2969 transitions. [2022-12-14 21:48:53,950 INFO L276 IsEmpty]: Start isEmpty. Operand 2487 states and 2969 transitions. [2022-12-14 21:48:53,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-12-14 21:48:53,951 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:53,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:53,998 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-12-14 21:48:54,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:54,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2513 states and 2999 transitions. [2022-12-14 21:48:54,839 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 2999 transitions. [2022-12-14 21:48:54,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-12-14 21:48:54,840 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:54,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:54,888 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-12-14 21:48:55,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:55,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3001 states to 2515 states and 3001 transitions. [2022-12-14 21:48:55,264 INFO L276 IsEmpty]: Start isEmpty. Operand 2515 states and 3001 transitions. [2022-12-14 21:48:55,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-12-14 21:48:55,266 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:55,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:55,329 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-14 21:48:55,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:55,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3052 states to 2562 states and 3052 transitions. [2022-12-14 21:48:55,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 3052 transitions. [2022-12-14 21:48:55,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-12-14 21:48:55,750 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:55,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:55,814 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-14 21:48:56,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:56,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3054 states to 2563 states and 3054 transitions. [2022-12-14 21:48:56,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2563 states and 3054 transitions. [2022-12-14 21:48:56,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-12-14 21:48:56,143 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:56,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:56,207 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-14 21:48:56,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:56,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3054 states to 2564 states and 3054 transitions. [2022-12-14 21:48:56,445 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 3054 transitions. [2022-12-14 21:48:56,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-12-14 21:48:56,447 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:56,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:56,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:56,496 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 21:48:57,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:57,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3082 states to 2585 states and 3082 transitions. [2022-12-14 21:48:57,493 INFO L276 IsEmpty]: Start isEmpty. Operand 2585 states and 3082 transitions. [2022-12-14 21:48:57,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-12-14 21:48:57,494 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:57,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:57,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:57,543 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 21:48:57,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:57,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3084 states to 2587 states and 3084 transitions. [2022-12-14 21:48:57,669 INFO L276 IsEmpty]: Start isEmpty. Operand 2587 states and 3084 transitions. [2022-12-14 21:48:57,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-12-14 21:48:57,670 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:57,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:57,719 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 21:48:58,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:58,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3097 states to 2601 states and 3097 transitions. [2022-12-14 21:48:58,410 INFO L276 IsEmpty]: Start isEmpty. Operand 2601 states and 3097 transitions. [2022-12-14 21:48:58,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-12-14 21:48:58,411 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:58,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:58,461 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-14 21:48:58,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:58,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3109 states to 2612 states and 3109 transitions. [2022-12-14 21:48:58,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2612 states and 3109 transitions. [2022-12-14 21:48:58,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-12-14 21:48:58,677 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:58,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:58,727 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-14 21:48:59,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:59,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3111 states to 2615 states and 3111 transitions. [2022-12-14 21:48:59,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2615 states and 3111 transitions. [2022-12-14 21:48:59,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-12-14 21:48:59,310 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:59,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:59,359 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-14 21:48:59,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:59,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 2622 states and 3117 transitions. [2022-12-14 21:48:59,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2622 states and 3117 transitions. [2022-12-14 21:48:59,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-12-14 21:48:59,807 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:59,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:00,585 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 21:49:01,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:01,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 2646 states and 3142 transitions. [2022-12-14 21:49:01,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2646 states and 3142 transitions. [2022-12-14 21:49:01,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-12-14 21:49:01,821 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:01,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:01,991 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 21:49:02,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:02,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3197 states to 2702 states and 3197 transitions. [2022-12-14 21:49:02,901 INFO L276 IsEmpty]: Start isEmpty. Operand 2702 states and 3197 transitions. [2022-12-14 21:49:02,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-12-14 21:49:02,903 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:02,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:02,988 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-12-14 21:49:03,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:03,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3201 states to 2703 states and 3201 transitions. [2022-12-14 21:49:03,358 INFO L276 IsEmpty]: Start isEmpty. Operand 2703 states and 3201 transitions. [2022-12-14 21:49:03,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-12-14 21:49:03,360 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:03,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:03,618 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 150 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:49:05,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:05,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 2776 states and 3278 transitions. [2022-12-14 21:49:05,234 INFO L276 IsEmpty]: Start isEmpty. Operand 2776 states and 3278 transitions. [2022-12-14 21:49:05,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-12-14 21:49:05,235 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:05,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:05,284 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 21:49:05,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:05,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3281 states to 2779 states and 3281 transitions. [2022-12-14 21:49:05,420 INFO L276 IsEmpty]: Start isEmpty. Operand 2779 states and 3281 transitions. [2022-12-14 21:49:05,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-12-14 21:49:05,421 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:05,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:05,481 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 21:49:05,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:05,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3296 states to 2790 states and 3296 transitions. [2022-12-14 21:49:05,889 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 3296 transitions. [2022-12-14 21:49:05,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-12-14 21:49:05,891 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:05,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:05,941 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 21:49:07,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:07,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 2812 states and 3329 transitions. [2022-12-14 21:49:07,289 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 3329 transitions. [2022-12-14 21:49:07,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-12-14 21:49:07,290 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:07,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:07,341 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 21:49:08,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:08,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 2817 states and 3336 transitions. [2022-12-14 21:49:08,727 INFO L276 IsEmpty]: Start isEmpty. Operand 2817 states and 3336 transitions. [2022-12-14 21:49:08,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-12-14 21:49:08,728 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:08,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:08,779 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 21:49:09,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:09,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3339 states to 2819 states and 3339 transitions. [2022-12-14 21:49:09,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2819 states and 3339 transitions. [2022-12-14 21:49:09,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-12-14 21:49:09,196 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:09,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:09,284 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 142 proven. 8 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-12-14 21:49:10,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:10,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3396 states to 2875 states and 3396 transitions. [2022-12-14 21:49:10,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2875 states and 3396 transitions. [2022-12-14 21:49:10,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-12-14 21:49:10,817 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:10,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:10,869 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-12-14 21:49:11,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:11,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3413 states to 2892 states and 3413 transitions. [2022-12-14 21:49:11,631 INFO L276 IsEmpty]: Start isEmpty. Operand 2892 states and 3413 transitions. [2022-12-14 21:49:11,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-12-14 21:49:11,633 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:11,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:11,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:12,599 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 93 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:49:18,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:18,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3591 states to 3052 states and 3591 transitions. [2022-12-14 21:49:18,231 INFO L276 IsEmpty]: Start isEmpty. Operand 3052 states and 3591 transitions. [2022-12-14 21:49:18,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-12-14 21:49:18,233 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:18,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:18,294 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-12-14 21:49:18,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:18,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 3076 states and 3614 transitions. [2022-12-14 21:49:18,963 INFO L276 IsEmpty]: Start isEmpty. Operand 3076 states and 3614 transitions. [2022-12-14 21:49:18,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-12-14 21:49:18,965 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:18,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:19,024 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-12-14 21:49:19,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:19,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3616 states to 3079 states and 3616 transitions. [2022-12-14 21:49:19,288 INFO L276 IsEmpty]: Start isEmpty. Operand 3079 states and 3616 transitions. [2022-12-14 21:49:19,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-12-14 21:49:19,289 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:19,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:19,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:19,631 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:49:21,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:21,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3126 states and 3666 transitions. [2022-12-14 21:49:21,601 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 3666 transitions. [2022-12-14 21:49:21,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-12-14 21:49:21,603 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:21,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:21,715 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:49:22,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:22,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 3147 states and 3686 transitions. [2022-12-14 21:49:22,348 INFO L276 IsEmpty]: Start isEmpty. Operand 3147 states and 3686 transitions. [2022-12-14 21:49:22,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-12-14 21:49:22,349 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:22,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:22,408 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-12-14 21:49:23,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:23,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3709 states to 3168 states and 3709 transitions. [2022-12-14 21:49:23,050 INFO L276 IsEmpty]: Start isEmpty. Operand 3168 states and 3709 transitions. [2022-12-14 21:49:23,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2022-12-14 21:49:23,052 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:23,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:23,393 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 21:49:24,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:24,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3761 states to 3218 states and 3761 transitions. [2022-12-14 21:49:24,694 INFO L276 IsEmpty]: Start isEmpty. Operand 3218 states and 3761 transitions. [2022-12-14 21:49:24,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2022-12-14 21:49:24,696 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:24,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:24,794 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-12-14 21:49:26,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:26,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3782 states to 3237 states and 3782 transitions. [2022-12-14 21:49:26,530 INFO L276 IsEmpty]: Start isEmpty. Operand 3237 states and 3782 transitions. [2022-12-14 21:49:26,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2022-12-14 21:49:26,532 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:26,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:26,623 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-12-14 21:49:26,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:26,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3787 states to 3243 states and 3787 transitions. [2022-12-14 21:49:26,955 INFO L276 IsEmpty]: Start isEmpty. Operand 3243 states and 3787 transitions. [2022-12-14 21:49:26,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2022-12-14 21:49:26,957 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:26,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:27,047 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-12-14 21:49:27,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:27,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3787 states to 3244 states and 3787 transitions. [2022-12-14 21:49:27,296 INFO L276 IsEmpty]: Start isEmpty. Operand 3244 states and 3787 transitions. [2022-12-14 21:49:27,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2022-12-14 21:49:27,298 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:27,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:27,388 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-12-14 21:49:27,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:27,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3788 states to 3247 states and 3788 transitions. [2022-12-14 21:49:27,852 INFO L276 IsEmpty]: Start isEmpty. Operand 3247 states and 3788 transitions. [2022-12-14 21:49:27,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-12-14 21:49:27,854 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:27,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:27,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:27,926 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 21:49:28,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:28,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3814 states to 3267 states and 3814 transitions. [2022-12-14 21:49:28,577 INFO L276 IsEmpty]: Start isEmpty. Operand 3267 states and 3814 transitions. [2022-12-14 21:49:28,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-12-14 21:49:28,578 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:28,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:28,682 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 21:49:29,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:29,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3279 states and 3826 transitions. [2022-12-14 21:49:29,345 INFO L276 IsEmpty]: Start isEmpty. Operand 3279 states and 3826 transitions. [2022-12-14 21:49:29,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-12-14 21:49:29,347 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:29,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:29,407 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 21:49:29,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:29,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3836 states to 3289 states and 3836 transitions. [2022-12-14 21:49:29,637 INFO L276 IsEmpty]: Start isEmpty. Operand 3289 states and 3836 transitions. [2022-12-14 21:49:29,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-12-14 21:49:29,640 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:29,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:29,706 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 21:49:29,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:29,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3840 states to 3294 states and 3840 transitions. [2022-12-14 21:49:29,933 INFO L276 IsEmpty]: Start isEmpty. Operand 3294 states and 3840 transitions. [2022-12-14 21:49:29,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-12-14 21:49:29,935 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:29,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:29,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:29,994 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 21:49:30,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:30,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3842 states to 3297 states and 3842 transitions. [2022-12-14 21:49:30,213 INFO L276 IsEmpty]: Start isEmpty. Operand 3297 states and 3842 transitions. [2022-12-14 21:49:30,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-12-14 21:49:30,215 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:30,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:30,273 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 21:49:30,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:30,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3844 states to 3300 states and 3844 transitions. [2022-12-14 21:49:30,701 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 3844 transitions. [2022-12-14 21:49:30,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-12-14 21:49:30,705 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:30,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:30,792 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 21:49:30,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:30,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3848 states to 3305 states and 3848 transitions. [2022-12-14 21:49:30,880 INFO L276 IsEmpty]: Start isEmpty. Operand 3305 states and 3848 transitions. [2022-12-14 21:49:30,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-12-14 21:49:30,883 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:30,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:30,971 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 21:49:32,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:32,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3899 states to 3355 states and 3899 transitions. [2022-12-14 21:49:32,175 INFO L276 IsEmpty]: Start isEmpty. Operand 3355 states and 3899 transitions. [2022-12-14 21:49:32,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-12-14 21:49:32,177 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:32,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:32,236 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 21:49:32,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:32,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3906 states to 3362 states and 3906 transitions. [2022-12-14 21:49:32,778 INFO L276 IsEmpty]: Start isEmpty. Operand 3362 states and 3906 transitions. [2022-12-14 21:49:32,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-12-14 21:49:32,780 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:32,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:32,838 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 21:49:33,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:33,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3912 states to 3368 states and 3912 transitions. [2022-12-14 21:49:33,495 INFO L276 IsEmpty]: Start isEmpty. Operand 3368 states and 3912 transitions. [2022-12-14 21:49:33,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-12-14 21:49:33,497 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:33,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:33,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:33,567 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 21:49:34,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:34,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3953 states to 3404 states and 3953 transitions. [2022-12-14 21:49:34,521 INFO L276 IsEmpty]: Start isEmpty. Operand 3404 states and 3953 transitions. [2022-12-14 21:49:34,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-12-14 21:49:34,522 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:34,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:34,594 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 21:49:36,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:36,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3997 states to 3431 states and 3997 transitions. [2022-12-14 21:49:36,595 INFO L276 IsEmpty]: Start isEmpty. Operand 3431 states and 3997 transitions. [2022-12-14 21:49:36,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-12-14 21:49:36,596 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:36,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:36,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:36,667 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 21:49:37,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:37,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4003 states to 3437 states and 4003 transitions. [2022-12-14 21:49:37,213 INFO L276 IsEmpty]: Start isEmpty. Operand 3437 states and 4003 transitions. [2022-12-14 21:49:37,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-12-14 21:49:37,215 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:37,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:37,285 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 21:49:38,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:38,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4018 states to 3452 states and 4018 transitions. [2022-12-14 21:49:38,269 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 4018 transitions. [2022-12-14 21:49:38,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-12-14 21:49:38,271 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:38,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:38,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:38,342 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 21:49:39,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:39,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4031 states to 3466 states and 4031 transitions. [2022-12-14 21:49:39,044 INFO L276 IsEmpty]: Start isEmpty. Operand 3466 states and 4031 transitions. [2022-12-14 21:49:39,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-12-14 21:49:39,046 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:39,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:39,117 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 21:49:39,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:39,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4035 states to 3471 states and 4035 transitions. [2022-12-14 21:49:39,184 INFO L276 IsEmpty]: Start isEmpty. Operand 3471 states and 4035 transitions. [2022-12-14 21:49:39,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-12-14 21:49:39,185 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:39,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:39,256 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 21:49:39,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:39,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4037 states to 3474 states and 4037 transitions. [2022-12-14 21:49:39,858 INFO L276 IsEmpty]: Start isEmpty. Operand 3474 states and 4037 transitions. [2022-12-14 21:49:39,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2022-12-14 21:49:39,860 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:39,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 21:49:39,882 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 21:49:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 21:49:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 21:49:40,034 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 21:49:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 21:49:40,127 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 209 iterations. [2022-12-14 21:49:40,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 14.12 09:49:40 ImpRootNode [2022-12-14 21:49:40,251 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-12-14 21:49:40,252 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 21:49:40,252 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 21:49:40,252 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 21:49:40,252 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:47:33" (3/4) ... [2022-12-14 21:49:40,254 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 21:49:40,335 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6027edd3-b92a-461d-a421-bae0b4d2b060/bin/ukojak-rkRKPMF4O4/witness.graphml [2022-12-14 21:49:40,335 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 21:49:40,336 INFO L158 Benchmark]: Toolchain (without parser) took 128505.98ms. Allocated memory was 148.9MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 115.7MB in the beginning and 696.4MB in the end (delta: -580.7MB). Peak memory consumption was 904.4MB. Max. memory is 16.1GB. [2022-12-14 21:49:40,336 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 148.9MB. Free memory is still 90.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 21:49:40,336 INFO L158 Benchmark]: CACSL2BoogieTranslator took 415.43ms. Allocated memory is still 148.9MB. Free memory was 115.2MB in the beginning and 88.9MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-14 21:49:40,336 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.54ms. Allocated memory is still 148.9MB. Free memory was 88.9MB in the beginning and 83.3MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-14 21:49:40,336 INFO L158 Benchmark]: Boogie Preprocessor took 37.90ms. Allocated memory is still 148.9MB. Free memory was 83.3MB in the beginning and 79.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 21:49:40,337 INFO L158 Benchmark]: RCFGBuilder took 1064.45ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 79.1MB in the beginning and 102.6MB in the end (delta: -23.5MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. [2022-12-14 21:49:40,337 INFO L158 Benchmark]: CodeCheck took 126836.40ms. Allocated memory was 180.4MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 102.6MB in the beginning and 715.6MB in the end (delta: -612.9MB). Peak memory consumption was 838.3MB. Max. memory is 16.1GB. [2022-12-14 21:49:40,337 INFO L158 Benchmark]: Witness Printer took 83.71ms. Allocated memory is still 1.6GB. Free memory was 715.6MB in the beginning and 696.4MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-14 21:49:40,338 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, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 126.7s, OverallIterations: 209, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 752477 SdHoareTripleChecker+Valid, 1271.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 712108 mSDsluCounter, 130541 SdHoareTripleChecker+Invalid, 1093.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 113307 mSDsCounter, 197657 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1558321 IncrementalHoareTripleChecker+Invalid, 1755978 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 197657 mSolverCounterUnsat, 17234 mSDtfsCounter, 1558321 mSolverCounterSat, 8.9s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 231567 GetRequests, 228406 SyntacticMatches, 1901 SemanticMatches, 1260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1230919 ImplicationChecksByTransitivity, 92.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.8s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 13.5s InterpolantComputationTime, 33392 NumberOfCodeBlocks, 33392 NumberOfCodeBlocksAsserted, 209 NumberOfCheckSat, 32956 ConstructedInterpolants, 0 QuantifiedInterpolants, 75346 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 208 InterpolantComputations, 188 PerfectInterpolantSequences, 22875/23378 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: 431]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int e= 5; [L19] int d= 4; [L20] int f= 6; [L21] int c= 3; [L24] int u = 21; [L25] int v = 22; [L26] int w = 23; [L27] int x = 24; [L28] int y = 25; [L29] int z = 26; [L32] int a25 = 0; [L33] int a11 = 0; [L34] int a28 = 7; [L35] int a19 = 1; [L36] int a21 = 1; [L37] int a17 = 8; [L613] int output = -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL, EXPR calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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 !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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 !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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 !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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 !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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 !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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 !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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 !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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 !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND TRUE ((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1))) [L245] a28 = 9 [L246] return 23; VAL [\old(input)=4, \result=23, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL, EXPR calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L247] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L258] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L263] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L269] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L290] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L301] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L303] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L307] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L319] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L338] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L341] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L359] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L364] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L385] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L388] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L390] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L399] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND TRUE (((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1)) [L405] a19 = 0 [L406] a28 = 7 [L407] return 25; VAL [\old(input)=3, \result=25, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL, EXPR calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, 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 !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, 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 !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, 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 !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, 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 !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND TRUE ((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8)))) [L165] a25 = 1 [L166] a19 = 1 [L167] a28 = 7 [L168] return -1; VAL [\old(input)=5, \result=-1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L247] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L258] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L263] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L269] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L290] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L301] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L303] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L307] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L319] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L338] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L341] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L359] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L364] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L385] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L388] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L390] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L399] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L408] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L412] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L414] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L417] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L419] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) [L424] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) [L427] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L430] COND TRUE ((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8)) VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L431] reach_error() VAL [\old(input)=6, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 148.9MB. Free memory is still 90.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 415.43ms. Allocated memory is still 148.9MB. Free memory was 115.2MB in the beginning and 88.9MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.54ms. Allocated memory is still 148.9MB. Free memory was 88.9MB in the beginning and 83.3MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.90ms. Allocated memory is still 148.9MB. Free memory was 83.3MB in the beginning and 79.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1064.45ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 79.1MB in the beginning and 102.6MB in the end (delta: -23.5MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. * CodeCheck took 126836.40ms. Allocated memory was 180.4MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 102.6MB in the beginning and 715.6MB in the end (delta: -612.9MB). Peak memory consumption was 838.3MB. Max. memory is 16.1GB. * Witness Printer took 83.71ms. Allocated memory is still 1.6GB. Free memory was 715.6MB in the beginning and 696.4MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2022-12-14 21:49:40,352 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6027edd3-b92a-461d-a421-bae0b4d2b060/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE