./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label32.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adcebc4-a832-4e5b-9f64-663465580745/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adcebc4-a832-4e5b-9f64-663465580745/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adcebc4-a832-4e5b-9f64-663465580745/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adcebc4-a832-4e5b-9f64-663465580745/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label32.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adcebc4-a832-4e5b-9f64-663465580745/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adcebc4-a832-4e5b-9f64-663465580745/bin/ukojak-verify-EEHR8qb7sm --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 2b0b2a9797b90f95684a46496de9717e82eef5c31235380fd2859f2748d0f286 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 21:47:38,291 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 21:47:38,388 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adcebc4-a832-4e5b-9f64-663465580745/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 21:47:38,401 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 21:47:38,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 21:47:38,436 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 21:47:38,437 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 21:47:38,438 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 21:47:38,438 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 21:47:38,438 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 21:47:38,439 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 21:47:38,439 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 21:47:38,439 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 21:47:38,439 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 21:47:38,439 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 21:47:38,439 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 21:47:38,439 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 21:47:38,440 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 21:47:38,440 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 21:47:38,440 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 21:47:38,440 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 21:47:38,440 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 21:47:38,440 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 21:47:38,441 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 21:47:38,441 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 21:47:38,441 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 21:47:38,441 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 21:47:38,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:47:38,441 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 21:47:38,442 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 21:47:38,442 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 21:47:38,442 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 21:47:38,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 21:47:38,442 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_1adcebc4-a832-4e5b-9f64-663465580745/bin/ukojak-verify-EEHR8qb7sm 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 -> 2b0b2a9797b90f95684a46496de9717e82eef5c31235380fd2859f2748d0f286 [2024-11-13 21:47:38,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 21:47:38,754 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 21:47:38,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 21:47:38,758 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 21:47:38,759 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 21:47:38,760 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adcebc4-a832-4e5b-9f64-663465580745/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/eca-rers2012/Problem01_label32.c Unable to find full path for "g++" [2024-11-13 21:47:40,820 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 21:47:41,151 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 21:47:41,152 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adcebc4-a832-4e5b-9f64-663465580745/sv-benchmarks/c/eca-rers2012/Problem01_label32.c [2024-11-13 21:47:41,165 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adcebc4-a832-4e5b-9f64-663465580745/bin/ukojak-verify-EEHR8qb7sm/data/e42c6cf48/95f75792e80b45368440a833fd02bf0c/FLAGd12636bfc [2024-11-13 21:47:41,389 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adcebc4-a832-4e5b-9f64-663465580745/bin/ukojak-verify-EEHR8qb7sm/data/e42c6cf48/95f75792e80b45368440a833fd02bf0c [2024-11-13 21:47:41,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 21:47:41,393 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 21:47:41,394 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 21:47:41,394 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 21:47:41,397 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 21:47:41,398 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:47:41" (1/1) ... [2024-11-13 21:47:41,398 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@264a7bf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:47:41, skipping insertion in model container [2024-11-13 21:47:41,399 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:47:41" (1/1) ... [2024-11-13 21:47:41,430 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 21:47:41,744 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_1adcebc4-a832-4e5b-9f64-663465580745/sv-benchmarks/c/eca-rers2012/Problem01_label32.c[14752,14765] [2024-11-13 21:47:41,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:47:41,836 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 21:47:41,953 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_1adcebc4-a832-4e5b-9f64-663465580745/sv-benchmarks/c/eca-rers2012/Problem01_label32.c[14752,14765] [2024-11-13 21:47:41,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:47:42,009 INFO L204 MainTranslator]: Completed translation [2024-11-13 21:47:42,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:47:42 WrapperNode [2024-11-13 21:47:42,010 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 21:47:42,011 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 21:47:42,011 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 21:47:42,012 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 21:47:42,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:47:42" (1/1) ... [2024-11-13 21:47:42,041 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:47:42" (1/1) ... [2024-11-13 21:47:42,094 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-13 21:47:42,095 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 21:47:42,095 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 21:47:42,095 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 21:47:42,095 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 21:47:42,103 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:47:42" (1/1) ... [2024-11-13 21:47:42,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:47:42" (1/1) ... [2024-11-13 21:47:42,107 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:47:42" (1/1) ... [2024-11-13 21:47:42,108 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:47:42" (1/1) ... [2024-11-13 21:47:42,126 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:47:42" (1/1) ... [2024-11-13 21:47:42,133 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:47:42" (1/1) ... [2024-11-13 21:47:42,137 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:47:42" (1/1) ... [2024-11-13 21:47:42,140 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:47:42" (1/1) ... [2024-11-13 21:47:42,145 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 21:47:42,146 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 21:47:42,146 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 21:47:42,146 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 21:47:42,147 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:47:42" (1/1) ... [2024-11-13 21:47:42,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:47:42,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adcebc4-a832-4e5b-9f64-663465580745/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 21:47:42,205 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adcebc4-a832-4e5b-9f64-663465580745/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 21:47:42,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adcebc4-a832-4e5b-9f64-663465580745/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 21:47:42,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 21:47:42,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 21:47:42,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 21:47:42,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 21:47:42,334 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 21:47:42,337 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 21:47:43,671 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-13 21:47:43,671 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 21:47:43,995 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 21:47:43,997 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 21:47:43,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:47:43 BoogieIcfgContainer [2024-11-13 21:47:43,997 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 21:47:43,998 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 21:47:43,998 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 21:47:44,009 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 21:47:44,009 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:47:43" (1/1) ... [2024-11-13 21:47:44,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 21:47:44,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:44,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-13 21:47:44,084 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-13 21:47:44,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 21:47:44,089 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:44,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:44,638 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-13 21:47:45,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:45,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 145 states and 231 transitions. [2024-11-13 21:47:45,503 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 231 transitions. [2024-11-13 21:47:45,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 21:47:45,508 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:45,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:45,893 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-13 21:47:46,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:46,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 215 states and 304 transitions. [2024-11-13 21:47:46,869 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 304 transitions. [2024-11-13 21:47:46,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-13 21:47:46,873 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:46,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:47,066 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-13 21:47:47,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:47,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 216 states and 305 transitions. [2024-11-13 21:47:47,264 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 305 transitions. [2024-11-13 21:47:47,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-13 21:47:47,266 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:47,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:47,481 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-13 21:47:47,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:47,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 236 states and 328 transitions. [2024-11-13 21:47:47,734 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 328 transitions. [2024-11-13 21:47:47,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-13 21:47:47,737 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:47,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:47,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:47,956 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:47:48,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:48,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 237 states and 330 transitions. [2024-11-13 21:47:48,167 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 330 transitions. [2024-11-13 21:47:48,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-13 21:47:48,170 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:48,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:48,344 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:47:48,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:48,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 262 states and 361 transitions. [2024-11-13 21:47:48,865 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 361 transitions. [2024-11-13 21:47:48,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-13 21:47:48,866 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:48,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:48,988 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-13 21:47:49,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:49,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 288 states and 392 transitions. [2024-11-13 21:47:49,593 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 392 transitions. [2024-11-13 21:47:49,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 21:47:49,594 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:49,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:49,712 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-13 21:47:50,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:50,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 309 states and 416 transitions. [2024-11-13 21:47:50,212 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 416 transitions. [2024-11-13 21:47:50,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-13 21:47:50,213 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:50,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:50,483 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-13 21:47:50,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:50,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 334 states and 443 transitions. [2024-11-13 21:47:50,986 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 443 transitions. [2024-11-13 21:47:50,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 21:47:50,991 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:50,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:51,131 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:47:51,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:51,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 335 states and 445 transitions. [2024-11-13 21:47:51,324 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 445 transitions. [2024-11-13 21:47:51,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 21:47:51,326 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:51,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:51,447 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-13 21:47:51,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:51,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 338 states and 449 transitions. [2024-11-13 21:47:51,548 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 449 transitions. [2024-11-13 21:47:51,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-13 21:47:51,550 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:51,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:51,708 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 21:47:52,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:52,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 347 states and 463 transitions. [2024-11-13 21:47:52,148 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 463 transitions. [2024-11-13 21:47:52,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-13 21:47:52,150 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:52,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:52,331 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:47:52,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:52,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 353 states and 469 transitions. [2024-11-13 21:47:52,417 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 469 transitions. [2024-11-13 21:47:52,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 21:47:52,418 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:52,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:52,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:52,627 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 21:47:53,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:53,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 374 states and 492 transitions. [2024-11-13 21:47:53,138 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 492 transitions. [2024-11-13 21:47:53,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 21:47:53,139 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:53,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:53,238 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:47:53,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:53,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 392 states and 512 transitions. [2024-11-13 21:47:53,472 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 512 transitions. [2024-11-13 21:47:53,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-13 21:47:53,474 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:53,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:53,599 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-13 21:47:53,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:53,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 406 states and 528 transitions. [2024-11-13 21:47:53,751 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 528 transitions. [2024-11-13 21:47:53,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 21:47:53,753 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:53,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:53,882 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-13 21:47:54,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:54,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 412 states and 535 transitions. [2024-11-13 21:47:54,014 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 535 transitions. [2024-11-13 21:47:54,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 21:47:54,017 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:54,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:54,155 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:47:55,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:55,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 450 states and 577 transitions. [2024-11-13 21:47:55,017 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 577 transitions. [2024-11-13 21:47:55,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 21:47:55,019 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:55,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:55,120 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 21:47:55,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:55,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 462 states and 589 transitions. [2024-11-13 21:47:55,515 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 589 transitions. [2024-11-13 21:47:55,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 21:47:55,517 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:55,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:55,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:55,717 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-13 21:47:55,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:55,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 475 states and 604 transitions. [2024-11-13 21:47:55,921 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 604 transitions. [2024-11-13 21:47:55,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-13 21:47:55,924 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:55,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:55,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:56,050 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-13 21:47:56,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:56,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 481 states and 612 transitions. [2024-11-13 21:47:56,241 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 612 transitions. [2024-11-13 21:47:56,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-13 21:47:56,243 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:56,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:56,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:56,553 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-13 21:47:57,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:57,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 510 states and 644 transitions. [2024-11-13 21:47:57,317 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 644 transitions. [2024-11-13 21:47:57,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-13 21:47:57,319 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:57,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:57,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:57,516 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-13 21:47:57,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:57,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 520 states and 654 transitions. [2024-11-13 21:47:57,872 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 654 transitions. [2024-11-13 21:47:57,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-13 21:47:57,875 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:57,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:57,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:57,975 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:47:58,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:58,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 544 states and 679 transitions. [2024-11-13 21:47:58,187 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 679 transitions. [2024-11-13 21:47:58,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-13 21:47:58,189 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:58,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:58,365 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:47:58,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:58,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 566 states and 706 transitions. [2024-11-13 21:47:58,944 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 706 transitions. [2024-11-13 21:47:58,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-13 21:47:58,948 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:58,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:59,056 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-13 21:47:59,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:59,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 567 states and 708 transitions. [2024-11-13 21:47:59,276 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 708 transitions. [2024-11-13 21:47:59,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 21:47:59,279 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:59,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:59,461 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 21:48:01,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:01,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 666 states and 816 transitions. [2024-11-13 21:48:01,055 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 816 transitions. [2024-11-13 21:48:01,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-13 21:48:01,058 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:01,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:01,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:01,322 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 78 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 21:48:02,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:02,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 703 states and 861 transitions. [2024-11-13 21:48:02,049 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 861 transitions. [2024-11-13 21:48:02,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-13 21:48:02,051 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:02,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:02,149 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-13 21:48:02,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:02,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 704 states and 868 transitions. [2024-11-13 21:48:02,210 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 868 transitions. [2024-11-13 21:48:02,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-13 21:48:02,213 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:02,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:02,378 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-13 21:48:02,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:02,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 705 states and 868 transitions. [2024-11-13 21:48:02,519 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 868 transitions. [2024-11-13 21:48:02,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-13 21:48:02,522 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:02,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:02,612 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-13 21:48:02,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:02,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 722 states and 887 transitions. [2024-11-13 21:48:02,954 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 887 transitions. [2024-11-13 21:48:02,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-13 21:48:02,956 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:02,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:03,049 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 21:48:03,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:03,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 730 states and 896 transitions. [2024-11-13 21:48:03,323 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 896 transitions. [2024-11-13 21:48:03,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-13 21:48:03,325 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:03,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:03,418 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 21:48:03,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:03,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 734 states and 900 transitions. [2024-11-13 21:48:03,600 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 900 transitions. [2024-11-13 21:48:03,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 21:48:03,604 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:03,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:03,774 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 21:48:04,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:04,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 748 states and 914 transitions. [2024-11-13 21:48:04,030 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 914 transitions. [2024-11-13 21:48:04,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-13 21:48:04,032 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:04,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:04,675 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-13 21:48:06,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:06,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 832 states and 1016 transitions. [2024-11-13 21:48:06,898 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1016 transitions. [2024-11-13 21:48:06,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-13 21:48:06,900 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:06,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:07,050 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 21:48:07,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:07,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 853 states and 1039 transitions. [2024-11-13 21:48:07,232 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1039 transitions. [2024-11-13 21:48:07,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-13 21:48:07,234 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:07,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 80 proven. 3 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-13 21:48:07,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:07,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 854 states and 1039 transitions. [2024-11-13 21:48:07,933 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1039 transitions. [2024-11-13 21:48:07,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-13 21:48:07,935 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:07,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:08,109 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 21:48:08,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:08,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 885 states and 1080 transitions. [2024-11-13 21:48:08,994 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1080 transitions. [2024-11-13 21:48:08,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-13 21:48:08,996 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:08,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:09,190 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 21:48:10,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:10,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 913 states and 1112 transitions. [2024-11-13 21:48:10,080 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1112 transitions. [2024-11-13 21:48:10,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-13 21:48:10,081 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:10,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:10,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:10,214 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-13 21:48:10,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:10,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 915 states and 1113 transitions. [2024-11-13 21:48:10,453 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1113 transitions. [2024-11-13 21:48:10,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-13 21:48:10,457 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:10,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:10,718 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-13 21:48:11,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:11,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 916 states and 1115 transitions. [2024-11-13 21:48:11,166 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1115 transitions. [2024-11-13 21:48:11,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-13 21:48:11,167 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:11,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:11,894 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-13 21:48:14,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:14,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1000 states and 1208 transitions. [2024-11-13 21:48:14,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1208 transitions. [2024-11-13 21:48:14,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-13 21:48:14,632 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:14,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:15,208 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 96 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 21:48:16,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:16,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1069 states and 1290 transitions. [2024-11-13 21:48:16,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1290 transitions. [2024-11-13 21:48:16,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-13 21:48:16,924 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:16,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:17,051 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 21:48:17,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:17,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1090 states and 1317 transitions. [2024-11-13 21:48:17,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1317 transitions. [2024-11-13 21:48:17,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-13 21:48:17,244 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:17,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:17,397 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-13 21:48:18,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:18,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1127 states and 1354 transitions. [2024-11-13 21:48:18,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1354 transitions. [2024-11-13 21:48:18,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-13 21:48:18,028 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:18,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:18,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:18,519 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 94 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:48:21,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:21,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1202 states and 1447 transitions. [2024-11-13 21:48:21,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1447 transitions. [2024-11-13 21:48:21,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-13 21:48:21,063 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:21,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:21,185 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 21:48:21,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:21,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1204 states and 1451 transitions. [2024-11-13 21:48:21,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1451 transitions. [2024-11-13 21:48:21,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-13 21:48:21,558 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:21,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:21,895 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 143 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:48:22,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:22,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1205 states and 1451 transitions. [2024-11-13 21:48:22,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1451 transitions. [2024-11-13 21:48:22,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-13 21:48:22,327 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:22,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:22,904 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 21:48:24,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:24,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1273 states and 1520 transitions. [2024-11-13 21:48:24,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1520 transitions. [2024-11-13 21:48:24,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-13 21:48:24,664 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:24,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:24,943 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 21:48:25,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:25,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1276 states and 1522 transitions. [2024-11-13 21:48:25,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1522 transitions. [2024-11-13 21:48:25,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-13 21:48:25,530 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:25,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:25,954 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-13 21:48:26,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:26,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1291 states and 1541 transitions. [2024-11-13 21:48:26,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1541 transitions. [2024-11-13 21:48:26,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-13 21:48:26,546 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:26,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:26,644 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-13 21:48:26,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:26,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1292 states and 1546 transitions. [2024-11-13 21:48:26,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1546 transitions. [2024-11-13 21:48:26,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-13 21:48:26,981 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:26,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:27,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:27,063 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-13 21:48:27,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:27,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1293 states and 1547 transitions. [2024-11-13 21:48:27,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1547 transitions. [2024-11-13 21:48:27,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-13 21:48:27,320 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:27,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:27,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:27,741 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 119 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-13 21:48:28,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:28,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1294 states and 1548 transitions. [2024-11-13 21:48:28,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1548 transitions. [2024-11-13 21:48:28,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-13 21:48:28,326 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:28,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:28,414 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-13 21:48:28,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:28,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1301 states and 1559 transitions. [2024-11-13 21:48:28,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 1559 transitions. [2024-11-13 21:48:28,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-13 21:48:28,907 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:28,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:29,182 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 168 proven. 9 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-13 21:48:29,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:30,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1312 states and 1571 transitions. [2024-11-13 21:48:30,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1571 transitions. [2024-11-13 21:48:30,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-13 21:48:30,002 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:30,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:30,163 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-13 21:48:30,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:30,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1313 states and 1572 transitions. [2024-11-13 21:48:30,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1572 transitions. [2024-11-13 21:48:30,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-13 21:48:30,633 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:30,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:30,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:30,801 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 21:48:32,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:32,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1358 states and 1631 transitions. [2024-11-13 21:48:32,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1631 transitions. [2024-11-13 21:48:32,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-13 21:48:32,564 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:32,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:32,730 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 21:48:33,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:33,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1366 states and 1638 transitions. [2024-11-13 21:48:33,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1638 transitions. [2024-11-13 21:48:33,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-13 21:48:33,195 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:33,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:33,503 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-13 21:48:34,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:34,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1381 states and 1658 transitions. [2024-11-13 21:48:34,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1658 transitions. [2024-11-13 21:48:34,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-13 21:48:34,864 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:34,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:34,935 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 21:48:37,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:37,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1417 states and 1707 transitions. [2024-11-13 21:48:37,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1707 transitions. [2024-11-13 21:48:37,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-13 21:48:37,255 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:37,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:37,358 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 21:48:37,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:37,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1728 states to 1435 states and 1728 transitions. [2024-11-13 21:48:37,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 1728 transitions. [2024-11-13 21:48:37,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 21:48:37,923 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:37,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:38,244 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 188 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-13 21:48:38,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:38,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1443 states and 1736 transitions. [2024-11-13 21:48:38,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 1736 transitions. [2024-11-13 21:48:38,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-13 21:48:38,763 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:38,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:39,503 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-13 21:48:43,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:43,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1483 states and 1788 transitions. [2024-11-13 21:48:43,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 1788 transitions. [2024-11-13 21:48:43,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-13 21:48:43,445 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:43,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:43,798 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-13 21:48:44,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:44,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1501 states and 1807 transitions. [2024-11-13 21:48:44,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 1807 transitions. [2024-11-13 21:48:44,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-13 21:48:44,457 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:44,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:44,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:44,729 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-13 21:48:45,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:45,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1519 states and 1828 transitions. [2024-11-13 21:48:45,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 1828 transitions. [2024-11-13 21:48:45,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-13 21:48:45,361 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:45,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:45,597 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-13 21:48:46,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:46,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1521 states and 1829 transitions. [2024-11-13 21:48:46,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1829 transitions. [2024-11-13 21:48:46,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-13 21:48:46,351 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:46,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:46,445 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-13 21:48:46,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:46,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1522 states and 1829 transitions. [2024-11-13 21:48:46,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 1829 transitions. [2024-11-13 21:48:46,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-13 21:48:46,514 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:46,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:47,284 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 143 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:48:50,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:50,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1973 states to 1639 states and 1973 transitions. [2024-11-13 21:48:50,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1639 states and 1973 transitions. [2024-11-13 21:48:50,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-13 21:48:50,700 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:50,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:51,110 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 143 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:48:51,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:51,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1654 states and 1987 transitions. [2024-11-13 21:48:51,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 1987 transitions. [2024-11-13 21:48:51,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-13 21:48:51,896 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:51,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:51,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:52,239 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-13 21:48:53,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:53,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2013 states to 1675 states and 2013 transitions. [2024-11-13 21:48:53,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 2013 transitions. [2024-11-13 21:48:53,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-13 21:48:53,645 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:53,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:53,796 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 21:48:55,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:55,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2036 states to 1694 states and 2036 transitions. [2024-11-13 21:48:55,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 2036 transitions. [2024-11-13 21:48:55,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-13 21:48:55,789 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:55,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:55,894 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 21:48:56,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:56,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 1710 states and 2055 transitions. [2024-11-13 21:48:56,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2055 transitions. [2024-11-13 21:48:56,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-13 21:48:56,768 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:56,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:57,337 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 149 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:49:02,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:02,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 1760 states and 2116 transitions. [2024-11-13 21:49:02,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2116 transitions. [2024-11-13 21:49:02,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-13 21:49:02,095 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:02,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:02,382 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 149 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:49:05,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:05,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2159 states to 1797 states and 2159 transitions. [2024-11-13 21:49:05,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2159 transitions. [2024-11-13 21:49:05,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-13 21:49:05,294 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:05,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:05,672 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 149 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:49:06,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:06,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2177 states to 1815 states and 2177 transitions. [2024-11-13 21:49:06,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2177 transitions. [2024-11-13 21:49:06,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-13 21:49:06,481 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:06,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:06,725 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 149 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:49:08,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:08,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2198 states to 1835 states and 2198 transitions. [2024-11-13 21:49:08,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2198 transitions. [2024-11-13 21:49:08,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-13 21:49:08,165 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:08,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:08,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:08,420 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 151 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:49:10,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:10,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 1879 states and 2257 transitions. [2024-11-13 21:49:10,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 2257 transitions. [2024-11-13 21:49:10,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-13 21:49:10,622 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:10,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:11,076 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 151 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:49:11,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:11,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 1887 states and 2264 transitions. [2024-11-13 21:49:11,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 2264 transitions. [2024-11-13 21:49:11,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-13 21:49:11,738 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:11,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:12,411 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-13 21:49:16,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:16,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2342 states to 1954 states and 2342 transitions. [2024-11-13 21:49:16,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2342 transitions. [2024-11-13 21:49:16,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-13 21:49:16,042 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:16,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:16,657 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 154 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:49:20,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:20,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2382 states to 1988 states and 2382 transitions. [2024-11-13 21:49:20,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1988 states and 2382 transitions. [2024-11-13 21:49:20,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-13 21:49:20,726 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:20,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:20,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:21,081 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 154 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:49:23,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:23,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2412 states to 2016 states and 2412 transitions. [2024-11-13 21:49:23,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2016 states and 2412 transitions. [2024-11-13 21:49:23,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-13 21:49:23,234 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:23,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:23,650 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 154 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:49:25,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:25,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2432 states to 2036 states and 2432 transitions. [2024-11-13 21:49:25,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2036 states and 2432 transitions. [2024-11-13 21:49:25,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-13 21:49:25,150 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:25,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:25,225 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-13 21:49:25,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:25,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2037 states and 2433 transitions. [2024-11-13 21:49:25,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 2433 transitions. [2024-11-13 21:49:25,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-13 21:49:25,711 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:25,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:25,899 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 178 proven. 67 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 21:49:27,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:27,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2485 states to 2085 states and 2485 transitions. [2024-11-13 21:49:27,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 2485 transitions. [2024-11-13 21:49:27,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-13 21:49:27,490 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:27,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:27,962 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 159 proven. 130 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 21:49:35,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:35,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2173 states and 2595 transitions. [2024-11-13 21:49:35,527 INFO L276 IsEmpty]: Start isEmpty. Operand 2173 states and 2595 transitions. [2024-11-13 21:49:35,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-13 21:49:35,529 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:35,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:35,803 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 159 proven. 130 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 21:49:38,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:38,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2616 states to 2189 states and 2616 transitions. [2024-11-13 21:49:38,602 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 2616 transitions. [2024-11-13 21:49:38,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-13 21:49:38,604 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:38,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:38,893 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 159 proven. 130 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 21:49:39,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:39,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2207 states and 2634 transitions. [2024-11-13 21:49:39,891 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 2634 transitions. [2024-11-13 21:49:39,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-13 21:49:39,892 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:39,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:40,136 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 159 proven. 130 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 21:49:41,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:41,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2227 states and 2655 transitions. [2024-11-13 21:49:41,899 INFO L276 IsEmpty]: Start isEmpty. Operand 2227 states and 2655 transitions. [2024-11-13 21:49:41,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-13 21:49:41,901 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:41,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:42,183 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 160 proven. 104 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-13 21:49:46,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:46,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2262 states and 2692 transitions. [2024-11-13 21:49:46,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 2692 transitions. [2024-11-13 21:49:46,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-13 21:49:46,863 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:46,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:46,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:47,141 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 160 proven. 104 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-13 21:49:49,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:49,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2759 states to 2327 states and 2759 transitions. [2024-11-13 21:49:49,963 INFO L276 IsEmpty]: Start isEmpty. Operand 2327 states and 2759 transitions. [2024-11-13 21:49:49,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-13 21:49:49,965 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:49,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:50,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:50,522 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 160 proven. 104 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-13 21:49:51,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:51,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2760 states to 2329 states and 2760 transitions. [2024-11-13 21:49:51,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 2760 transitions. [2024-11-13 21:49:51,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 21:49:51,420 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:51,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:51,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:51,669 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 164 proven. 101 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 21:49:55,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:55,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2836 states to 2399 states and 2836 transitions. [2024-11-13 21:49:55,069 INFO L276 IsEmpty]: Start isEmpty. Operand 2399 states and 2836 transitions. [2024-11-13 21:49:55,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 21:49:55,071 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:55,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:55,404 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 164 proven. 101 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 21:49:57,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:57,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2451 states and 2890 transitions. [2024-11-13 21:49:57,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2451 states and 2890 transitions. [2024-11-13 21:49:57,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 21:49:57,428 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:57,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:57,559 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-13 21:49:58,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:58,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2902 states to 2458 states and 2902 transitions. [2024-11-13 21:49:58,445 INFO L276 IsEmpty]: Start isEmpty. Operand 2458 states and 2902 transitions. [2024-11-13 21:49:58,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 21:49:58,448 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:58,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:58,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:58,616 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-13 21:49:59,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:59,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2905 states to 2462 states and 2905 transitions. [2024-11-13 21:49:59,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2462 states and 2905 transitions. [2024-11-13 21:49:59,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 21:49:59,212 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:59,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:59,452 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-13 21:49:59,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:59,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2908 states to 2466 states and 2908 transitions. [2024-11-13 21:49:59,879 INFO L276 IsEmpty]: Start isEmpty. Operand 2466 states and 2908 transitions. [2024-11-13 21:49:59,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-13 21:49:59,880 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:59,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:50:00,083 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 259 proven. 9 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-13 21:50:00,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:50:00,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2908 states to 2467 states and 2908 transitions. [2024-11-13 21:50:00,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 2908 transitions. [2024-11-13 21:50:00,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-13 21:50:00,796 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:50:00,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:50:00,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:50:00,929 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 132 proven. 166 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-13 21:50:02,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:50:02,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2996 states to 2550 states and 2996 transitions. [2024-11-13 21:50:02,234 INFO L276 IsEmpty]: Start isEmpty. Operand 2550 states and 2996 transitions. [2024-11-13 21:50:02,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-13 21:50:02,236 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:50:02,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:50:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:50:02,271 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 21:50:02,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:50:02,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:50:02,565 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 21:50:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:50:02,726 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 100 iterations. [2024-11-13 21:50:02,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 09:50:02 ImpRootNode [2024-11-13 21:50:02,870 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 21:50:02,870 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 21:50:02,871 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 21:50:02,871 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 21:50:02,871 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:47:43" (3/4) ... [2024-11-13 21:50:02,872 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 21:50:03,067 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adcebc4-a832-4e5b-9f64-663465580745/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 21:50:03,067 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 21:50:03,069 INFO L158 Benchmark]: Toolchain (without parser) took 141675.50ms. Allocated memory was 117.4MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 91.1MB in the beginning and 674.4MB in the end (delta: -583.4MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-13 21:50:03,069 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 117.4MB. Free memory is still 74.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:50:03,070 INFO L158 Benchmark]: CACSL2BoogieTranslator took 616.71ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 64.2MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 21:50:03,070 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.85ms. Allocated memory is still 117.4MB. Free memory was 64.2MB in the beginning and 58.8MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 21:50:03,070 INFO L158 Benchmark]: Boogie Preprocessor took 50.16ms. Allocated memory is still 117.4MB. Free memory was 58.8MB in the beginning and 54.8MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:50:03,071 INFO L158 Benchmark]: RCFGBuilder took 1851.36ms. Allocated memory is still 117.4MB. Free memory was 54.7MB in the beginning and 78.2MB in the end (delta: -23.5MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. [2024-11-13 21:50:03,072 INFO L158 Benchmark]: CodeCheck took 138871.81ms. Allocated memory was 117.4MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 78.2MB in the beginning and 699.6MB in the end (delta: -621.4MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-13 21:50:03,072 INFO L158 Benchmark]: Witness Printer took 196.70ms. Allocated memory is still 1.8GB. Free memory was 699.6MB in the beginning and 674.4MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 21:50:03,074 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: 138.7s, OverallIterations: 100, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 243506 SdHoareTripleChecker+Valid, 758.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 242721 mSDsluCounter, 37970 SdHoareTripleChecker+Invalid, 639.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33331 mSDsCounter, 62770 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 532706 IncrementalHoareTripleChecker+Invalid, 595476 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62770 mSolverCounterUnsat, 4639 mSDtfsCounter, 532706 mSolverCounterSat, 8.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 115668 GetRequests, 110579 SyntacticMatches, 4217 SemanticMatches, 872 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504293 ImplicationChecksByTransitivity, 94.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.7s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 22.0s InterpolantComputationTime, 17342 NumberOfCodeBlocks, 17342 NumberOfCodeBlocksAsserted, 100 NumberOfCheckSat, 17000 ConstructedInterpolants, 0 QuantifiedInterpolants, 101367 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 99 InterpolantComputations, 60 PerfectInterpolantSequences, 13362/16438 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: 408]: 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=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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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 TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L83] a7 = 1 [L84] a17 = 1 [L85] a21 = 0 [L86] a20 = 1 [L87] a8 = 13 [L88] a16 = 5 [L89] return 26; VAL [\result=26, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 TRUE ((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1))) [L159] a16 = 4 [L160] a17 = 0 [L161] return 25; VAL [\result=25, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND TRUE (((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1)) [L140] a8 = 15 [L141] a17 = 0 [L142] a21 = 1 [L143] a20 = 0 [L144] a16 = 4 [L145] return -1; VAL [\result=-1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, 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 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=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, 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] [L407] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, 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] [L408] reach_error() VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, 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] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 117.4MB. Free memory is still 74.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 616.71ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 64.2MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.85ms. Allocated memory is still 117.4MB. Free memory was 64.2MB in the beginning and 58.8MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.16ms. Allocated memory is still 117.4MB. Free memory was 58.8MB in the beginning and 54.8MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1851.36ms. Allocated memory is still 117.4MB. Free memory was 54.7MB in the beginning and 78.2MB in the end (delta: -23.5MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. * CodeCheck took 138871.81ms. Allocated memory was 117.4MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 78.2MB in the beginning and 699.6MB in the end (delta: -621.4MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 196.70ms. Allocated memory is still 1.8GB. Free memory was 699.6MB in the beginning and 674.4MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-13 21:50:03,113 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adcebc4-a832-4e5b-9f64-663465580745/bin/ukojak-verify-EEHR8qb7sm/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