./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label21.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 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_4f97d9e9-5164-4d02-9af9-23db888d9e39/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f97d9e9-5164-4d02-9af9-23db888d9e39/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f97d9e9-5164-4d02-9af9-23db888d9e39/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f97d9e9-5164-4d02-9af9-23db888d9e39/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label21.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f97d9e9-5164-4d02-9af9-23db888d9e39/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f97d9e9-5164-4d02-9af9-23db888d9e39/bin/ukojak-verify-ImItNfHLgk --witnessprinter.witness.filename witness --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 7fc08bc6eca06c500d742b65350dc2aa3c19e672662fd614514fbc6bd34af0fd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 22:05:36,500 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:05:36,568 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f97d9e9-5164-4d02-9af9-23db888d9e39/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-08 22:05:36,573 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:05:36,576 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 22:05:36,618 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:05:36,620 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:05:36,621 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 22:05:36,622 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:05:36,624 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:05:36,624 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:05:36,625 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:05:36,625 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:05:36,625 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:05:36,626 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:05:36,628 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:05:36,629 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:05:36,629 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:05:36,629 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:05:36,630 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:05:36,630 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:05:36,632 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:05:36,632 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:05:36,633 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 22:05:36,633 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 22:05:36,633 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 22:05:36,634 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:05:36,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 22:05:36,634 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:05:36,635 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:05:36,635 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:05:36,635 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 22:05:36,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:05:36,636 INFO L153 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_4f97d9e9-5164-4d02-9af9-23db888d9e39/bin/ukojak-verify-ImItNfHLgk/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_4f97d9e9-5164-4d02-9af9-23db888d9e39/bin/ukojak-verify-ImItNfHLgk Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 7fc08bc6eca06c500d742b65350dc2aa3c19e672662fd614514fbc6bd34af0fd [2024-11-08 22:05:36,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:05:36,927 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:05:36,930 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:05:36,932 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:05:36,932 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:05:36,934 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f97d9e9-5164-4d02-9af9-23db888d9e39/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/eca-rers2012/Problem01_label21.c Unable to find full path for "g++" [2024-11-08 22:05:39,014 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:05:39,306 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:05:39,307 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f97d9e9-5164-4d02-9af9-23db888d9e39/sv-benchmarks/c/eca-rers2012/Problem01_label21.c [2024-11-08 22:05:39,324 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f97d9e9-5164-4d02-9af9-23db888d9e39/bin/ukojak-verify-ImItNfHLgk/data/f831f232e/d35f67485cc747adae64e13daeeb520b/FLAG093503c06 [2024-11-08 22:05:39,343 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f97d9e9-5164-4d02-9af9-23db888d9e39/bin/ukojak-verify-ImItNfHLgk/data/f831f232e/d35f67485cc747adae64e13daeeb520b [2024-11-08 22:05:39,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:05:39,348 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:05:39,349 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:05:39,350 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:05:39,355 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:05:39,356 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:05:39" (1/1) ... [2024-11-08 22:05:39,357 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ab9cd45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:39, skipping insertion in model container [2024-11-08 22:05:39,358 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:05:39" (1/1) ... [2024-11-08 22:05:39,414 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:05:39,780 WARN L250 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_4f97d9e9-5164-4d02-9af9-23db888d9e39/sv-benchmarks/c/eca-rers2012/Problem01_label21.c[15876,15889] [2024-11-08 22:05:39,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:05:39,908 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:05:40,026 WARN L250 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_4f97d9e9-5164-4d02-9af9-23db888d9e39/sv-benchmarks/c/eca-rers2012/Problem01_label21.c[15876,15889] [2024-11-08 22:05:40,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:05:40,097 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:05:40,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:40 WrapperNode [2024-11-08 22:05:40,097 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:05:40,099 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:05:40,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:05:40,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:05:40,108 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:40" (1/1) ... [2024-11-08 22:05:40,125 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:40" (1/1) ... [2024-11-08 22:05:40,191 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-08 22:05:40,192 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:05:40,193 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:05:40,193 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:05:40,193 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:05:40,206 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:40" (1/1) ... [2024-11-08 22:05:40,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:40" (1/1) ... [2024-11-08 22:05:40,215 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:40" (1/1) ... [2024-11-08 22:05:40,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:40" (1/1) ... [2024-11-08 22:05:40,253 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:40" (1/1) ... [2024-11-08 22:05:40,266 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:40" (1/1) ... [2024-11-08 22:05:40,276 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:40" (1/1) ... [2024-11-08 22:05:40,282 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:40" (1/1) ... [2024-11-08 22:05:40,290 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:05:40,292 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:05:40,293 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:05:40,293 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:05:40,294 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:40" (1/1) ... [2024-11-08 22:05:40,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 22:05:40,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f97d9e9-5164-4d02-9af9-23db888d9e39/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 22:05:40,328 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f97d9e9-5164-4d02-9af9-23db888d9e39/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 22:05:40,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f97d9e9-5164-4d02-9af9-23db888d9e39/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 22:05:40,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:05:40,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 22:05:40,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:05:40,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:05:40,450 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:05:40,452 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:05:41,726 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-08 22:05:41,728 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:05:42,057 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:05:42,058 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:05:42,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:05:42 BoogieIcfgContainer [2024-11-08 22:05:42,058 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:05:42,059 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 22:05:42,060 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 22:05:42,071 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 22:05:42,072 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:05:42" (1/1) ... [2024-11-08 22:05:42,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:05:42,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:42,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-08 22:05:42,150 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-08 22:05:42,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-08 22:05:42,157 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:42,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:42,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:05:43,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:43,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 145 states and 231 transitions. [2024-11-08 22:05:43,495 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 231 transitions. [2024-11-08 22:05:43,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-08 22:05:43,499 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:43,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:43,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:05:44,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:44,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 215 states and 304 transitions. [2024-11-08 22:05:44,569 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 304 transitions. [2024-11-08 22:05:44,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-08 22:05:44,573 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:44,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:44,748 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 22:05:44,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:44,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 216 states and 305 transitions. [2024-11-08 22:05:44,928 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 305 transitions. [2024-11-08 22:05:44,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-08 22:05:44,934 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:44,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:45,118 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:05:45,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:45,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 231 states and 323 transitions. [2024-11-08 22:05:45,309 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 323 transitions. [2024-11-08 22:05:45,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-08 22:05:45,312 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:45,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:45,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:45,593 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:05:45,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:45,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 235 states and 330 transitions. [2024-11-08 22:05:45,879 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 330 transitions. [2024-11-08 22:05:45,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-08 22:05:45,883 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:45,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:46,077 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:05:46,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:46,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 240 states and 335 transitions. [2024-11-08 22:05:46,155 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 335 transitions. [2024-11-08 22:05:46,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 22:05:46,156 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:46,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:46,291 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:05:46,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:46,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 256 states and 356 transitions. [2024-11-08 22:05:46,677 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 356 transitions. [2024-11-08 22:05:46,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 22:05:46,678 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:46,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:46,838 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:05:47,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:47,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 282 states and 386 transitions. [2024-11-08 22:05:47,470 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 386 transitions. [2024-11-08 22:05:47,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 22:05:47,471 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:47,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:47,710 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 22:05:48,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:48,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 293 states and 401 transitions. [2024-11-08 22:05:48,176 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 401 transitions. [2024-11-08 22:05:48,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 22:05:48,177 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:48,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:48,281 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 22:05:48,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:48,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 314 states and 426 transitions. [2024-11-08 22:05:48,932 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 426 transitions. [2024-11-08 22:05:48,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 22:05:48,933 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:48,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:49,250 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 22:05:49,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:49,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 317 states and 430 transitions. [2024-11-08 22:05:49,522 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 430 transitions. [2024-11-08 22:05:49,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 22:05:49,523 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:49,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:49,757 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 22:05:50,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:50,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 328 states and 442 transitions. [2024-11-08 22:05:50,064 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 442 transitions. [2024-11-08 22:05:50,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 22:05:50,067 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:50,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:50,281 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 32 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 22:05:50,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:50,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 330 states and 444 transitions. [2024-11-08 22:05:50,335 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 444 transitions. [2024-11-08 22:05:50,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-08 22:05:50,336 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:50,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:50,418 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 22:05:50,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:50,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 333 states and 449 transitions. [2024-11-08 22:05:50,633 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 449 transitions. [2024-11-08 22:05:50,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 22:05:50,635 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:50,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:50,959 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 22:05:51,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:51,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 348 states and 467 transitions. [2024-11-08 22:05:51,579 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 467 transitions. [2024-11-08 22:05:51,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 22:05:51,581 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:51,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:51,734 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-08 22:05:52,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:52,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 357 states and 479 transitions. [2024-11-08 22:05:52,208 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 479 transitions. [2024-11-08 22:05:52,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 22:05:52,210 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:52,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:52,374 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-08 22:05:52,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:52,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 361 states and 487 transitions. [2024-11-08 22:05:52,826 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 487 transitions. [2024-11-08 22:05:52,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 22:05:52,828 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:52,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:52,939 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:05:53,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:53,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 375 states and 501 transitions. [2024-11-08 22:05:53,071 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 501 transitions. [2024-11-08 22:05:53,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 22:05:53,074 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:53,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:53,202 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 22:05:53,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:53,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 384 states and 511 transitions. [2024-11-08 22:05:53,452 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 511 transitions. [2024-11-08 22:05:53,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 22:05:53,453 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:53,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:53,554 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:05:53,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:53,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 408 states and 536 transitions. [2024-11-08 22:05:53,774 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 536 transitions. [2024-11-08 22:05:53,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 22:05:53,776 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:53,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:53,924 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:05:54,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:54,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 441 states and 571 transitions. [2024-11-08 22:05:54,413 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 571 transitions. [2024-11-08 22:05:54,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 22:05:54,415 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:54,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:54,627 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 22:05:55,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:55,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 463 states and 595 transitions. [2024-11-08 22:05:55,275 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 595 transitions. [2024-11-08 22:05:55,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 22:05:55,277 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:55,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:55,434 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 67 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:05:55,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:55,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 479 states and 620 transitions. [2024-11-08 22:05:55,922 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 620 transitions. [2024-11-08 22:05:55,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 22:05:55,924 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:55,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:56,052 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:05:56,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:56,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 508 states and 651 transitions. [2024-11-08 22:05:56,331 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 651 transitions. [2024-11-08 22:05:56,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-08 22:05:56,332 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:56,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:56,493 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 22:05:57,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:57,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 552 states and 696 transitions. [2024-11-08 22:05:57,104 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 696 transitions. [2024-11-08 22:05:57,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-08 22:05:57,106 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:57,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:57,249 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-08 22:05:58,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:58,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 585 states and 734 transitions. [2024-11-08 22:05:58,399 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 734 transitions. [2024-11-08 22:05:58,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-08 22:05:58,401 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:58,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:58,663 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 22:05:59,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:59,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 593 states and 744 transitions. [2024-11-08 22:05:59,055 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 744 transitions. [2024-11-08 22:05:59,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 22:05:59,058 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:59,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:59,251 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-08 22:05:59,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:59,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 598 states and 749 transitions. [2024-11-08 22:05:59,446 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 749 transitions. [2024-11-08 22:05:59,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 22:05:59,448 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:59,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:59,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:59,596 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-08 22:06:00,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:00,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 601 states and 753 transitions. [2024-11-08 22:06:00,187 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 753 transitions. [2024-11-08 22:06:00,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 22:06:00,195 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:00,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:00,410 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:06:01,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:01,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 629 states and 784 transitions. [2024-11-08 22:06:01,212 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 784 transitions. [2024-11-08 22:06:01,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 22:06:01,213 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:01,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:01,345 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-08 22:06:01,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:01,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 630 states and 784 transitions. [2024-11-08 22:06:01,402 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 784 transitions. [2024-11-08 22:06:01,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-08 22:06:01,403 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:01,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:01,892 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:06:04,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:04,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 702 states and 873 transitions. [2024-11-08 22:06:04,064 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 873 transitions. [2024-11-08 22:06:04,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 22:06:04,066 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:04,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:04,327 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 22:06:05,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:05,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 739 states and 915 transitions. [2024-11-08 22:06:05,708 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 915 transitions. [2024-11-08 22:06:05,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 22:06:05,710 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:05,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:05,865 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 22:06:06,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:06,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 758 states and 936 transitions. [2024-11-08 22:06:06,591 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 936 transitions. [2024-11-08 22:06:06,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 22:06:06,594 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:06,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:06,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:06,715 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-08 22:06:06,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:06,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 759 states and 936 transitions. [2024-11-08 22:06:06,778 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 936 transitions. [2024-11-08 22:06:06,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 22:06:06,780 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:06,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:06,988 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:06:07,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:07,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 803 states and 981 transitions. [2024-11-08 22:06:07,656 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 981 transitions. [2024-11-08 22:06:07,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 22:06:07,659 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:07,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:07,959 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 101 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 22:06:08,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:08,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 806 states and 985 transitions. [2024-11-08 22:06:08,326 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 985 transitions. [2024-11-08 22:06:08,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 22:06:08,329 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:08,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:08,508 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-08 22:06:08,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:08,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 807 states and 987 transitions. [2024-11-08 22:06:08,877 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 987 transitions. [2024-11-08 22:06:08,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 22:06:08,879 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:08,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:08,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:09,170 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 99 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 22:06:09,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:09,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 809 states and 989 transitions. [2024-11-08 22:06:09,372 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 989 transitions. [2024-11-08 22:06:09,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 22:06:09,374 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:09,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:09,705 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 70 proven. 3 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-08 22:06:09,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:09,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 812 states and 992 transitions. [2024-11-08 22:06:09,963 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 992 transitions. [2024-11-08 22:06:09,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 22:06:09,965 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:09,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:10,205 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 90 proven. 3 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-08 22:06:10,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:10,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 815 states and 996 transitions. [2024-11-08 22:06:10,502 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 996 transitions. [2024-11-08 22:06:10,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 22:06:10,524 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:10,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:11,193 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 84 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:06:13,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:13,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 896 states and 1097 transitions. [2024-11-08 22:06:13,764 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1097 transitions. [2024-11-08 22:06:13,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 22:06:13,766 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:13,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:13,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:14,136 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 84 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:06:14,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:14,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 899 states and 1100 transitions. [2024-11-08 22:06:14,517 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1100 transitions. [2024-11-08 22:06:14,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 22:06:14,519 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:14,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:14,686 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 22:06:15,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:15,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 926 states and 1133 transitions. [2024-11-08 22:06:15,322 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1133 transitions. [2024-11-08 22:06:15,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 22:06:15,324 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:15,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:15,460 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 22:06:15,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:15,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 927 states and 1133 transitions. [2024-11-08 22:06:15,791 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1133 transitions. [2024-11-08 22:06:15,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 22:06:15,793 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:15,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:16,465 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 90 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:06:18,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:18,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1011 states and 1229 transitions. [2024-11-08 22:06:18,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1229 transitions. [2024-11-08 22:06:18,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 22:06:18,457 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:18,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:18,989 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 22:06:20,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:20,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1082 states and 1300 transitions. [2024-11-08 22:06:20,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1300 transitions. [2024-11-08 22:06:20,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 22:06:20,538 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:20,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:20,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:20,719 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 127 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-08 22:06:21,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:21,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 1083 states and 1301 transitions. [2024-11-08 22:06:21,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1301 transitions. [2024-11-08 22:06:21,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-08 22:06:21,098 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:21,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:21,258 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-08 22:06:21,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:21,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1084 states and 1302 transitions. [2024-11-08 22:06:21,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1302 transitions. [2024-11-08 22:06:21,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 22:06:21,526 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:21,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:21,639 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-08 22:06:21,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:21,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1106 states and 1324 transitions. [2024-11-08 22:06:21,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1324 transitions. [2024-11-08 22:06:21,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 22:06:21,869 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:21,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:21,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:22,287 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 99 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-08 22:06:23,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:23,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1118 states and 1338 transitions. [2024-11-08 22:06:23,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1338 transitions. [2024-11-08 22:06:23,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 22:06:23,206 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:23,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:23,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:23,375 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-08 22:06:24,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:24,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1139 states and 1366 transitions. [2024-11-08 22:06:24,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1366 transitions. [2024-11-08 22:06:24,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 22:06:24,312 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:24,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:24,606 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:06:25,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:25,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1172 states and 1402 transitions. [2024-11-08 22:06:25,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1402 transitions. [2024-11-08 22:06:25,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-08 22:06:25,925 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:25,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:25,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:26,007 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-08 22:06:26,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:26,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1188 states and 1420 transitions. [2024-11-08 22:06:26,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1420 transitions. [2024-11-08 22:06:26,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-08 22:06:26,720 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:26,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:26,787 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-08 22:06:27,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:27,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1195 states and 1428 transitions. [2024-11-08 22:06:27,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1428 transitions. [2024-11-08 22:06:27,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 22:06:27,248 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:27,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:27,338 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-08 22:06:27,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:27,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1220 states and 1453 transitions. [2024-11-08 22:06:27,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1453 transitions. [2024-11-08 22:06:27,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 22:06:27,841 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:27,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:28,461 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:06:32,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:32,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1296 states and 1551 transitions. [2024-11-08 22:06:32,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 1551 transitions. [2024-11-08 22:06:32,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 22:06:32,015 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:32,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:32,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:32,390 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:06:32,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:32,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1298 states and 1553 transitions. [2024-11-08 22:06:32,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1553 transitions. [2024-11-08 22:06:32,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 22:06:32,852 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:32,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:33,133 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:06:33,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:33,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1313 states and 1569 transitions. [2024-11-08 22:06:33,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1569 transitions. [2024-11-08 22:06:33,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 22:06:33,880 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:33,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:34,137 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:06:34,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:34,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1318 states and 1573 transitions. [2024-11-08 22:06:34,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1573 transitions. [2024-11-08 22:06:34,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 22:06:34,393 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:34,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:34,739 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:06:35,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:35,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1320 states and 1574 transitions. [2024-11-08 22:06:35,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1574 transitions. [2024-11-08 22:06:35,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-08 22:06:35,130 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:35,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:35,477 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 146 proven. 49 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 22:06:37,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:37,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1347 states and 1605 transitions. [2024-11-08 22:06:37,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1605 transitions. [2024-11-08 22:06:37,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-08 22:06:37,692 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:37,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:38,042 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 146 proven. 49 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 22:06:39,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:39,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1372 states and 1634 transitions. [2024-11-08 22:06:39,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1634 transitions. [2024-11-08 22:06:39,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-08 22:06:39,983 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:39,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:40,453 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 127 proven. 44 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-08 22:06:41,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:41,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1381 states and 1644 transitions. [2024-11-08 22:06:41,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1644 transitions. [2024-11-08 22:06:41,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-08 22:06:41,106 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:41,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:41,567 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:06:45,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:45,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1455 states and 1732 transitions. [2024-11-08 22:06:45,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 1732 transitions. [2024-11-08 22:06:45,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-08 22:06:45,216 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:45,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:45,528 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:06:46,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:46,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1458 states and 1735 transitions. [2024-11-08 22:06:46,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 1735 transitions. [2024-11-08 22:06:46,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-08 22:06:46,058 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:46,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:46,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:46,825 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 127 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:06:49,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:49,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1502 states and 1791 transitions. [2024-11-08 22:06:49,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 1791 transitions. [2024-11-08 22:06:49,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-08 22:06:49,874 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:49,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:49,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:49,993 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-08 22:06:51,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:51,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1509 states and 1799 transitions. [2024-11-08 22:06:51,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1799 transitions. [2024-11-08 22:06:51,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-08 22:06:51,087 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:51,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:51,504 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 134 proven. 51 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-08 22:06:51,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:51,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1516 states and 1806 transitions. [2024-11-08 22:06:51,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 1806 transitions. [2024-11-08 22:06:51,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-08 22:06:51,684 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:51,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:51,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:52,266 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-08 22:06:55,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:55,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1555 states and 1853 transitions. [2024-11-08 22:06:55,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1853 transitions. [2024-11-08 22:06:55,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-08 22:06:55,476 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:55,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:55,904 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-08 22:06:56,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:56,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1861 states to 1564 states and 1861 transitions. [2024-11-08 22:06:56,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 1861 transitions. [2024-11-08 22:06:56,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-08 22:06:56,531 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:56,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:56,958 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-08 22:06:57,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:57,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1566 states and 1862 transitions. [2024-11-08 22:06:57,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 1862 transitions. [2024-11-08 22:06:57,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-08 22:06:57,392 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:57,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:57,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:57,543 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-08 22:06:59,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:59,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1589 states and 1889 transitions. [2024-11-08 22:06:59,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 1889 transitions. [2024-11-08 22:06:59,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-08 22:06:59,904 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:59,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:59,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:00,283 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 176 proven. 65 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-08 22:07:02,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:02,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1612 states and 1926 transitions. [2024-11-08 22:07:02,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 1926 transitions. [2024-11-08 22:07:02,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-08 22:07:02,453 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:02,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:02,902 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 176 proven. 65 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-08 22:07:04,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:04,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1615 states and 1929 transitions. [2024-11-08 22:07:04,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 1929 transitions. [2024-11-08 22:07:04,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 22:07:04,192 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:04,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:04,686 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 137 proven. 54 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-08 22:07:04,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:04,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1933 states to 1618 states and 1933 transitions. [2024-11-08 22:07:04,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 1933 transitions. [2024-11-08 22:07:04,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 22:07:04,863 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:04,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:05,338 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-08 22:07:08,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:08,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1669 states and 1994 transitions. [2024-11-08 22:07:08,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 1994 transitions. [2024-11-08 22:07:08,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 22:07:08,686 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:08,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:08,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:08,961 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-08 22:07:09,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:09,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1672 states and 1997 transitions. [2024-11-08 22:07:09,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1997 transitions. [2024-11-08 22:07:09,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-08 22:07:09,656 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:09,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:09,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:09,783 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 171 proven. 76 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-08 22:07:10,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:10,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 1687 states and 2017 transitions. [2024-11-08 22:07:10,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 2017 transitions. [2024-11-08 22:07:10,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 22:07:10,102 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:10,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:10,736 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-08 22:07:13,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:13,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2060 states to 1722 states and 2060 transitions. [2024-11-08 22:07:13,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 2060 transitions. [2024-11-08 22:07:13,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 22:07:13,780 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:13,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:14,081 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-08 22:07:14,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:14,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 1731 states and 2069 transitions. [2024-11-08 22:07:14,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 2069 transitions. [2024-11-08 22:07:14,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 22:07:14,919 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:14,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:15,292 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-08 22:07:16,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:16,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 1739 states and 2076 transitions. [2024-11-08 22:07:16,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2076 transitions. [2024-11-08 22:07:16,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 22:07:16,549 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:16,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:16,867 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 140 proven. 71 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 22:07:17,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:17,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 1742 states and 2079 transitions. [2024-11-08 22:07:17,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 2079 transitions. [2024-11-08 22:07:17,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-08 22:07:17,501 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:17,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:17,632 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-08 22:07:18,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:18,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2091 states to 1755 states and 2091 transitions. [2024-11-08 22:07:18,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2091 transitions. [2024-11-08 22:07:18,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-08 22:07:18,964 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:18,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:19,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:19,233 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-08 22:07:19,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:19,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 1769 states and 2105 transitions. [2024-11-08 22:07:19,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 2105 transitions. [2024-11-08 22:07:19,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-08 22:07:19,902 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:19,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:20,991 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 119 proven. 137 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 22:07:26,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:26,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 1903 states and 2260 transitions. [2024-11-08 22:07:26,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 2260 transitions. [2024-11-08 22:07:26,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-08 22:07:26,716 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:26,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:27,042 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 58 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-08 22:07:28,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:28,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2273 states to 1916 states and 2273 transitions. [2024-11-08 22:07:28,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2273 transitions. [2024-11-08 22:07:28,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-08 22:07:28,035 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:28,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:28,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:28,183 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 181 proven. 81 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-08 22:07:28,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:28,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 1921 states and 2280 transitions. [2024-11-08 22:07:28,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1921 states and 2280 transitions. [2024-11-08 22:07:28,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-08 22:07:28,708 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:28,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:28,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:28,846 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 181 proven. 81 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-08 22:07:29,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:29,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2296 states to 1936 states and 2296 transitions. [2024-11-08 22:07:29,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 2296 transitions. [2024-11-08 22:07:29,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-08 22:07:29,595 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:29,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:29,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:29,995 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:07:30,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:30,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 1949 states and 2309 transitions. [2024-11-08 22:07:30,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 2309 transitions. [2024-11-08 22:07:30,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-08 22:07:30,720 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:30,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:31,342 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 129 proven. 142 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 22:07:33,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:33,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2387 states to 2023 states and 2387 transitions. [2024-11-08 22:07:33,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2023 states and 2387 transitions. [2024-11-08 22:07:33,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-08 22:07:33,036 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:33,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:33,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:33,116 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-08 22:07:33,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:33,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 2024 states and 2389 transitions. [2024-11-08 22:07:33,586 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 2389 transitions. [2024-11-08 22:07:33,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-08 22:07:33,587 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:33,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:33,667 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-08 22:07:34,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:34,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2404 states to 2039 states and 2404 transitions. [2024-11-08 22:07:34,296 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 2404 transitions. [2024-11-08 22:07:34,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-08 22:07:34,298 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:34,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:34,608 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 152 proven. 83 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-08 22:07:35,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:35,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2051 states and 2416 transitions. [2024-11-08 22:07:35,613 INFO L276 IsEmpty]: Start isEmpty. Operand 2051 states and 2416 transitions. [2024-11-08 22:07:35,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-08 22:07:35,615 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:35,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:35,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:36,193 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 172 proven. 137 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 22:07:37,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:37,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2062 states and 2435 transitions. [2024-11-08 22:07:37,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 2435 transitions. [2024-11-08 22:07:37,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-08 22:07:37,699 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:37,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:38,261 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 172 proven. 137 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 22:07:38,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:38,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2067 states and 2440 transitions. [2024-11-08 22:07:38,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 2440 transitions. [2024-11-08 22:07:38,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-08 22:07:38,985 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:38,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:39,123 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-08 22:07:40,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:40,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2078 states and 2459 transitions. [2024-11-08 22:07:40,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2078 states and 2459 transitions. [2024-11-08 22:07:40,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-08 22:07:40,227 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:40,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:40,615 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 172 proven. 137 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 22:07:42,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:42,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2094 states and 2475 transitions. [2024-11-08 22:07:42,033 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 2475 transitions. [2024-11-08 22:07:42,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-08 22:07:42,035 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:42,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:42,119 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-08 22:07:42,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:42,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2095 states and 2477 transitions. [2024-11-08 22:07:42,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2095 states and 2477 transitions. [2024-11-08 22:07:42,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-08 22:07:42,700 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:42,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:42,842 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-08 22:07:43,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:43,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2110 states and 2493 transitions. [2024-11-08 22:07:43,459 INFO L276 IsEmpty]: Start isEmpty. Operand 2110 states and 2493 transitions. [2024-11-08 22:07:43,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-08 22:07:43,462 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:43,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:43,771 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 155 proven. 86 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-08 22:07:46,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:46,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2540 states to 2147 states and 2540 transitions. [2024-11-08 22:07:46,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 2540 transitions. [2024-11-08 22:07:46,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-08 22:07:46,218 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:46,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:46,312 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-08 22:07:47,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:47,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2165 states and 2560 transitions. [2024-11-08 22:07:47,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2165 states and 2560 transitions. [2024-11-08 22:07:47,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-08 22:07:47,104 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:47,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:47,245 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-08 22:07:47,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:47,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2167 states and 2562 transitions. [2024-11-08 22:07:47,551 INFO L276 IsEmpty]: Start isEmpty. Operand 2167 states and 2562 transitions. [2024-11-08 22:07:47,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-08 22:07:47,553 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:47,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:47,640 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-08 22:07:48,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:48,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2168 states and 2562 transitions. [2024-11-08 22:07:48,213 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 2562 transitions. [2024-11-08 22:07:48,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-08 22:07:48,214 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:48,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:48,300 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-08 22:07:48,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:48,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2169 states and 2562 transitions. [2024-11-08 22:07:48,843 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 2562 transitions. [2024-11-08 22:07:48,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-08 22:07:48,846 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:48,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:49,258 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-08 22:07:50,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:50,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2567 states to 2172 states and 2567 transitions. [2024-11-08 22:07:50,173 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 2567 transitions. [2024-11-08 22:07:50,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-08 22:07:50,175 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:50,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:50,685 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 186 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-08 22:07:51,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:51,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2175 states and 2570 transitions. [2024-11-08 22:07:51,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2175 states and 2570 transitions. [2024-11-08 22:07:51,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-08 22:07:51,678 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:51,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:52,324 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 192 proven. 59 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-08 22:07:54,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:54,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2580 states to 2182 states and 2580 transitions. [2024-11-08 22:07:54,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 2580 transitions. [2024-11-08 22:07:54,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-08 22:07:54,705 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:54,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:55,080 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 166 proven. 97 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-08 22:07:56,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:56,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2597 states to 2196 states and 2597 transitions. [2024-11-08 22:07:56,360 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 2597 transitions. [2024-11-08 22:07:56,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-08 22:07:56,361 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:56,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:56,499 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-08 22:07:57,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:57,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2612 states to 2210 states and 2612 transitions. [2024-11-08 22:07:57,452 INFO L276 IsEmpty]: Start isEmpty. Operand 2210 states and 2612 transitions. [2024-11-08 22:07:57,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-08 22:07:57,454 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:57,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:57,592 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 229 proven. 105 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-08 22:07:58,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:58,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2652 states to 2239 states and 2652 transitions. [2024-11-08 22:07:58,615 INFO L276 IsEmpty]: Start isEmpty. Operand 2239 states and 2652 transitions. [2024-11-08 22:07:58,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-08 22:07:58,617 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:58,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:58,922 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 169 proven. 100 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-08 22:07:59,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:59,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2666 states to 2253 states and 2666 transitions. [2024-11-08 22:07:59,616 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 2666 transitions. [2024-11-08 22:07:59,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-08 22:07:59,617 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:59,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:59,950 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 169 proven. 100 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-08 22:08:00,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:08:00,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2256 states and 2670 transitions. [2024-11-08 22:08:00,888 INFO L276 IsEmpty]: Start isEmpty. Operand 2256 states and 2670 transitions. [2024-11-08 22:08:00,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-08 22:08:00,890 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:08:00,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:08:00,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:01,416 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 200 proven. 63 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-08 22:08:02,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:08:02,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2259 states and 2674 transitions. [2024-11-08 22:08:02,205 INFO L276 IsEmpty]: Start isEmpty. Operand 2259 states and 2674 transitions. [2024-11-08 22:08:02,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-08 22:08:02,208 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:08:02,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:08:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:02,422 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-08 22:08:03,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:08:03,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2702 states to 2288 states and 2702 transitions. [2024-11-08 22:08:03,197 INFO L276 IsEmpty]: Start isEmpty. Operand 2288 states and 2702 transitions. [2024-11-08 22:08:03,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-08 22:08:03,200 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:08:03,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:08:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:03,936 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 65 proven. 278 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 22:08:05,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:08:05,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2358 states and 2774 transitions. [2024-11-08 22:08:05,727 INFO L276 IsEmpty]: Start isEmpty. Operand 2358 states and 2774 transitions. [2024-11-08 22:08:05,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-08 22:08:05,729 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:08:05,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:08:05,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:06,163 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-08 22:08:06,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:08:06,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2778 states to 2361 states and 2778 transitions. [2024-11-08 22:08:06,489 INFO L276 IsEmpty]: Start isEmpty. Operand 2361 states and 2778 transitions. [2024-11-08 22:08:06,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-08 22:08:06,490 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:08:06,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:08:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:06,967 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 22:08:13,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:08:13,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2422 states and 2853 transitions. [2024-11-08 22:08:13,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2422 states and 2853 transitions. [2024-11-08 22:08:13,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-08 22:08:13,356 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:08:13,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:08:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:13,666 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 22:08:15,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:08:15,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2869 states to 2437 states and 2869 transitions. [2024-11-08 22:08:15,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 2869 transitions. [2024-11-08 22:08:15,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-08 22:08:15,429 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:08:15,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:08:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:15,862 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 22:08:22,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:08:22,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2489 states and 2929 transitions. [2024-11-08 22:08:22,184 INFO L276 IsEmpty]: Start isEmpty. Operand 2489 states and 2929 transitions. [2024-11-08 22:08:22,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-08 22:08:22,185 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:08:22,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:08:22,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:22,403 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 22:08:23,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:08:23,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2931 states to 2491 states and 2931 transitions. [2024-11-08 22:08:23,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2491 states and 2931 transitions. [2024-11-08 22:08:23,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-08 22:08:23,286 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:08:23,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:08:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:23,790 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-08 22:08:24,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:08:24,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2494 states and 2934 transitions. [2024-11-08 22:08:24,858 INFO L276 IsEmpty]: Start isEmpty. Operand 2494 states and 2934 transitions. [2024-11-08 22:08:24,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-08 22:08:24,860 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:08:24,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:08:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:25,184 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 179 proven. 104 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 22:08:25,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:08:25,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2943 states to 2503 states and 2943 transitions. [2024-11-08 22:08:25,977 INFO L276 IsEmpty]: Start isEmpty. Operand 2503 states and 2943 transitions. [2024-11-08 22:08:25,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-08 22:08:25,979 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:08:25,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:08:26,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:26,283 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 173 proven. 104 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-11-08 22:08:28,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:08:28,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2970 states to 2527 states and 2970 transitions. [2024-11-08 22:08:28,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2527 states and 2970 transitions. [2024-11-08 22:08:28,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-08 22:08:28,639 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:08:28,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:08:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:29,323 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 22:08:36,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:08:36,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3037 states to 2584 states and 3037 transitions. [2024-11-08 22:08:36,314 INFO L276 IsEmpty]: Start isEmpty. Operand 2584 states and 3037 transitions. [2024-11-08 22:08:36,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-08 22:08:36,316 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:08:36,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:08:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:36,603 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 22:08:38,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:08:38,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3058 states to 2605 states and 3058 transitions. [2024-11-08 22:08:38,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 3058 transitions. [2024-11-08 22:08:38,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-08 22:08:38,438 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:08:38,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:08:38,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:38,920 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 175 proven. 106 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-08 22:08:39,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:08:39,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3061 states to 2608 states and 3061 transitions. [2024-11-08 22:08:39,819 INFO L276 IsEmpty]: Start isEmpty. Operand 2608 states and 3061 transitions. [2024-11-08 22:08:39,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-08 22:08:39,821 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:08:39,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:08:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:40,977 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 228 proven. 38 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-08 22:08:44,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:08:44,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3090 states to 2633 states and 3090 transitions. [2024-11-08 22:08:44,357 INFO L276 IsEmpty]: Start isEmpty. Operand 2633 states and 3090 transitions. [2024-11-08 22:08:44,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-08 22:08:44,359 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:08:44,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:08:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:45,419 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:08:52,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:08:52,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3167 states to 2704 states and 3167 transitions. [2024-11-08 22:08:52,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2704 states and 3167 transitions. [2024-11-08 22:08:52,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-08 22:08:52,622 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:08:52,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:08:52,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:53,041 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 186 proven. 111 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 22:08:53,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:08:53,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3174 states to 2711 states and 3174 transitions. [2024-11-08 22:08:53,480 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 3174 transitions. [2024-11-08 22:08:53,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-08 22:08:53,482 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:08:53,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:08:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:53,628 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 251 proven. 64 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-08 22:08:54,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:08:54,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3177 states to 2713 states and 3177 transitions. [2024-11-08 22:08:54,386 INFO L276 IsEmpty]: Start isEmpty. Operand 2713 states and 3177 transitions. [2024-11-08 22:08:54,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-08 22:08:54,388 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:08:54,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:08:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:54,891 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 185 proven. 152 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 22:08:57,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:08:57,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3210 states to 2744 states and 3210 transitions. [2024-11-08 22:08:57,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2744 states and 3210 transitions. [2024-11-08 22:08:57,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-08 22:08:57,537 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:08:57,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:08:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:57,885 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 189 proven. 114 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 22:08:58,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:08:58,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 2747 states and 3214 transitions. [2024-11-08 22:08:58,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2747 states and 3214 transitions. [2024-11-08 22:08:58,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-08 22:08:58,195 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:08:58,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:08:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:08:58,230 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 22:08:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:08:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:08:58,517 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 22:08:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:08:58,698 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 134 iterations. [2024-11-08 22:08:58,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 10:08:58 ImpRootNode [2024-11-08 22:08:58,890 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 22:08:58,890 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 22:08:58,890 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 22:08:58,891 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 22:08:58,891 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:05:42" (3/4) ... [2024-11-08 22:08:58,892 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 22:08:59,088 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f97d9e9-5164-4d02-9af9-23db888d9e39/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 22:08:59,088 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 22:08:59,089 INFO L158 Benchmark]: Toolchain (without parser) took 199741.13ms. Allocated memory was 119.5MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 78.3MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-08 22:08:59,089 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 119.5MB. Free memory is still 65.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:08:59,092 INFO L158 Benchmark]: CACSL2BoogieTranslator took 748.47ms. Allocated memory was 119.5MB in the beginning and 161.5MB in the end (delta: 41.9MB). Free memory was 78.0MB in the beginning and 123.5MB in the end (delta: -45.5MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2024-11-08 22:08:59,093 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.41ms. Allocated memory is still 161.5MB. Free memory was 123.5MB in the beginning and 117.2MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 22:08:59,093 INFO L158 Benchmark]: Boogie Preprocessor took 98.44ms. Allocated memory is still 161.5MB. Free memory was 117.2MB in the beginning and 113.1MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 22:08:59,094 INFO L158 Benchmark]: RCFGBuilder took 1766.25ms. Allocated memory is still 161.5MB. Free memory was 113.1MB in the beginning and 110.2MB in the end (delta: 2.9MB). Peak memory consumption was 70.0MB. Max. memory is 16.1GB. [2024-11-08 22:08:59,094 INFO L158 Benchmark]: CodeCheck took 196830.44ms. Allocated memory was 161.5MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 110.2MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-11-08 22:08:59,094 INFO L158 Benchmark]: Witness Printer took 198.04ms. Allocated memory is still 2.7GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-08 22:08:59,096 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 196.6s, OverallIterations: 134, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 386322 SdHoareTripleChecker+Valid, 1153.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 385265 mSDsluCounter, 66448 SdHoareTripleChecker+Invalid, 985.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 57507 mSDsCounter, 95596 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 831302 IncrementalHoareTripleChecker+Invalid, 926898 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 95596 mSolverCounterUnsat, 8941 mSDtfsCounter, 831302 mSolverCounterSat, 12.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 161062 GetRequests, 153252 SyntacticMatches, 6750 SemanticMatches, 1060 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 845739 ImplicationChecksByTransitivity, 133.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 1.0s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 36.6s InterpolantComputationTime, 24797 NumberOfCodeBlocks, 24797 NumberOfCodeBlocksAsserted, 134 NumberOfCheckSat, 24409 ConstructedInterpolants, 0 QuantifiedInterpolants, 149432 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 133 InterpolantComputations, 57 PerfectInterpolantSequences, 21791/26711 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: 435]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int d= 4; [L19] int e= 5; [L20] int f= 6; [L21] int c= 3; [L22] int b= 2; [L25] int u = 21; [L26] int v = 22; [L27] int w = 23; [L28] int x = 24; [L29] int y = 25; [L30] int z = 26; [L32] int a17 = 1; [L33] int a7 = 0; [L34] int a20 = 1; [L35] int a8 = 15; [L36] int a12 = 8; [L37] int a16 = 5; [L38] int a21 = 1; [L590] int output = -1; VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L344] a17 = 0 [L345] a16 = 4 [L346] return 21; VAL [\result=21, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L279] a20 = 0 [L280] a17 = 1 [L281] a16 = 6 [L282] return 21; VAL [\result=21, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L73] a17 = 0 [L74] return 26; VAL [\result=26, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND TRUE ((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13))))))) [L393] a20 = 0 [L394] a21 = 1 [L395] a8 = 14 [L396] a17 = 0 [L397] a16 = 5 [L398] a7 = 1 [L399] return -1; VAL [\result=-1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L410] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L413] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L416] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L419] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L422] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L425] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L428] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L431] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L434] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1)) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L435] reach_error() VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=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.25ms. Allocated memory is still 119.5MB. Free memory is still 65.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 748.47ms. Allocated memory was 119.5MB in the beginning and 161.5MB in the end (delta: 41.9MB). Free memory was 78.0MB in the beginning and 123.5MB in the end (delta: -45.5MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.41ms. Allocated memory is still 161.5MB. Free memory was 123.5MB in the beginning and 117.2MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 98.44ms. Allocated memory is still 161.5MB. Free memory was 117.2MB in the beginning and 113.1MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1766.25ms. Allocated memory is still 161.5MB. Free memory was 113.1MB in the beginning and 110.2MB in the end (delta: 2.9MB). Peak memory consumption was 70.0MB. Max. memory is 16.1GB. * CodeCheck took 196830.44ms. Allocated memory was 161.5MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 110.2MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 198.04ms. Allocated memory is still 2.7GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-08 22:08:59,140 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f97d9e9-5164-4d02-9af9-23db888d9e39/bin/ukojak-verify-ImItNfHLgk/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