./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label45.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_9d998179-61d0-4fa7-a746-9cd0be88486f/bin/ukojak-rkRKPMF4O4/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d998179-61d0-4fa7-a746-9cd0be88486f/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_9d998179-61d0-4fa7-a746-9cd0be88486f/bin/ukojak-rkRKPMF4O4/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d998179-61d0-4fa7-a746-9cd0be88486f/bin/ukojak-rkRKPMF4O4/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label45.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d998179-61d0-4fa7-a746-9cd0be88486f/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_9d998179-61d0-4fa7-a746-9cd0be88486f/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 bd7bfdc90ad274b856f062dcd9b414cf1c7c524311f5a91ee1cc532e8e6a452d --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-15 03:58:11,138 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-15 03:58:11,140 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-15 03:58:11,152 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-15 03:58:11,152 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-15 03:58:11,153 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-15 03:58:11,154 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-15 03:58:11,155 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-15 03:58:11,156 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-15 03:58:11,156 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-15 03:58:11,157 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-15 03:58:11,157 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-15 03:58:11,158 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-15 03:58:11,158 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-15 03:58:11,159 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-15 03:58:11,160 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-15 03:58:11,160 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-15 03:58:11,161 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-15 03:58:11,162 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-15 03:58:11,163 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-15 03:58:11,164 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-15 03:58:11,165 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-15 03:58:11,166 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-15 03:58:11,166 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-15 03:58:11,168 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-15 03:58:11,168 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-15 03:58:11,169 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-15 03:58:11,169 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-15 03:58:11,170 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-15 03:58:11,170 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-15 03:58:11,171 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-15 03:58:11,171 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-15 03:58:11,172 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-15 03:58:11,172 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-15 03:58:11,173 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-15 03:58:11,173 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-15 03:58:11,174 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-15 03:58:11,174 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-15 03:58:11,174 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-15 03:58:11,175 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-15 03:58:11,175 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-15 03:58:11,176 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d998179-61d0-4fa7-a746-9cd0be88486f/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-12-15 03:58:11,188 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-15 03:58:11,188 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-15 03:58:11,189 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-15 03:58:11,189 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-12-15 03:58:11,195 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-15 03:58:11,195 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-15 03:58:11,195 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-15 03:58:11,195 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-15 03:58:11,195 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-15 03:58:11,195 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-15 03:58:11,196 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-15 03:58:11,196 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-15 03:58:11,196 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-15 03:58:11,196 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-15 03:58:11,196 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-15 03:58:11,196 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-15 03:58:11,196 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-15 03:58:11,196 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-15 03:58:11,197 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-12-15 03:58:11,197 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-12-15 03:58:11,197 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-15 03:58:11,197 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-15 03:58:11,197 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-15 03:58:11,197 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-15 03:58:11,197 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-15 03:58:11,197 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-12-15 03:58:11,198 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-15 03:58:11,198 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-15 03:58:11,198 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_9d998179-61d0-4fa7-a746-9cd0be88486f/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_9d998179-61d0-4fa7-a746-9cd0be88486f/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 -> bd7bfdc90ad274b856f062dcd9b414cf1c7c524311f5a91ee1cc532e8e6a452d [2022-12-15 03:58:11,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-15 03:58:11,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-15 03:58:11,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-15 03:58:11,420 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-15 03:58:11,421 INFO L275 PluginConnector]: CDTParser initialized [2022-12-15 03:58:11,422 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d998179-61d0-4fa7-a746-9cd0be88486f/bin/ukojak-rkRKPMF4O4/../../sv-benchmarks/c/eca-rers2012/Problem02_label45.c [2022-12-15 03:58:13,975 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-15 03:58:14,143 INFO L351 CDTParser]: Found 1 translation units. [2022-12-15 03:58:14,144 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d998179-61d0-4fa7-a746-9cd0be88486f/sv-benchmarks/c/eca-rers2012/Problem02_label45.c [2022-12-15 03:58:14,152 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d998179-61d0-4fa7-a746-9cd0be88486f/bin/ukojak-rkRKPMF4O4/data/cd342a639/964a6ecbe8a64fe687c3e013caa0696b/FLAG06812c9c9 [2022-12-15 03:58:14,162 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d998179-61d0-4fa7-a746-9cd0be88486f/bin/ukojak-rkRKPMF4O4/data/cd342a639/964a6ecbe8a64fe687c3e013caa0696b [2022-12-15 03:58:14,164 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-15 03:58:14,165 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-15 03:58:14,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-15 03:58:14,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-15 03:58:14,169 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-15 03:58:14,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 03:58:14" (1/1) ... [2022-12-15 03:58:14,170 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7971e431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 03:58:14, skipping insertion in model container [2022-12-15 03:58:14,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 03:58:14" (1/1) ... [2022-12-15 03:58:14,175 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-15 03:58:14,201 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-15 03:58:14,377 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_9d998179-61d0-4fa7-a746-9cd0be88486f/sv-benchmarks/c/eca-rers2012/Problem02_label45.c[14744,14757] [2022-12-15 03:58:14,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-15 03:58:14,414 INFO L203 MainTranslator]: Completed pre-run [2022-12-15 03:58:14,466 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_9d998179-61d0-4fa7-a746-9cd0be88486f/sv-benchmarks/c/eca-rers2012/Problem02_label45.c[14744,14757] [2022-12-15 03:58:14,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-15 03:58:14,490 INFO L208 MainTranslator]: Completed translation [2022-12-15 03:58:14,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 03:58:14 WrapperNode [2022-12-15 03:58:14,490 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-15 03:58:14,491 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-15 03:58:14,491 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-15 03:58:14,491 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-15 03:58:14,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 03:58:14" (1/1) ... [2022-12-15 03:58:14,509 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 03:58:14" (1/1) ... [2022-12-15 03:58:14,538 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2022-12-15 03:58:14,538 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-15 03:58:14,539 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-15 03:58:14,539 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-15 03:58:14,539 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-15 03:58:14,546 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 03:58:14" (1/1) ... [2022-12-15 03:58:14,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 03:58:14" (1/1) ... [2022-12-15 03:58:14,549 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 03:58:14" (1/1) ... [2022-12-15 03:58:14,549 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 03:58:14" (1/1) ... [2022-12-15 03:58:14,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 03:58:14" (1/1) ... [2022-12-15 03:58:14,566 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 03:58:14" (1/1) ... [2022-12-15 03:58:14,570 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 03:58:14" (1/1) ... [2022-12-15 03:58:14,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 03:58:14" (1/1) ... [2022-12-15 03:58:14,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-15 03:58:14,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-15 03:58:14,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-15 03:58:14,577 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-15 03:58:14,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 03:58:14" (1/1) ... [2022-12-15 03:58:14,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-15 03:58:14,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d998179-61d0-4fa7-a746-9cd0be88486f/bin/ukojak-rkRKPMF4O4/z3 [2022-12-15 03:58:14,601 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d998179-61d0-4fa7-a746-9cd0be88486f/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-12-15 03:58:14,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d998179-61d0-4fa7-a746-9cd0be88486f/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-12-15 03:58:14,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-15 03:58:14,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-15 03:58:14,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-15 03:58:14,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-15 03:58:14,689 INFO L235 CfgBuilder]: Building ICFG [2022-12-15 03:58:14,690 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-15 03:58:15,369 INFO L276 CfgBuilder]: Performing block encoding [2022-12-15 03:58:15,521 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-15 03:58:15,521 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-15 03:58:15,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 03:58:15 BoogieIcfgContainer [2022-12-15 03:58:15,523 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-15 03:58:15,524 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-12-15 03:58:15,524 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-12-15 03:58:15,531 INFO L275 PluginConnector]: CodeCheck initialized [2022-12-15 03:58:15,531 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 03:58:15" (1/1) ... [2022-12-15 03:58:15,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-15 03:58:15,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:15,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2022-12-15 03:58:15,580 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2022-12-15 03:58:15,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-15 03:58:15,583 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:15,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:15,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:58:16,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:16,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 163 states and 300 transitions. [2022-12-15 03:58:16,215 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 300 transitions. [2022-12-15 03:58:16,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-15 03:58:16,218 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:16,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:16,415 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-15 03:58:16,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:16,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 166 states and 305 transitions. [2022-12-15 03:58:16,476 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 305 transitions. [2022-12-15 03:58:16,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-12-15 03:58:16,479 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:16,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:16,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:16,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:58:17,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:17,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 245 states and 421 transitions. [2022-12-15 03:58:17,083 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 421 transitions. [2022-12-15 03:58:17,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-12-15 03:58:17,084 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:17,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:17,141 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-15 03:58:17,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:17,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 247 states and 425 transitions. [2022-12-15 03:58:17,196 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 425 transitions. [2022-12-15 03:58:17,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-12-15 03:58:17,198 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:17,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:17,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:17,276 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-15 03:58:17,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:17,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 250 states and 429 transitions. [2022-12-15 03:58:17,376 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 429 transitions. [2022-12-15 03:58:17,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-15 03:58:17,377 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:17,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:17,473 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-15 03:58:17,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:17,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 254 states and 437 transitions. [2022-12-15 03:58:17,752 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 437 transitions. [2022-12-15 03:58:17,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-15 03:58:17,753 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:17,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:17,846 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-15 03:58:17,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:17,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 257 states and 441 transitions. [2022-12-15 03:58:17,910 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 441 transitions. [2022-12-15 03:58:17,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-15 03:58:17,911 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:17,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:18,009 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:58:18,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:18,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 339 states and 528 transitions. [2022-12-15 03:58:18,619 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 528 transitions. [2022-12-15 03:58:18,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-12-15 03:58:18,622 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:18,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:18,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:18,705 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-15 03:58:18,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:18,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 345 states and 539 transitions. [2022-12-15 03:58:18,963 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 539 transitions. [2022-12-15 03:58:18,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-12-15 03:58:18,964 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:18,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:19,022 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-15 03:58:19,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:19,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 350 states and 546 transitions. [2022-12-15 03:58:19,180 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 546 transitions. [2022-12-15 03:58:19,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-12-15 03:58:19,181 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:19,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:19,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:19,233 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:58:19,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:19,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 353 states and 552 transitions. [2022-12-15 03:58:19,384 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 552 transitions. [2022-12-15 03:58:19,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-12-15 03:58:19,386 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:19,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:19,441 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:58:19,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:19,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 356 states and 556 transitions. [2022-12-15 03:58:19,507 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 556 transitions. [2022-12-15 03:58:19,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-12-15 03:58:19,508 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:19,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:19,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:19,559 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:58:19,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:19,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 358 states and 557 transitions. [2022-12-15 03:58:19,659 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 557 transitions. [2022-12-15 03:58:19,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-12-15 03:58:19,660 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:19,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:19,764 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:58:19,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:19,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 362 states and 563 transitions. [2022-12-15 03:58:19,936 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 563 transitions. [2022-12-15 03:58:19,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-12-15 03:58:19,937 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:19,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:19,986 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-15 03:58:20,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:20,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 371 states and 577 transitions. [2022-12-15 03:58:20,226 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 577 transitions. [2022-12-15 03:58:20,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-12-15 03:58:20,227 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:20,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:20,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:20,268 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-15 03:58:20,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:20,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 374 states and 580 transitions. [2022-12-15 03:58:20,303 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 580 transitions. [2022-12-15 03:58:20,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-15 03:58:20,304 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:20,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:20,346 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-15 03:58:20,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:20,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 384 states and 595 transitions. [2022-12-15 03:58:20,786 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 595 transitions. [2022-12-15 03:58:20,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-15 03:58:20,787 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:20,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:20,830 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-15 03:58:21,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:21,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 392 states and 608 transitions. [2022-12-15 03:58:21,150 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 608 transitions. [2022-12-15 03:58:21,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-15 03:58:21,151 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:21,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:21,193 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-15 03:58:21,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:21,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 394 states and 609 transitions. [2022-12-15 03:58:21,331 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 609 transitions. [2022-12-15 03:58:21,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-15 03:58:21,332 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:21,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:21,391 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-15 03:58:21,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:21,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 396 states and 611 transitions. [2022-12-15 03:58:21,422 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 611 transitions. [2022-12-15 03:58:21,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-12-15 03:58:21,423 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:21,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:21,454 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:58:21,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:21,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 401 states and 616 transitions. [2022-12-15 03:58:21,489 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 616 transitions. [2022-12-15 03:58:21,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-12-15 03:58:21,490 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:21,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:21,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:21,526 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-15 03:58:21,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:21,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 404 states and 619 transitions. [2022-12-15 03:58:21,559 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 619 transitions. [2022-12-15 03:58:21,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-12-15 03:58:21,560 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:21,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:21,589 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:58:21,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:21,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 406 states and 621 transitions. [2022-12-15 03:58:21,608 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 621 transitions. [2022-12-15 03:58:21,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-12-15 03:58:21,609 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:21,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:21,674 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-15 03:58:21,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:21,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 412 states and 627 transitions. [2022-12-15 03:58:21,708 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 627 transitions. [2022-12-15 03:58:21,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-12-15 03:58:21,708 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:21,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:21,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:21,736 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-15 03:58:21,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:21,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 414 states and 629 transitions. [2022-12-15 03:58:21,756 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 629 transitions. [2022-12-15 03:58:21,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-12-15 03:58:21,757 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:21,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:21,785 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-15 03:58:21,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:21,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 419 states and 634 transitions. [2022-12-15 03:58:21,816 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 634 transitions. [2022-12-15 03:58:21,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-12-15 03:58:21,816 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:21,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:21,844 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-15 03:58:22,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:22,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 432 states and 650 transitions. [2022-12-15 03:58:22,076 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 650 transitions. [2022-12-15 03:58:22,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-12-15 03:58:22,077 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:22,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:22,110 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:58:22,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:22,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 451 states and 671 transitions. [2022-12-15 03:58:22,369 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 671 transitions. [2022-12-15 03:58:22,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-12-15 03:58:22,370 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:22,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:22,398 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-15 03:58:22,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:22,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 453 states and 673 transitions. [2022-12-15 03:58:22,424 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 673 transitions. [2022-12-15 03:58:22,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-12-15 03:58:22,424 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:22,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:22,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:22,452 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-15 03:58:22,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:22,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 454 states and 674 transitions. [2022-12-15 03:58:22,479 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 674 transitions. [2022-12-15 03:58:22,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-12-15 03:58:22,480 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:22,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:22,508 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:58:22,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:22,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 459 states and 680 transitions. [2022-12-15 03:58:22,584 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 680 transitions. [2022-12-15 03:58:22,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-12-15 03:58:22,585 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:22,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:22,676 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-15 03:58:22,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:22,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 464 states and 686 transitions. [2022-12-15 03:58:22,767 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 686 transitions. [2022-12-15 03:58:22,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-12-15 03:58:22,767 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:22,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:23,053 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:58:23,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:23,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 492 states and 719 transitions. [2022-12-15 03:58:23,706 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 719 transitions. [2022-12-15 03:58:23,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-12-15 03:58:23,706 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:23,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:23,752 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:58:23,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:23,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 512 states and 742 transitions. [2022-12-15 03:58:23,944 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 742 transitions. [2022-12-15 03:58:23,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-12-15 03:58:23,945 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:23,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:23,982 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:58:24,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:24,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 531 states and 765 transitions. [2022-12-15 03:58:24,346 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 765 transitions. [2022-12-15 03:58:24,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-12-15 03:58:24,346 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:24,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:24,382 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:58:24,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:24,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 550 states and 785 transitions. [2022-12-15 03:58:24,512 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 785 transitions. [2022-12-15 03:58:24,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-12-15 03:58:24,513 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:24,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:24,554 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:58:24,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:24,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 552 states and 786 transitions. [2022-12-15 03:58:24,631 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 786 transitions. [2022-12-15 03:58:24,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-12-15 03:58:24,632 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:24,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:24,660 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-15 03:58:24,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:24,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 558 states and 794 transitions. [2022-12-15 03:58:24,776 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 794 transitions. [2022-12-15 03:58:24,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-12-15 03:58:24,777 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:24,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:24,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:24,810 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-15 03:58:24,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:24,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 563 states and 801 transitions. [2022-12-15 03:58:24,842 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 801 transitions. [2022-12-15 03:58:24,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-15 03:58:24,843 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:24,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:24,871 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-15 03:58:24,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:24,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 568 states and 807 transitions. [2022-12-15 03:58:24,904 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 807 transitions. [2022-12-15 03:58:24,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-15 03:58:24,905 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:24,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:24,939 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-15 03:58:24,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:24,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 572 states and 810 transitions. [2022-12-15 03:58:24,966 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 810 transitions. [2022-12-15 03:58:24,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-15 03:58:24,967 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:24,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:24,994 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-15 03:58:25,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:25,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 573 states and 811 transitions. [2022-12-15 03:58:25,015 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 811 transitions. [2022-12-15 03:58:25,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-12-15 03:58:25,016 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:25,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:25,065 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-15 03:58:25,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:25,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 597 states and 839 transitions. [2022-12-15 03:58:25,479 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 839 transitions. [2022-12-15 03:58:25,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-12-15 03:58:25,480 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:25,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:25,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:25,538 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-15 03:58:26,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:26,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 620 states and 868 transitions. [2022-12-15 03:58:26,137 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 868 transitions. [2022-12-15 03:58:26,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-12-15 03:58:26,138 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:26,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:26,192 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-15 03:58:26,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:26,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 624 states and 870 transitions. [2022-12-15 03:58:26,352 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 870 transitions. [2022-12-15 03:58:26,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-12-15 03:58:26,353 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:26,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:26,405 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 38 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:58:26,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:26,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 630 states and 881 transitions. [2022-12-15 03:58:26,845 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 881 transitions. [2022-12-15 03:58:26,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-12-15 03:58:26,846 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:26,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:26,896 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 38 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:58:27,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:27,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 635 states and 888 transitions. [2022-12-15 03:58:27,102 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 888 transitions. [2022-12-15 03:58:27,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-12-15 03:58:27,103 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:27,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:27,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:27,153 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:58:27,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:27,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 658 states and 914 transitions. [2022-12-15 03:58:27,324 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 914 transitions. [2022-12-15 03:58:27,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-12-15 03:58:27,325 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:27,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:27,374 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:58:27,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:27,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 679 states and 941 transitions. [2022-12-15 03:58:27,556 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 941 transitions. [2022-12-15 03:58:27,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-12-15 03:58:27,556 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:27,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:27,605 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:58:27,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:27,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 681 states and 942 transitions. [2022-12-15 03:58:27,660 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 942 transitions. [2022-12-15 03:58:27,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-12-15 03:58:27,661 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:27,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:27,698 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-15 03:58:27,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:27,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 683 states and 943 transitions. [2022-12-15 03:58:27,776 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 943 transitions. [2022-12-15 03:58:27,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-12-15 03:58:27,777 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:27,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:27,812 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-15 03:58:27,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:27,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 685 states and 944 transitions. [2022-12-15 03:58:27,891 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 944 transitions. [2022-12-15 03:58:27,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-12-15 03:58:27,892 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:27,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:27,965 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-15 03:58:28,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:28,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 764 states and 1025 transitions. [2022-12-15 03:58:28,381 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1025 transitions. [2022-12-15 03:58:28,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-15 03:58:28,382 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:28,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:28,457 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:58:28,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:28,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 775 states and 1039 transitions. [2022-12-15 03:58:28,665 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1039 transitions. [2022-12-15 03:58:28,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-12-15 03:58:28,666 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:28,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:28,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:28,732 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-15 03:58:28,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:28,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 788 states and 1053 transitions. [2022-12-15 03:58:28,964 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1053 transitions. [2022-12-15 03:58:28,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-12-15 03:58:28,964 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:28,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:29,020 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-15 03:58:29,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:29,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 801 states and 1066 transitions. [2022-12-15 03:58:29,132 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1066 transitions. [2022-12-15 03:58:29,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-12-15 03:58:29,133 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:29,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:29,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:29,196 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-15 03:58:29,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:29,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 803 states and 1067 transitions. [2022-12-15 03:58:29,269 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1067 transitions. [2022-12-15 03:58:29,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-12-15 03:58:29,270 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:29,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:29,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:29,302 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-15 03:58:29,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:29,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 821 states and 1088 transitions. [2022-12-15 03:58:29,643 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1088 transitions. [2022-12-15 03:58:29,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-12-15 03:58:29,644 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:29,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:29,730 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-15 03:58:30,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:30,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 848 states and 1126 transitions. [2022-12-15 03:58:30,544 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1126 transitions. [2022-12-15 03:58:30,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-12-15 03:58:30,545 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:30,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:30,584 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-15 03:58:31,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:31,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 874 states and 1165 transitions. [2022-12-15 03:58:31,302 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1165 transitions. [2022-12-15 03:58:31,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-12-15 03:58:31,303 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:31,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:31,343 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-15 03:58:31,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:31,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 878 states and 1168 transitions. [2022-12-15 03:58:31,379 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1168 transitions. [2022-12-15 03:58:31,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-12-15 03:58:31,380 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:31,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:31,421 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-15 03:58:31,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:31,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 884 states and 1176 transitions. [2022-12-15 03:58:31,827 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1176 transitions. [2022-12-15 03:58:31,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-12-15 03:58:31,827 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:31,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:31,867 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-15 03:58:31,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:31,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 888 states and 1179 transitions. [2022-12-15 03:58:31,902 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1179 transitions. [2022-12-15 03:58:31,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-12-15 03:58:31,903 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:31,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:31,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:31,942 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:58:31,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:31,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 892 states and 1183 transitions. [2022-12-15 03:58:31,981 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1183 transitions. [2022-12-15 03:58:31,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-12-15 03:58:31,982 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:31,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:32,028 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:58:32,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:32,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 893 states and 1184 transitions. [2022-12-15 03:58:32,060 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1184 transitions. [2022-12-15 03:58:32,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-12-15 03:58:32,060 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:32,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:32,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:32,094 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-15 03:58:32,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:32,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 898 states and 1189 transitions. [2022-12-15 03:58:32,142 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1189 transitions. [2022-12-15 03:58:32,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-12-15 03:58:32,143 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:32,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:32,182 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:58:32,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:32,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 900 states and 1191 transitions. [2022-12-15 03:58:32,217 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1191 transitions. [2022-12-15 03:58:32,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-12-15 03:58:32,218 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:32,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:32,259 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:58:32,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:32,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 909 states and 1203 transitions. [2022-12-15 03:58:32,419 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1203 transitions. [2022-12-15 03:58:32,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-12-15 03:58:32,420 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:32,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:32,461 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:58:32,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:32,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 918 states and 1216 transitions. [2022-12-15 03:58:32,570 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1216 transitions. [2022-12-15 03:58:32,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-12-15 03:58:32,571 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:32,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:32,612 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:58:32,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:32,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 921 states and 1220 transitions. [2022-12-15 03:58:32,728 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1220 transitions. [2022-12-15 03:58:32,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-12-15 03:58:32,729 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:32,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:32,776 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:58:32,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:32,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 943 states and 1242 transitions. [2022-12-15 03:58:32,871 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1242 transitions. [2022-12-15 03:58:32,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-12-15 03:58:32,872 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:32,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:32,912 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:58:32,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:32,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 944 states and 1243 transitions. [2022-12-15 03:58:32,939 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1243 transitions. [2022-12-15 03:58:32,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-12-15 03:58:32,940 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:32,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:32,980 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:58:33,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:33,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 945 states and 1244 transitions. [2022-12-15 03:58:33,011 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1244 transitions. [2022-12-15 03:58:33,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-12-15 03:58:33,012 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:33,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:33,077 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:58:33,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:33,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 950 states and 1249 transitions. [2022-12-15 03:58:33,124 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1249 transitions. [2022-12-15 03:58:33,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-12-15 03:58:33,125 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:33,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:33,166 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:58:33,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:33,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 952 states and 1251 transitions. [2022-12-15 03:58:33,198 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1251 transitions. [2022-12-15 03:58:33,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-12-15 03:58:33,199 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:33,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:33,240 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:58:33,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:33,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 954 states and 1253 transitions. [2022-12-15 03:58:33,281 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1253 transitions. [2022-12-15 03:58:33,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-12-15 03:58:33,282 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:33,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:33,353 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:58:33,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:33,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 990 states and 1295 transitions. [2022-12-15 03:58:33,884 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1295 transitions. [2022-12-15 03:58:33,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-12-15 03:58:33,885 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:33,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:33,947 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:58:34,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:34,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1026 states and 1339 transitions. [2022-12-15 03:58:34,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1339 transitions. [2022-12-15 03:58:34,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-12-15 03:58:34,883 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:34,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:34,945 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:58:35,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:35,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1029 states and 1343 transitions. [2022-12-15 03:58:35,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1343 transitions. [2022-12-15 03:58:35,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-12-15 03:58:35,099 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:35,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:35,221 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-12-15 03:58:35,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:35,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1065 states and 1386 transitions. [2022-12-15 03:58:35,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1386 transitions. [2022-12-15 03:58:35,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-12-15 03:58:35,878 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:35,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:36,035 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 66 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:58:36,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:36,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1097 states and 1427 transitions. [2022-12-15 03:58:36,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1427 transitions. [2022-12-15 03:58:36,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-12-15 03:58:36,737 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:36,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:36,836 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 66 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:58:37,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:37,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1104 states and 1438 transitions. [2022-12-15 03:58:37,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1438 transitions. [2022-12-15 03:58:37,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-12-15 03:58:37,332 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:37,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:37,420 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 66 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:58:37,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:37,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1123 states and 1464 transitions. [2022-12-15 03:58:37,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1464 transitions. [2022-12-15 03:58:37,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-12-15 03:58:37,983 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:37,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:38,072 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 66 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:58:38,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:38,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 1126 states and 1470 transitions. [2022-12-15 03:58:38,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1470 transitions. [2022-12-15 03:58:38,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-12-15 03:58:38,376 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:38,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:38,473 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 66 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:58:38,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:38,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1128 states and 1471 transitions. [2022-12-15 03:58:38,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1471 transitions. [2022-12-15 03:58:38,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-12-15 03:58:38,697 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:38,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:38,787 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 66 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:58:38,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:38,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1472 states to 1130 states and 1472 transitions. [2022-12-15 03:58:38,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1472 transitions. [2022-12-15 03:58:38,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-12-15 03:58:38,972 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:38,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:39,072 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 66 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:58:39,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:39,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1132 states and 1473 transitions. [2022-12-15 03:58:39,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1473 transitions. [2022-12-15 03:58:39,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-12-15 03:58:39,275 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:39,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:39,363 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 66 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:58:39,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:39,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1134 states and 1474 transitions. [2022-12-15 03:58:39,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1474 transitions. [2022-12-15 03:58:39,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-12-15 03:58:39,601 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:39,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:39,636 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-15 03:58:40,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:40,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1155 states and 1497 transitions. [2022-12-15 03:58:40,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1497 transitions. [2022-12-15 03:58:40,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-12-15 03:58:40,104 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:40,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:40,141 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-15 03:58:40,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:40,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1176 states and 1521 transitions. [2022-12-15 03:58:40,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1521 transitions. [2022-12-15 03:58:40,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-12-15 03:58:40,549 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:40,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:40,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:40,584 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-15 03:58:40,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:40,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1178 states and 1522 transitions. [2022-12-15 03:58:40,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1522 transitions. [2022-12-15 03:58:40,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-12-15 03:58:40,718 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:40,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:40,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:40,950 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 80 proven. 8 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:58:41,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:41,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1206 states and 1552 transitions. [2022-12-15 03:58:41,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1552 transitions. [2022-12-15 03:58:41,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-12-15 03:58:41,411 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:41,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:41,533 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 73 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:58:42,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:42,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1226 states and 1577 transitions. [2022-12-15 03:58:42,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1577 transitions. [2022-12-15 03:58:42,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-12-15 03:58:42,082 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:42,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:42,193 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 73 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:58:42,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:42,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1233 states and 1590 transitions. [2022-12-15 03:58:42,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1590 transitions. [2022-12-15 03:58:42,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-12-15 03:58:42,605 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:42,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:42,715 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 73 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:58:42,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:42,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1235 states and 1591 transitions. [2022-12-15 03:58:42,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1591 transitions. [2022-12-15 03:58:42,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-12-15 03:58:42,762 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:42,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:42,873 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 73 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:58:43,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:43,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1250 states and 1607 transitions. [2022-12-15 03:58:43,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1607 transitions. [2022-12-15 03:58:43,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-12-15 03:58:43,301 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:43,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:43,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:43,412 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 73 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:58:43,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:43,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1252 states and 1608 transitions. [2022-12-15 03:58:43,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1608 transitions. [2022-12-15 03:58:43,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-12-15 03:58:43,615 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:43,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:43,877 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 78 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:58:45,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:45,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1302 states and 1665 transitions. [2022-12-15 03:58:45,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1665 transitions. [2022-12-15 03:58:45,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-12-15 03:58:45,419 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:45,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:45,521 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 78 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:58:47,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:47,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1351 states and 1725 transitions. [2022-12-15 03:58:47,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1725 transitions. [2022-12-15 03:58:47,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-12-15 03:58:47,232 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:47,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:47,349 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 78 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:58:47,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:47,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 1358 states and 1730 transitions. [2022-12-15 03:58:47,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1730 transitions. [2022-12-15 03:58:47,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-12-15 03:58:47,584 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:47,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:47,653 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-15 03:58:47,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:47,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1359 states and 1739 transitions. [2022-12-15 03:58:47,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 1739 transitions. [2022-12-15 03:58:47,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-12-15 03:58:47,722 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:47,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:47,832 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:58:49,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:49,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1391 states and 1777 transitions. [2022-12-15 03:58:49,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 1777 transitions. [2022-12-15 03:58:49,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-12-15 03:58:49,088 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:49,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:49,134 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:58:49,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:49,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1395 states and 1780 transitions. [2022-12-15 03:58:49,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1780 transitions. [2022-12-15 03:58:49,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-12-15 03:58:49,379 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:49,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:49,414 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-12-15 03:58:49,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:49,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1787 states to 1399 states and 1787 transitions. [2022-12-15 03:58:49,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 1787 transitions. [2022-12-15 03:58:49,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-12-15 03:58:49,828 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:49,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:49,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:49,863 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-12-15 03:58:50,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:50,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1790 states to 1402 states and 1790 transitions. [2022-12-15 03:58:50,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1790 transitions. [2022-12-15 03:58:50,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-15 03:58:50,099 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:50,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:50,180 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-15 03:58:50,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:50,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1790 states to 1403 states and 1790 transitions. [2022-12-15 03:58:50,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 1790 transitions. [2022-12-15 03:58:50,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-15 03:58:50,264 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:50,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:50,336 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-15 03:58:50,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:50,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1408 states and 1795 transitions. [2022-12-15 03:58:50,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 1795 transitions. [2022-12-15 03:58:50,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-15 03:58:50,813 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:50,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:50,861 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-15 03:58:51,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:51,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1411 states and 1797 transitions. [2022-12-15 03:58:51,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1797 transitions. [2022-12-15 03:58:51,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-15 03:58:51,019 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:51,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:51,066 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-15 03:58:51,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:51,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1412 states and 1797 transitions. [2022-12-15 03:58:51,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 1797 transitions. [2022-12-15 03:58:51,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-15 03:58:51,094 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:51,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:51,142 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-15 03:58:51,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:51,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1414 states and 1800 transitions. [2022-12-15 03:58:51,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 1800 transitions. [2022-12-15 03:58:51,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-12-15 03:58:51,313 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:51,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:51,383 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-15 03:58:51,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:51,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1447 states and 1835 transitions. [2022-12-15 03:58:51,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 1835 transitions. [2022-12-15 03:58:51,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-12-15 03:58:51,919 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:51,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:51,968 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-15 03:58:52,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:52,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1480 states and 1871 transitions. [2022-12-15 03:58:52,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 1871 transitions. [2022-12-15 03:58:52,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-12-15 03:58:52,652 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:52,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:52,702 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-15 03:58:53,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:53,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1876 states to 1482 states and 1876 transitions. [2022-12-15 03:58:53,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 1876 transitions. [2022-12-15 03:58:53,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-12-15 03:58:53,013 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:53,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:53,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:53,062 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-15 03:58:53,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:53,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1484 states and 1881 transitions. [2022-12-15 03:58:53,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1881 transitions. [2022-12-15 03:58:53,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-12-15 03:58:53,360 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:53,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:53,408 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-15 03:58:53,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:53,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1883 states to 1486 states and 1883 transitions. [2022-12-15 03:58:53,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 1883 transitions. [2022-12-15 03:58:53,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-12-15 03:58:53,660 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:53,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:53,709 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:58:53,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:53,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1493 states and 1890 transitions. [2022-12-15 03:58:53,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 1890 transitions. [2022-12-15 03:58:53,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-12-15 03:58:53,756 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:53,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:53,835 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-12-15 03:58:53,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:53,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1494 states and 1890 transitions. [2022-12-15 03:58:53,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1890 transitions. [2022-12-15 03:58:53,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-12-15 03:58:53,885 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:53,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:54,008 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 95 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:58:56,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:56,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1553 states and 1954 transitions. [2022-12-15 03:58:56,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 1954 transitions. [2022-12-15 03:58:56,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-12-15 03:58:56,671 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:56,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:56,843 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 95 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:58:59,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:59,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2015 states to 1612 states and 2015 transitions. [2022-12-15 03:58:59,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2015 transitions. [2022-12-15 03:58:59,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-12-15 03:58:59,133 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:59,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:59,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:59,254 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 95 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:58:59,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:59,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 1616 states and 2017 transitions. [2022-12-15 03:58:59,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2017 transitions. [2022-12-15 03:58:59,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-12-15 03:58:59,613 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:59,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:58:59,664 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:58:59,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:58:59,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2023 states to 1622 states and 2023 transitions. [2022-12-15 03:58:59,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2023 transitions. [2022-12-15 03:58:59,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-12-15 03:58:59,709 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:58:59,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:58:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:00,021 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 123 proven. 18 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:59:02,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:02,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 1684 states and 2092 transitions. [2022-12-15 03:59:02,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2092 transitions. [2022-12-15 03:59:02,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-12-15 03:59:02,779 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:02,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:02,893 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 123 proven. 18 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:59:03,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:03,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 1696 states and 2105 transitions. [2022-12-15 03:59:03,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 2105 transitions. [2022-12-15 03:59:03,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-12-15 03:59:03,205 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:03,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:03,322 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 123 proven. 18 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:59:03,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:03,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2108 states to 1700 states and 2108 transitions. [2022-12-15 03:59:03,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2108 transitions. [2022-12-15 03:59:03,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-12-15 03:59:03,612 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:03,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:03,653 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:59:03,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:03,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 1744 states and 2154 transitions. [2022-12-15 03:59:03,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 2154 transitions. [2022-12-15 03:59:03,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-12-15 03:59:03,860 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:03,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:03,902 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-15 03:59:04,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:04,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2195 states to 1784 states and 2195 transitions. [2022-12-15 03:59:04,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2195 transitions. [2022-12-15 03:59:04,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-12-15 03:59:04,686 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:04,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:04,728 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-15 03:59:05,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:05,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 1824 states and 2236 transitions. [2022-12-15 03:59:05,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2236 transitions. [2022-12-15 03:59:05,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-12-15 03:59:05,882 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:05,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:05,930 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-12-15 03:59:06,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:06,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2250 states to 1838 states and 2250 transitions. [2022-12-15 03:59:06,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2250 transitions. [2022-12-15 03:59:06,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-12-15 03:59:06,025 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:06,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:06,075 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:59:06,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:06,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 1841 states and 2254 transitions. [2022-12-15 03:59:06,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2254 transitions. [2022-12-15 03:59:06,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-12-15 03:59:06,146 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:06,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:06,222 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-15 03:59:06,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:06,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2268 states to 1853 states and 2268 transitions. [2022-12-15 03:59:06,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2268 transitions. [2022-12-15 03:59:06,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-12-15 03:59:06,831 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:06,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:06,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:06,903 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-15 03:59:07,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:07,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 1865 states and 2282 transitions. [2022-12-15 03:59:07,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1865 states and 2282 transitions. [2022-12-15 03:59:07,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-12-15 03:59:07,839 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:07,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:07,891 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-15 03:59:08,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:08,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2292 states to 1875 states and 2292 transitions. [2022-12-15 03:59:08,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 2292 transitions. [2022-12-15 03:59:08,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-12-15 03:59:08,074 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:08,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:08,126 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-15 03:59:08,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:08,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 1885 states and 2302 transitions. [2022-12-15 03:59:08,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 2302 transitions. [2022-12-15 03:59:08,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-12-15 03:59:08,558 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:08,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:08,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:08,611 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:59:09,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:09,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2315 states to 1896 states and 2315 transitions. [2022-12-15 03:59:09,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2315 transitions. [2022-12-15 03:59:09,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-12-15 03:59:09,012 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:09,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:09,065 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:59:09,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:09,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2329 states to 1907 states and 2329 transitions. [2022-12-15 03:59:09,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 2329 transitions. [2022-12-15 03:59:09,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-12-15 03:59:09,525 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:09,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:09,567 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-15 03:59:09,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:09,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 1919 states and 2344 transitions. [2022-12-15 03:59:09,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1919 states and 2344 transitions. [2022-12-15 03:59:09,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-12-15 03:59:09,922 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:09,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:09,964 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-15 03:59:10,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:10,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 1930 states and 2356 transitions. [2022-12-15 03:59:10,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 2356 transitions. [2022-12-15 03:59:10,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-12-15 03:59:10,345 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:10,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:10,635 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 106 proven. 8 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:59:11,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:11,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2387 states to 1959 states and 2387 transitions. [2022-12-15 03:59:11,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 2387 transitions. [2022-12-15 03:59:11,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-12-15 03:59:11,386 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:11,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:11,432 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-15 03:59:12,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:12,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 1972 states and 2405 transitions. [2022-12-15 03:59:12,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1972 states and 2405 transitions. [2022-12-15 03:59:12,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-12-15 03:59:12,111 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:12,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:12,158 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-15 03:59:12,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:12,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 1976 states and 2411 transitions. [2022-12-15 03:59:12,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 2411 transitions. [2022-12-15 03:59:12,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-12-15 03:59:12,615 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:12,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:12,663 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-15 03:59:13,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:13,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2414 states to 1979 states and 2414 transitions. [2022-12-15 03:59:13,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1979 states and 2414 transitions. [2022-12-15 03:59:13,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-12-15 03:59:13,077 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:13,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:13,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:13,124 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-15 03:59:13,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:13,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2415 states to 1981 states and 2415 transitions. [2022-12-15 03:59:13,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1981 states and 2415 transitions. [2022-12-15 03:59:13,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-12-15 03:59:13,310 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:13,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:13,355 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-15 03:59:13,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:13,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 1990 states and 2426 transitions. [2022-12-15 03:59:13,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 2426 transitions. [2022-12-15 03:59:13,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-12-15 03:59:13,667 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:13,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:13,715 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-15 03:59:13,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:13,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 1996 states and 2433 transitions. [2022-12-15 03:59:13,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 2433 transitions. [2022-12-15 03:59:13,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-12-15 03:59:13,789 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:13,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:13,842 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-15 03:59:14,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:14,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 1998 states and 2434 transitions. [2022-12-15 03:59:14,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 2434 transitions. [2022-12-15 03:59:14,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-12-15 03:59:14,046 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:14,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:14,576 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 135 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:59:17,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:17,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2533 states to 2069 states and 2533 transitions. [2022-12-15 03:59:17,735 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states and 2533 transitions. [2022-12-15 03:59:17,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-12-15 03:59:17,736 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:17,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:17,880 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 135 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:59:18,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:18,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2074 states and 2537 transitions. [2022-12-15 03:59:18,532 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 2537 transitions. [2022-12-15 03:59:18,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-12-15 03:59:18,533 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:18,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:18,585 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-12-15 03:59:19,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:19,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2096 states and 2562 transitions. [2022-12-15 03:59:19,358 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 2562 transitions. [2022-12-15 03:59:19,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-12-15 03:59:19,359 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:19,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:19,403 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-12-15 03:59:19,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:19,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2101 states and 2566 transitions. [2022-12-15 03:59:19,608 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2566 transitions. [2022-12-15 03:59:19,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-12-15 03:59:19,609 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:19,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:19,657 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-15 03:59:20,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:20,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2105 states and 2569 transitions. [2022-12-15 03:59:20,032 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 2569 transitions. [2022-12-15 03:59:20,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-12-15 03:59:20,033 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:20,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:20,081 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-15 03:59:20,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:20,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2572 states to 2109 states and 2572 transitions. [2022-12-15 03:59:20,282 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 2572 transitions. [2022-12-15 03:59:20,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-12-15 03:59:20,283 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:20,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:20,353 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:59:20,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:20,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2572 states to 2110 states and 2572 transitions. [2022-12-15 03:59:20,581 INFO L276 IsEmpty]: Start isEmpty. Operand 2110 states and 2572 transitions. [2022-12-15 03:59:20,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-12-15 03:59:20,582 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:20,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:20,652 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:59:20,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:20,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2572 states to 2111 states and 2572 transitions. [2022-12-15 03:59:20,850 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 2572 transitions. [2022-12-15 03:59:20,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-12-15 03:59:20,851 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:20,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:20,952 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:59:21,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:21,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2573 states to 2113 states and 2573 transitions. [2022-12-15 03:59:21,037 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 2573 transitions. [2022-12-15 03:59:21,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-12-15 03:59:21,038 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:21,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:21,110 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:59:21,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:21,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2574 states to 2116 states and 2574 transitions. [2022-12-15 03:59:21,344 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 2574 transitions. [2022-12-15 03:59:21,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-12-15 03:59:21,345 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:21,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:21,501 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 107 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-15 03:59:21,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:21,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2589 states to 2131 states and 2589 transitions. [2022-12-15 03:59:21,975 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 2589 transitions. [2022-12-15 03:59:21,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-12-15 03:59:21,976 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:21,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:22,042 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-12-15 03:59:23,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:23,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2156 states and 2624 transitions. [2022-12-15 03:59:23,448 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 2624 transitions. [2022-12-15 03:59:23,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-12-15 03:59:23,449 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:23,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:23,502 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-12-15 03:59:25,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:25,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2180 states and 2658 transitions. [2022-12-15 03:59:25,140 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 2658 transitions. [2022-12-15 03:59:25,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-12-15 03:59:25,141 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:25,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:25,195 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-12-15 03:59:25,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:25,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2672 states to 2195 states and 2672 transitions. [2022-12-15 03:59:25,833 INFO L276 IsEmpty]: Start isEmpty. Operand 2195 states and 2672 transitions. [2022-12-15 03:59:25,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-12-15 03:59:25,835 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:25,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:25,916 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-12-15 03:59:26,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:26,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2199 states and 2674 transitions. [2022-12-15 03:59:26,744 INFO L276 IsEmpty]: Start isEmpty. Operand 2199 states and 2674 transitions. [2022-12-15 03:59:26,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-12-15 03:59:26,746 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:26,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:26,803 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-12-15 03:59:27,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:27,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2689 states to 2214 states and 2689 transitions. [2022-12-15 03:59:27,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 2689 transitions. [2022-12-15 03:59:27,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-12-15 03:59:27,947 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:27,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:28,000 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-12-15 03:59:28,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:28,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2690 states to 2216 states and 2690 transitions. [2022-12-15 03:59:28,459 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 2690 transitions. [2022-12-15 03:59:28,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-12-15 03:59:28,461 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:28,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:28,516 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-12-15 03:59:29,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:29,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2705 states to 2222 states and 2705 transitions. [2022-12-15 03:59:29,628 INFO L276 IsEmpty]: Start isEmpty. Operand 2222 states and 2705 transitions. [2022-12-15 03:59:29,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-12-15 03:59:29,629 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:29,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:29,684 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-12-15 03:59:30,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:30,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2227 states and 2714 transitions. [2022-12-15 03:59:30,384 INFO L276 IsEmpty]: Start isEmpty. Operand 2227 states and 2714 transitions. [2022-12-15 03:59:30,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-12-15 03:59:30,385 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:30,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:30,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:30,456 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-15 03:59:31,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:31,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2756 states to 2259 states and 2756 transitions. [2022-12-15 03:59:31,352 INFO L276 IsEmpty]: Start isEmpty. Operand 2259 states and 2756 transitions. [2022-12-15 03:59:31,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-12-15 03:59:31,353 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:31,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:31,423 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-15 03:59:32,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:32,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2770 states to 2269 states and 2770 transitions. [2022-12-15 03:59:32,022 INFO L276 IsEmpty]: Start isEmpty. Operand 2269 states and 2770 transitions. [2022-12-15 03:59:32,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-12-15 03:59:32,024 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:32,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:32,342 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 119 proven. 4 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-12-15 03:59:33,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:33,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2786 states to 2283 states and 2786 transitions. [2022-12-15 03:59:33,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 2786 transitions. [2022-12-15 03:59:33,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-12-15 03:59:33,928 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:33,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:34,061 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 119 proven. 4 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-12-15 03:59:35,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:35,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2803 states to 2297 states and 2803 transitions. [2022-12-15 03:59:35,686 INFO L276 IsEmpty]: Start isEmpty. Operand 2297 states and 2803 transitions. [2022-12-15 03:59:35,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-12-15 03:59:35,687 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:35,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:35,759 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-12-15 03:59:36,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:36,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2805 states to 2298 states and 2805 transitions. [2022-12-15 03:59:36,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2298 states and 2805 transitions. [2022-12-15 03:59:36,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-12-15 03:59:36,139 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:36,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:36,211 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-12-15 03:59:36,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:36,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2807 states to 2299 states and 2807 transitions. [2022-12-15 03:59:36,587 INFO L276 IsEmpty]: Start isEmpty. Operand 2299 states and 2807 transitions. [2022-12-15 03:59:36,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-12-15 03:59:36,588 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:36,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:36,819 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:59:38,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:38,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2312 states and 2823 transitions. [2022-12-15 03:59:38,008 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 2823 transitions. [2022-12-15 03:59:38,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-12-15 03:59:38,009 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:38,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:38,084 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 157 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:59:39,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:39,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2849 states to 2333 states and 2849 transitions. [2022-12-15 03:59:39,669 INFO L276 IsEmpty]: Start isEmpty. Operand 2333 states and 2849 transitions. [2022-12-15 03:59:39,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-12-15 03:59:39,670 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:39,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:39,745 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 157 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:59:41,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:41,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2875 states to 2354 states and 2875 transitions. [2022-12-15 03:59:41,230 INFO L276 IsEmpty]: Start isEmpty. Operand 2354 states and 2875 transitions. [2022-12-15 03:59:41,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-12-15 03:59:41,231 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:41,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:41,306 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 157 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:59:41,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:41,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2906 states to 2385 states and 2906 transitions. [2022-12-15 03:59:41,822 INFO L276 IsEmpty]: Start isEmpty. Operand 2385 states and 2906 transitions. [2022-12-15 03:59:41,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-12-15 03:59:41,823 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:41,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:41,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:41,899 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 157 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:59:42,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:42,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2938 states to 2416 states and 2938 transitions. [2022-12-15 03:59:42,352 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 2938 transitions. [2022-12-15 03:59:42,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-12-15 03:59:42,353 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:42,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:42,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:42,430 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 157 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:59:42,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:42,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2939 states to 2418 states and 2939 transitions. [2022-12-15 03:59:42,656 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 2939 transitions. [2022-12-15 03:59:42,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-12-15 03:59:42,657 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:42,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:42,736 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 157 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:59:43,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:43,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2940 states to 2420 states and 2940 transitions. [2022-12-15 03:59:43,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 2940 transitions. [2022-12-15 03:59:43,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-12-15 03:59:43,017 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:43,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:43,274 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-15 03:59:44,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:44,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3020 states to 2500 states and 3020 transitions. [2022-12-15 03:59:44,316 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 3020 transitions. [2022-12-15 03:59:44,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-12-15 03:59:44,317 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:44,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:44,462 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 133 proven. 46 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:59:44,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:44,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 2510 states and 3030 transitions. [2022-12-15 03:59:44,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2510 states and 3030 transitions. [2022-12-15 03:59:44,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-12-15 03:59:44,920 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:44,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:45,068 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 133 proven. 46 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:59:45,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:45,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3040 states to 2520 states and 3040 transitions. [2022-12-15 03:59:45,626 INFO L276 IsEmpty]: Start isEmpty. Operand 2520 states and 3040 transitions. [2022-12-15 03:59:45,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-12-15 03:59:45,627 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:45,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:45,708 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 129 proven. 8 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-15 03:59:48,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:48,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3076 states to 2547 states and 3076 transitions. [2022-12-15 03:59:48,652 INFO L276 IsEmpty]: Start isEmpty. Operand 2547 states and 3076 transitions. [2022-12-15 03:59:48,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-12-15 03:59:48,653 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:48,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:48,734 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 129 proven. 8 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-15 03:59:50,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:50,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3107 states to 2573 states and 3107 transitions. [2022-12-15 03:59:50,387 INFO L276 IsEmpty]: Start isEmpty. Operand 2573 states and 3107 transitions. [2022-12-15 03:59:50,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-12-15 03:59:50,388 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:50,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:50,469 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 129 proven. 8 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-15 03:59:50,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:50,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3107 states to 2574 states and 3107 transitions. [2022-12-15 03:59:50,561 INFO L276 IsEmpty]: Start isEmpty. Operand 2574 states and 3107 transitions. [2022-12-15 03:59:50,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-12-15 03:59:50,562 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:50,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:50,618 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-12-15 03:59:51,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:51,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3109 states to 2576 states and 3109 transitions. [2022-12-15 03:59:51,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2576 states and 3109 transitions. [2022-12-15 03:59:51,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-12-15 03:59:51,007 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:51,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:51,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:51,054 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-12-15 03:59:51,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:51,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 2581 states and 3114 transitions. [2022-12-15 03:59:51,258 INFO L276 IsEmpty]: Start isEmpty. Operand 2581 states and 3114 transitions. [2022-12-15 03:59:51,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-12-15 03:59:51,259 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:51,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:51,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:51,327 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-15 03:59:51,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:51,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 2583 states and 3115 transitions. [2022-12-15 03:59:51,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2583 states and 3115 transitions. [2022-12-15 03:59:51,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-12-15 03:59:51,689 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:51,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:51,759 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-15 03:59:52,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:52,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 2585 states and 3116 transitions. [2022-12-15 03:59:52,102 INFO L276 IsEmpty]: Start isEmpty. Operand 2585 states and 3116 transitions. [2022-12-15 03:59:52,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-12-15 03:59:52,104 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:52,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:52,162 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-15 03:59:52,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:52,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 2587 states and 3119 transitions. [2022-12-15 03:59:52,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2587 states and 3119 transitions. [2022-12-15 03:59:52,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-12-15 03:59:52,241 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:52,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:52,301 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-15 03:59:52,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:52,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 2589 states and 3122 transitions. [2022-12-15 03:59:52,682 INFO L276 IsEmpty]: Start isEmpty. Operand 2589 states and 3122 transitions. [2022-12-15 03:59:52,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-12-15 03:59:52,683 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:52,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:52,742 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-15 03:59:53,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:53,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 2606 states and 3137 transitions. [2022-12-15 03:59:53,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2606 states and 3137 transitions. [2022-12-15 03:59:53,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-12-15 03:59:53,925 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:53,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:53,983 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-15 03:59:55,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:55,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3151 states to 2621 states and 3151 transitions. [2022-12-15 03:59:55,227 INFO L276 IsEmpty]: Start isEmpty. Operand 2621 states and 3151 transitions. [2022-12-15 03:59:55,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-12-15 03:59:55,229 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:55,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:55,288 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-15 03:59:55,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:55,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3152 states to 2623 states and 3152 transitions. [2022-12-15 03:59:55,858 INFO L276 IsEmpty]: Start isEmpty. Operand 2623 states and 3152 transitions. [2022-12-15 03:59:55,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-12-15 03:59:55,859 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:55,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:55,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:56,024 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 141 proven. 26 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:59:58,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:58,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 2672 states and 3208 transitions. [2022-12-15 03:59:58,603 INFO L276 IsEmpty]: Start isEmpty. Operand 2672 states and 3208 transitions. [2022-12-15 03:59:58,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-12-15 03:59:58,604 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:58,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:58,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:58,729 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 141 proven. 26 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 03:59:59,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:59:59,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3211 states to 2676 states and 3211 transitions. [2022-12-15 03:59:59,146 INFO L276 IsEmpty]: Start isEmpty. Operand 2676 states and 3211 transitions. [2022-12-15 03:59:59,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-12-15 03:59:59,147 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:59:59,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:59:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:59:59,373 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 141 proven. 26 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 04:00:00,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:00,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3227 states to 2692 states and 3227 transitions. [2022-12-15 04:00:00,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2692 states and 3227 transitions. [2022-12-15 04:00:00,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-12-15 04:00:00,918 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:00,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:00,976 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-15 04:00:01,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:01,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3245 states to 2706 states and 3245 transitions. [2022-12-15 04:00:01,570 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3245 transitions. [2022-12-15 04:00:01,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-12-15 04:00:01,571 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:01,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:01,630 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-15 04:00:02,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:02,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3265 states to 2720 states and 3265 transitions. [2022-12-15 04:00:02,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2720 states and 3265 transitions. [2022-12-15 04:00:02,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-12-15 04:00:02,216 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:02,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:02,274 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-15 04:00:03,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:03,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3302 states to 2756 states and 3302 transitions. [2022-12-15 04:00:03,852 INFO L276 IsEmpty]: Start isEmpty. Operand 2756 states and 3302 transitions. [2022-12-15 04:00:03,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-12-15 04:00:03,854 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:03,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:03,912 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-15 04:00:05,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:05,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3339 states to 2792 states and 3339 transitions. [2022-12-15 04:00:05,433 INFO L276 IsEmpty]: Start isEmpty. Operand 2792 states and 3339 transitions. [2022-12-15 04:00:05,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-12-15 04:00:05,435 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:05,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:05,494 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-15 04:00:05,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:05,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3341 states to 2794 states and 3341 transitions. [2022-12-15 04:00:05,957 INFO L276 IsEmpty]: Start isEmpty. Operand 2794 states and 3341 transitions. [2022-12-15 04:00:05,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-12-15 04:00:05,959 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:05,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:06,017 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-15 04:00:06,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:06,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3343 states to 2796 states and 3343 transitions. [2022-12-15 04:00:06,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2796 states and 3343 transitions. [2022-12-15 04:00:06,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-12-15 04:00:06,404 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:06,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:06,454 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-12-15 04:00:08,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:08,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 2834 states and 3382 transitions. [2022-12-15 04:00:08,201 INFO L276 IsEmpty]: Start isEmpty. Operand 2834 states and 3382 transitions. [2022-12-15 04:00:08,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-12-15 04:00:08,202 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:08,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:08,251 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-12-15 04:00:08,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:08,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3391 states to 2844 states and 3391 transitions. [2022-12-15 04:00:08,740 INFO L276 IsEmpty]: Start isEmpty. Operand 2844 states and 3391 transitions. [2022-12-15 04:00:08,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-12-15 04:00:08,742 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:08,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:08,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:08,806 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-12-15 04:00:08,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:08,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3395 states to 2848 states and 3395 transitions. [2022-12-15 04:00:08,892 INFO L276 IsEmpty]: Start isEmpty. Operand 2848 states and 3395 transitions. [2022-12-15 04:00:08,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-12-15 04:00:08,893 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:08,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:09,692 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 169 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 04:00:12,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:12,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3448 states to 2897 states and 3448 transitions. [2022-12-15 04:00:12,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2897 states and 3448 transitions. [2022-12-15 04:00:12,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-12-15 04:00:12,938 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:12,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:13,106 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 169 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 04:00:15,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:15,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3498 states to 2943 states and 3498 transitions. [2022-12-15 04:00:15,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2943 states and 3498 transitions. [2022-12-15 04:00:15,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-12-15 04:00:15,605 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:15,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:15,823 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 169 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 04:00:18,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:18,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3534 states to 2979 states and 3534 transitions. [2022-12-15 04:00:18,601 INFO L276 IsEmpty]: Start isEmpty. Operand 2979 states and 3534 transitions. [2022-12-15 04:00:18,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-12-15 04:00:18,602 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:18,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:18,780 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 169 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 04:00:21,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:21,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3571 states to 3017 states and 3571 transitions. [2022-12-15 04:00:21,837 INFO L276 IsEmpty]: Start isEmpty. Operand 3017 states and 3571 transitions. [2022-12-15 04:00:21,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-12-15 04:00:21,839 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:21,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:21,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:22,004 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 169 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 04:00:22,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:22,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3572 states to 3019 states and 3572 transitions. [2022-12-15 04:00:22,700 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3572 transitions. [2022-12-15 04:00:22,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-12-15 04:00:22,701 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:22,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:22,866 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 169 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 04:00:23,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:23,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 3021 states and 3573 transitions. [2022-12-15 04:00:23,459 INFO L276 IsEmpty]: Start isEmpty. Operand 3021 states and 3573 transitions. [2022-12-15 04:00:23,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-12-15 04:00:23,461 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:23,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:23,508 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-12-15 04:00:24,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:24,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3585 states to 3033 states and 3585 transitions. [2022-12-15 04:00:24,762 INFO L276 IsEmpty]: Start isEmpty. Operand 3033 states and 3585 transitions. [2022-12-15 04:00:24,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-12-15 04:00:24,763 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:24,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:24,812 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-12-15 04:00:26,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:26,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3597 states to 3044 states and 3597 transitions. [2022-12-15 04:00:26,273 INFO L276 IsEmpty]: Start isEmpty. Operand 3044 states and 3597 transitions. [2022-12-15 04:00:26,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-12-15 04:00:26,274 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:26,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:26,322 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-12-15 04:00:26,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:26,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3601 states to 3048 states and 3601 transitions. [2022-12-15 04:00:26,786 INFO L276 IsEmpty]: Start isEmpty. Operand 3048 states and 3601 transitions. [2022-12-15 04:00:26,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-12-15 04:00:26,787 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:26,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:26,836 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-12-15 04:00:27,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:27,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3606 states to 3054 states and 3606 transitions. [2022-12-15 04:00:27,341 INFO L276 IsEmpty]: Start isEmpty. Operand 3054 states and 3606 transitions. [2022-12-15 04:00:27,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-12-15 04:00:27,343 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:27,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:27,426 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-12-15 04:00:28,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:28,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3625 states to 3071 states and 3625 transitions. [2022-12-15 04:00:28,801 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 3625 transitions. [2022-12-15 04:00:28,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-12-15 04:00:28,803 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:28,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:28,886 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-12-15 04:00:30,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:30,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3088 states and 3643 transitions. [2022-12-15 04:00:30,061 INFO L276 IsEmpty]: Start isEmpty. Operand 3088 states and 3643 transitions. [2022-12-15 04:00:30,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-12-15 04:00:30,063 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:30,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:30,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:30,144 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-12-15 04:00:30,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:30,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3647 states to 3092 states and 3647 transitions. [2022-12-15 04:00:30,623 INFO L276 IsEmpty]: Start isEmpty. Operand 3092 states and 3647 transitions. [2022-12-15 04:00:30,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-12-15 04:00:30,624 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:30,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:30,681 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-15 04:00:31,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:31,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3652 states to 3099 states and 3652 transitions. [2022-12-15 04:00:31,447 INFO L276 IsEmpty]: Start isEmpty. Operand 3099 states and 3652 transitions. [2022-12-15 04:00:31,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-12-15 04:00:31,449 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:31,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:31,600 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 155 proven. 8 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-12-15 04:00:34,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:34,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3692 states to 3136 states and 3692 transitions. [2022-12-15 04:00:34,377 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 3692 transitions. [2022-12-15 04:00:34,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-12-15 04:00:34,379 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:34,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:34,442 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 04:00:38,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:38,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3749 states to 3181 states and 3749 transitions. [2022-12-15 04:00:38,094 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 3749 transitions. [2022-12-15 04:00:38,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-12-15 04:00:38,096 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:38,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:38,158 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 04:00:41,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:41,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3808 states to 3226 states and 3808 transitions. [2022-12-15 04:00:41,756 INFO L276 IsEmpty]: Start isEmpty. Operand 3226 states and 3808 transitions. [2022-12-15 04:00:41,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-12-15 04:00:41,758 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:41,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:41,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:41,820 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 04:00:42,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:42,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3822 states to 3241 states and 3822 transitions. [2022-12-15 04:00:42,816 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 3822 transitions. [2022-12-15 04:00:42,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-12-15 04:00:42,817 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:42,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:42,879 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 04:00:43,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:43,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3836 states to 3256 states and 3836 transitions. [2022-12-15 04:00:43,950 INFO L276 IsEmpty]: Start isEmpty. Operand 3256 states and 3836 transitions. [2022-12-15 04:00:43,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-12-15 04:00:43,951 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:43,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:44,028 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 04:00:44,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:44,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3845 states to 3266 states and 3845 transitions. [2022-12-15 04:00:44,676 INFO L276 IsEmpty]: Start isEmpty. Operand 3266 states and 3845 transitions. [2022-12-15 04:00:44,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-12-15 04:00:44,677 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:44,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:44,739 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 04:00:46,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:46,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3857 states to 3279 states and 3857 transitions. [2022-12-15 04:00:46,142 INFO L276 IsEmpty]: Start isEmpty. Operand 3279 states and 3857 transitions. [2022-12-15 04:00:46,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-12-15 04:00:46,144 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:46,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:46,206 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 04:00:46,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:46,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3867 states to 3289 states and 3867 transitions. [2022-12-15 04:00:46,457 INFO L276 IsEmpty]: Start isEmpty. Operand 3289 states and 3867 transitions. [2022-12-15 04:00:46,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-12-15 04:00:46,459 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:46,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:46,522 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 04:00:47,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:47,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3877 states to 3299 states and 3877 transitions. [2022-12-15 04:00:47,149 INFO L276 IsEmpty]: Start isEmpty. Operand 3299 states and 3877 transitions. [2022-12-15 04:00:47,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-12-15 04:00:47,151 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:47,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:47,287 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 197 proven. 18 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-12-15 04:00:47,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:47,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3890 states to 3312 states and 3890 transitions. [2022-12-15 04:00:47,813 INFO L276 IsEmpty]: Start isEmpty. Operand 3312 states and 3890 transitions. [2022-12-15 04:00:47,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-12-15 04:00:47,815 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:47,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:47,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:47,984 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 202 proven. 59 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-12-15 04:00:48,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:48,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3894 states to 3314 states and 3894 transitions. [2022-12-15 04:00:48,800 INFO L276 IsEmpty]: Start isEmpty. Operand 3314 states and 3894 transitions. [2022-12-15 04:00:48,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-12-15 04:00:48,801 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:48,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:48,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:48,904 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-15 04:00:49,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:49,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3913 states to 3328 states and 3913 transitions. [2022-12-15 04:00:49,654 INFO L276 IsEmpty]: Start isEmpty. Operand 3328 states and 3913 transitions. [2022-12-15 04:00:49,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-12-15 04:00:49,656 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:49,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:49,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:49,753 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-15 04:00:50,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:50,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3936 states to 3347 states and 3936 transitions. [2022-12-15 04:00:50,761 INFO L276 IsEmpty]: Start isEmpty. Operand 3347 states and 3936 transitions. [2022-12-15 04:00:50,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-12-15 04:00:50,763 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:50,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:50,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:50,861 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-15 04:00:51,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:51,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3943 states to 3354 states and 3943 transitions. [2022-12-15 04:00:51,863 INFO L276 IsEmpty]: Start isEmpty. Operand 3354 states and 3943 transitions. [2022-12-15 04:00:51,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-12-15 04:00:51,865 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:51,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:51,962 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-15 04:00:52,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:52,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3944 states to 3356 states and 3944 transitions. [2022-12-15 04:00:52,506 INFO L276 IsEmpty]: Start isEmpty. Operand 3356 states and 3944 transitions. [2022-12-15 04:00:52,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-12-15 04:00:52,509 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:52,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:52,642 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-15 04:00:52,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:52,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3945 states to 3358 states and 3945 transitions. [2022-12-15 04:00:52,888 INFO L276 IsEmpty]: Start isEmpty. Operand 3358 states and 3945 transitions. [2022-12-15 04:00:52,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-12-15 04:00:52,890 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:52,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:52,943 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-12-15 04:00:53,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:53,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3967 states to 3380 states and 3967 transitions. [2022-12-15 04:00:53,727 INFO L276 IsEmpty]: Start isEmpty. Operand 3380 states and 3967 transitions. [2022-12-15 04:00:53,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-12-15 04:00:53,729 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:53,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:53,781 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-12-15 04:00:54,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:54,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3984 states to 3398 states and 3984 transitions. [2022-12-15 04:00:54,239 INFO L276 IsEmpty]: Start isEmpty. Operand 3398 states and 3984 transitions. [2022-12-15 04:00:54,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-12-15 04:00:54,241 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:54,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:54,294 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-12-15 04:00:54,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:54,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3985 states to 3401 states and 3985 transitions. [2022-12-15 04:00:54,995 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 3985 transitions. [2022-12-15 04:00:54,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-12-15 04:00:54,996 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:54,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:55,049 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-12-15 04:00:55,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:55,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3990 states to 3408 states and 3990 transitions. [2022-12-15 04:00:55,859 INFO L276 IsEmpty]: Start isEmpty. Operand 3408 states and 3990 transitions. [2022-12-15 04:00:55,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-12-15 04:00:55,860 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:55,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:55,913 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-12-15 04:00:55,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:55,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3991 states to 3410 states and 3991 transitions. [2022-12-15 04:00:55,994 INFO L276 IsEmpty]: Start isEmpty. Operand 3410 states and 3991 transitions. [2022-12-15 04:00:55,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2022-12-15 04:00:55,995 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:55,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:56,382 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 194 proven. 19 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 04:00:58,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:58,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4030 states to 3444 states and 4030 transitions. [2022-12-15 04:00:58,717 INFO L276 IsEmpty]: Start isEmpty. Operand 3444 states and 4030 transitions. [2022-12-15 04:00:58,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2022-12-15 04:00:58,719 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:58,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 04:00:58,865 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 194 proven. 19 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 04:00:59,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 04:00:59,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4033 states to 3448 states and 4033 transitions. [2022-12-15 04:00:59,419 INFO L276 IsEmpty]: Start isEmpty. Operand 3448 states and 4033 transitions. [2022-12-15 04:00:59,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-12-15 04:00:59,482 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 04:00:59,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 04:00:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 04:00:59,505 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-15 04:00:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 04:00:59,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 04:00:59,628 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-15 04:00:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 04:00:59,695 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 242 iterations. [2022-12-15 04:00:59,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 15.12 04:00:59 ImpRootNode [2022-12-15 04:00:59,822 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-12-15 04:00:59,823 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-15 04:00:59,823 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-15 04:00:59,823 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-15 04:00:59,823 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 03:58:15" (3/4) ... [2022-12-15 04:00:59,825 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-15 04:00:59,941 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d998179-61d0-4fa7-a746-9cd0be88486f/bin/ukojak-rkRKPMF4O4/witness.graphml [2022-12-15 04:00:59,942 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-15 04:00:59,942 INFO L158 Benchmark]: Toolchain (without parser) took 165777.06ms. Allocated memory was 155.2MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 110.3MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 395.7MB. Max. memory is 16.1GB. [2022-12-15 04:00:59,942 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 155.2MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-15 04:00:59,942 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.33ms. Allocated memory is still 155.2MB. Free memory was 109.8MB in the beginning and 83.5MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-15 04:00:59,943 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.51ms. Allocated memory is still 155.2MB. Free memory was 83.5MB in the beginning and 77.8MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-15 04:00:59,943 INFO L158 Benchmark]: Boogie Preprocessor took 37.58ms. Allocated memory is still 155.2MB. Free memory was 77.8MB in the beginning and 73.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-15 04:00:59,943 INFO L158 Benchmark]: RCFGBuilder took 946.10ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 73.7MB in the beginning and 120.5MB in the end (delta: -46.8MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. [2022-12-15 04:00:59,943 INFO L158 Benchmark]: CodeCheck took 164298.73ms. Allocated memory was 186.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 120.5MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 353.5MB. Max. memory is 16.1GB. [2022-12-15 04:00:59,944 INFO L158 Benchmark]: Witness Printer took 118.93ms. Allocated memory is still 1.7GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-15 04:00:59,946 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: 164.1s, OverallIterations: 242, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 905588 SdHoareTripleChecker+Valid, 1515.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 856384 mSDsluCounter, 130885 SdHoareTripleChecker+Invalid, 1303.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 105204 mSDsCounter, 258406 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1925560 IncrementalHoareTripleChecker+Invalid, 2183966 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 258406 mSolverCounterUnsat, 25681 mSDtfsCounter, 1925560 mSolverCounterSat, 10.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 260728 GetRequests, 255448 SyntacticMatches, 3760 SemanticMatches, 1520 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1686630 ImplicationChecksByTransitivity, 123.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.8s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 16.7s InterpolantComputationTime, 39527 NumberOfCodeBlocks, 39527 NumberOfCodeBlocksAsserted, 242 NumberOfCheckSat, 39059 ConstructedInterpolants, 0 QuantifiedInterpolants, 100740 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 241 InterpolantComputations, 177 PerfectInterpolantSequences, 30120/31189 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: 428]: 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)=3, 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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [L158] COND TRUE ((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1)) [L159] a11 = 1 [L160] a19 = 1 [L161] a28 = 10 [L162] a25 = 1 [L163] return -1; VAL [\old(input)=3, \result=-1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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))) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L427] COND TRUE ((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8)) VAL [\old(input)=6, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L428] reach_error() VAL [\old(input)=6, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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.13ms. Allocated memory is still 155.2MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 324.33ms. Allocated memory is still 155.2MB. Free memory was 109.8MB in the beginning and 83.5MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.51ms. Allocated memory is still 155.2MB. Free memory was 83.5MB in the beginning and 77.8MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.58ms. Allocated memory is still 155.2MB. Free memory was 77.8MB in the beginning and 73.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 946.10ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 73.7MB in the beginning and 120.5MB in the end (delta: -46.8MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. * CodeCheck took 164298.73ms. Allocated memory was 186.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 120.5MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 353.5MB. Max. memory is 16.1GB. * Witness Printer took 118.93ms. Allocated memory is still 1.7GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2022-12-15 04:00:59,966 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d998179-61d0-4fa7-a746-9cd0be88486f/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