./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label21.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d9d50f5-d05c-4181-a5f8-1e7bb95d5b46/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d9d50f5-d05c-4181-a5f8-1e7bb95d5b46/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_1d9d50f5-d05c-4181-a5f8-1e7bb95d5b46/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d9d50f5-d05c-4181-a5f8-1e7bb95d5b46/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label21.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d9d50f5-d05c-4181-a5f8-1e7bb95d5b46/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_1d9d50f5-d05c-4181-a5f8-1e7bb95d5b46/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 7fc08bc6eca06c500d742b65350dc2aa3c19e672662fd614514fbc6bd34af0fd --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 21:40:56,715 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 21:40:56,775 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d9d50f5-d05c-4181-a5f8-1e7bb95d5b46/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 21:40:56,780 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 21:40:56,781 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 21:40:56,802 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 21:40:56,803 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 21:40:56,804 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 21:40:56,808 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 21:40:56,808 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 21:40:56,809 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 21:40:56,809 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 21:40:56,809 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 21:40:56,809 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 21:40:56,809 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 21:40:56,809 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 21:40:56,809 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 21:40:56,809 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 21:40:56,809 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 21:40:56,809 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 21:40:56,810 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 21:40:56,810 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 21:40:56,810 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 21:40:56,810 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 21:40:56,810 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 21:40:56,810 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 21:40:56,810 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 21:40:56,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:40:56,810 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 21:40:56,811 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 21:40:56,811 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 21:40:56,811 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 21:40:56,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 21:40:56,811 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_1d9d50f5-d05c-4181-a5f8-1e7bb95d5b46/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 -> 7fc08bc6eca06c500d742b65350dc2aa3c19e672662fd614514fbc6bd34af0fd [2024-11-13 21:40:57,137 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 21:40:57,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 21:40:57,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 21:40:57,150 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 21:40:57,151 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 21:40:57,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d9d50f5-d05c-4181-a5f8-1e7bb95d5b46/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/eca-rers2012/Problem01_label21.c Unable to find full path for "g++" [2024-11-13 21:40:59,062 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 21:40:59,464 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 21:40:59,469 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d9d50f5-d05c-4181-a5f8-1e7bb95d5b46/sv-benchmarks/c/eca-rers2012/Problem01_label21.c [2024-11-13 21:40:59,492 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d9d50f5-d05c-4181-a5f8-1e7bb95d5b46/bin/ukojak-verify-EEHR8qb7sm/data/28f73e428/c5ca0e37427e4d7fb1a541b3ea4f4bb1/FLAG5e21d82c9 [2024-11-13 21:40:59,639 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d9d50f5-d05c-4181-a5f8-1e7bb95d5b46/bin/ukojak-verify-EEHR8qb7sm/data/28f73e428/c5ca0e37427e4d7fb1a541b3ea4f4bb1 [2024-11-13 21:40:59,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 21:40:59,643 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 21:40:59,647 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 21:40:59,647 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 21:40:59,656 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 21:40:59,657 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:40:59" (1/1) ... [2024-11-13 21:40:59,658 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dd5774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:40:59, skipping insertion in model container [2024-11-13 21:40:59,658 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:40:59" (1/1) ... [2024-11-13 21:40:59,714 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 21:41:00,055 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_1d9d50f5-d05c-4181-a5f8-1e7bb95d5b46/sv-benchmarks/c/eca-rers2012/Problem01_label21.c[15876,15889] [2024-11-13 21:41:00,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:41:00,134 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 21:41:00,242 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_1d9d50f5-d05c-4181-a5f8-1e7bb95d5b46/sv-benchmarks/c/eca-rers2012/Problem01_label21.c[15876,15889] [2024-11-13 21:41:00,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:41:00,289 INFO L204 MainTranslator]: Completed translation [2024-11-13 21:41:00,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:41:00 WrapperNode [2024-11-13 21:41:00,290 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 21:41:00,291 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 21:41:00,291 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 21:41:00,292 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 21:41:00,299 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:41:00" (1/1) ... [2024-11-13 21:41:00,327 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:41:00" (1/1) ... [2024-11-13 21:41:00,384 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-13 21:41:00,384 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 21:41:00,385 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 21:41:00,385 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 21:41:00,385 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 21:41:00,393 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:41:00" (1/1) ... [2024-11-13 21:41:00,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:41:00" (1/1) ... [2024-11-13 21:41:00,397 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:41:00" (1/1) ... [2024-11-13 21:41:00,398 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:41:00" (1/1) ... [2024-11-13 21:41:00,417 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:41:00" (1/1) ... [2024-11-13 21:41:00,425 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:41:00" (1/1) ... [2024-11-13 21:41:00,428 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:41:00" (1/1) ... [2024-11-13 21:41:00,431 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:41:00" (1/1) ... [2024-11-13 21:41:00,440 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 21:41:00,445 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 21:41:00,445 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 21:41:00,445 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 21:41:00,446 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:41:00" (1/1) ... [2024-11-13 21:41:00,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:41:00,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d9d50f5-d05c-4181-a5f8-1e7bb95d5b46/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 21:41:00,489 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d9d50f5-d05c-4181-a5f8-1e7bb95d5b46/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:41:00,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d9d50f5-d05c-4181-a5f8-1e7bb95d5b46/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:41:00,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 21:41:00,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 21:41:00,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 21:41:00,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 21:41:00,611 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 21:41:00,614 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 21:41:02,216 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-13 21:41:02,217 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 21:41:02,564 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 21:41:02,566 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 21:41:02,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:41:02 BoogieIcfgContainer [2024-11-13 21:41:02,567 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 21:41:02,568 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 21:41:02,568 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 21:41:02,580 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 21:41:02,580 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:41:02" (1/1) ... [2024-11-13 21:41:02,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 21:41:02,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:02,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-13 21:41:02,660 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-13 21:41:02,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 21:41:02,664 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:02,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:02,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:03,260 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:41:03,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:04,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 145 states and 231 transitions. [2024-11-13 21:41:04,003 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 231 transitions. [2024-11-13 21:41:04,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 21:41:04,007 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:04,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:04,337 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:41:05,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:05,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 215 states and 304 transitions. [2024-11-13 21:41:05,227 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 304 transitions. [2024-11-13 21:41:05,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-13 21:41:05,229 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:05,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:05,397 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:41:05,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:05,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 216 states and 305 transitions. [2024-11-13 21:41:05,570 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 305 transitions. [2024-11-13 21:41:05,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-13 21:41:05,576 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:05,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:05,749 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:41:05,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:05,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 231 states and 323 transitions. [2024-11-13 21:41:05,971 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 323 transitions. [2024-11-13 21:41:05,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-13 21:41:05,974 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:05,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:06,254 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:41:06,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:06,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 235 states and 330 transitions. [2024-11-13 21:41:06,539 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 330 transitions. [2024-11-13 21:41:06,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-13 21:41:06,544 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:06,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:06,707 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:41:06,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:06,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 240 states and 335 transitions. [2024-11-13 21:41:06,788 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 335 transitions. [2024-11-13 21:41:06,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 21:41:06,790 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:06,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:06,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:06,971 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:41:07,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:07,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 256 states and 356 transitions. [2024-11-13 21:41:07,396 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 356 transitions. [2024-11-13 21:41:07,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-13 21:41:07,397 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:07,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:07,525 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:41:08,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:08,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 282 states and 386 transitions. [2024-11-13 21:41:08,081 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 386 transitions. [2024-11-13 21:41:08,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 21:41:08,083 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:08,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:08,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:08,350 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 21:41:08,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:08,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 293 states and 401 transitions. [2024-11-13 21:41:08,826 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 401 transitions. [2024-11-13 21:41:08,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 21:41:08,827 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:08,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:08,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:08,951 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:41:09,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:09,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 314 states and 426 transitions. [2024-11-13 21:41:09,566 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 426 transitions. [2024-11-13 21:41:09,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 21:41:09,572 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:09,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:09,933 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 21:41:10,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:10,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 317 states and 430 transitions. [2024-11-13 21:41:10,196 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 430 transitions. [2024-11-13 21:41:10,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 21:41:10,197 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:10,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:10,388 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 21:41:10,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:10,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 328 states and 442 transitions. [2024-11-13 21:41:10,701 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 442 transitions. [2024-11-13 21:41:10,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 21:41:10,703 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:10,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:10,882 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 32 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 21:41:10,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:10,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 330 states and 444 transitions. [2024-11-13 21:41:10,934 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 444 transitions. [2024-11-13 21:41:10,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 21:41:10,957 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:10,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:11,043 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:41:11,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:11,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 333 states and 449 transitions. [2024-11-13 21:41:11,228 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 449 transitions. [2024-11-13 21:41:11,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-13 21:41:11,230 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:11,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:11,478 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 21:41:12,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:12,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 348 states and 467 transitions. [2024-11-13 21:41:12,095 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 467 transitions. [2024-11-13 21:41:12,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 21:41:12,096 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:12,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:12,228 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-13 21:41:12,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:12,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 357 states and 479 transitions. [2024-11-13 21:41:12,682 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 479 transitions. [2024-11-13 21:41:12,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 21:41:12,683 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:12,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:12,853 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 21:41:13,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:13,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 361 states and 487 transitions. [2024-11-13 21:41:13,282 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 487 transitions. [2024-11-13 21:41:13,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-13 21:41:13,284 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:13,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:13,359 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:41:13,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:13,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 375 states and 501 transitions. [2024-11-13 21:41:13,512 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 501 transitions. [2024-11-13 21:41:13,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 21:41:13,514 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:13,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:13,640 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 21:41:13,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:13,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 384 states and 511 transitions. [2024-11-13 21:41:13,877 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 511 transitions. [2024-11-13 21:41:13,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 21:41:13,879 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:13,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:13,972 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:41:14,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:14,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 408 states and 536 transitions. [2024-11-13 21:41:14,198 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 536 transitions. [2024-11-13 21:41:14,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 21:41:14,201 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:14,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:14,403 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:41:14,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:14,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 441 states and 571 transitions. [2024-11-13 21:41:14,894 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 571 transitions. [2024-11-13 21:41:14,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 21:41:14,896 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:14,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:15,061 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 21:41:15,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:15,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 463 states and 595 transitions. [2024-11-13 21:41:15,632 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 595 transitions. [2024-11-13 21:41:15,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-13 21:41:15,634 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:15,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:15,765 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 67 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:41:16,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:16,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 479 states and 620 transitions. [2024-11-13 21:41:16,264 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 620 transitions. [2024-11-13 21:41:16,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-13 21:41:16,265 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:16,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:16,361 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:41:16,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:16,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 508 states and 651 transitions. [2024-11-13 21:41:16,645 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 651 transitions. [2024-11-13 21:41:16,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-13 21:41:16,647 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:16,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:16,779 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:41:17,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:17,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 552 states and 696 transitions. [2024-11-13 21:41:17,418 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 696 transitions. [2024-11-13 21:41:17,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 21:41:17,420 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:17,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:17,522 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-13 21:41:18,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:18,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 585 states and 734 transitions. [2024-11-13 21:41:18,685 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 734 transitions. [2024-11-13 21:41:18,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 21:41:18,687 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:18,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:18,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:18,906 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 21:41:19,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:19,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 593 states and 744 transitions. [2024-11-13 21:41:19,276 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 744 transitions. [2024-11-13 21:41:19,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-13 21:41:19,278 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:19,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:19,455 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-13 21:41:19,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:19,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 598 states and 749 transitions. [2024-11-13 21:41:19,627 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 749 transitions. [2024-11-13 21:41:19,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-13 21:41:19,634 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:19,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:19,713 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-13 21:41:20,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:20,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 601 states and 753 transitions. [2024-11-13 21:41:20,154 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 753 transitions. [2024-11-13 21:41:20,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-13 21:41:20,157 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:20,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:20,353 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:41:21,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:21,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 629 states and 784 transitions. [2024-11-13 21:41:21,125 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 784 transitions. [2024-11-13 21:41:21,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-13 21:41:21,127 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:21,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:21,248 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:41:21,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:21,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 630 states and 784 transitions. [2024-11-13 21:41:21,301 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 784 transitions. [2024-11-13 21:41:21,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 21:41:21,303 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:21,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:21,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:21,802 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:41:23,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:23,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 702 states and 873 transitions. [2024-11-13 21:41:23,658 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 873 transitions. [2024-11-13 21:41:23,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-13 21:41:23,660 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:23,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:23,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:23,924 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-13 21:41:25,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:25,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 739 states and 915 transitions. [2024-11-13 21:41:25,331 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 915 transitions. [2024-11-13 21:41:25,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-13 21:41:25,332 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:25,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:25,469 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-13 21:41:26,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:26,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 758 states and 936 transitions. [2024-11-13 21:41:26,261 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 936 transitions. [2024-11-13 21:41:26,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-13 21:41:26,263 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:26,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:26,398 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:41:26,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:26,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 759 states and 936 transitions. [2024-11-13 21:41:26,439 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 936 transitions. [2024-11-13 21:41:26,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-13 21:41:26,441 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:26,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:26,651 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:41:27,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:27,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 803 states and 981 transitions. [2024-11-13 21:41:27,318 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 981 transitions. [2024-11-13 21:41:27,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-13 21:41:27,320 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:27,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:27,673 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 101 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 21:41:28,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:28,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 806 states and 985 transitions. [2024-11-13 21:41:28,000 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 985 transitions. [2024-11-13 21:41:28,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 21:41:28,001 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:28,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:28,192 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 21:41:28,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:28,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 807 states and 987 transitions. [2024-11-13 21:41:28,514 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 987 transitions. [2024-11-13 21:41:28,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 21:41:28,515 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:28,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:28,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:28,805 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 99 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-13 21:41:28,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:28,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 809 states and 989 transitions. [2024-11-13 21:41:28,999 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 989 transitions. [2024-11-13 21:41:28,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 21:41:28,999 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:29,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:29,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:29,292 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 70 proven. 3 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-13 21:41:29,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:29,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 812 states and 992 transitions. [2024-11-13 21:41:29,585 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 992 transitions. [2024-11-13 21:41:29,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-13 21:41:29,586 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:29,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:29,858 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 90 proven. 3 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-13 21:41:30,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:30,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 815 states and 996 transitions. [2024-11-13 21:41:30,202 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 996 transitions. [2024-11-13 21:41:30,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-13 21:41:30,204 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:30,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:30,910 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:41:32,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:32,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 896 states and 1097 transitions. [2024-11-13 21:41:32,892 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1097 transitions. [2024-11-13 21:41:32,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-13 21:41:32,893 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:32,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:33,198 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:41:33,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:33,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 899 states and 1100 transitions. [2024-11-13 21:41:33,531 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1100 transitions. [2024-11-13 21:41:33,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-13 21:41:33,533 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:33,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:33,684 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 21:41:34,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:34,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 926 states and 1133 transitions. [2024-11-13 21:41:34,180 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1133 transitions. [2024-11-13 21:41:34,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-13 21:41:34,180 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:34,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:34,296 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 21:41:34,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:34,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 927 states and 1133 transitions. [2024-11-13 21:41:34,597 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1133 transitions. [2024-11-13 21:41:34,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-13 21:41:34,598 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:34,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:35,106 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:41:36,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:36,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1011 states and 1229 transitions. [2024-11-13 21:41:36,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1229 transitions. [2024-11-13 21:41:36,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-13 21:41:36,985 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:36,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:37,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:37,341 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 21:41:38,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:38,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1082 states and 1300 transitions. [2024-11-13 21:41:38,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1300 transitions. [2024-11-13 21:41:38,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-13 21:41:38,875 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:38,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:38,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:39,013 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 127 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-13 21:41:39,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:39,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 1083 states and 1301 transitions. [2024-11-13 21:41:39,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1301 transitions. [2024-11-13 21:41:39,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-13 21:41:39,280 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:39,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:39,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:39,381 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-13 21:41:39,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:39,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1084 states and 1302 transitions. [2024-11-13 21:41:39,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1302 transitions. [2024-11-13 21:41:39,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-13 21:41:39,664 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:39,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:39,836 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-13 21:41:40,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:40,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1106 states and 1324 transitions. [2024-11-13 21:41:40,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1324 transitions. [2024-11-13 21:41:40,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-13 21:41:40,078 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:40,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:40,476 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:41:41,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:41,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1118 states and 1338 transitions. [2024-11-13 21:41:41,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1338 transitions. [2024-11-13 21:41:41,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-13 21:41:41,272 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:41,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:41,408 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 21:41:42,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:42,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1139 states and 1366 transitions. [2024-11-13 21:41:42,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1366 transitions. [2024-11-13 21:41:42,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 21:41:42,283 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:42,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:42,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:42,560 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:41:43,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:43,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1172 states and 1402 transitions. [2024-11-13 21:41:43,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1402 transitions. [2024-11-13 21:41:43,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-13 21:41:43,784 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:43,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:43,859 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 21:41:44,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:44,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1188 states and 1420 transitions. [2024-11-13 21:41:44,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1420 transitions. [2024-11-13 21:41:44,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-13 21:41:44,503 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:44,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:44,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:44,659 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:41:45,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:45,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1195 states and 1428 transitions. [2024-11-13 21:41:45,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1428 transitions. [2024-11-13 21:41:45,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-13 21:41:45,194 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:45,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:45,298 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-13 21:41:45,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:45,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1220 states and 1453 transitions. [2024-11-13 21:41:45,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1453 transitions. [2024-11-13 21:41:45,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 21:41:45,767 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:45,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:46,281 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:41:50,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:50,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1298 states and 1553 transitions. [2024-11-13 21:41:50,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1553 transitions. [2024-11-13 21:41:50,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 21:41:50,292 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:50,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:50,527 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:41:50,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:50,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1300 states and 1554 transitions. [2024-11-13 21:41:50,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1554 transitions. [2024-11-13 21:41:50,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 21:41:50,887 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:50,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:50,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:51,154 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:41:51,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:51,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1314 states and 1568 transitions. [2024-11-13 21:41:51,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1568 transitions. [2024-11-13 21:41:51,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 21:41:51,699 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:51,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:51,983 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:41:52,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:52,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1320 states and 1574 transitions. [2024-11-13 21:41:52,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1574 transitions. [2024-11-13 21:41:52,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-13 21:41:52,432 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:52,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:52,770 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 146 proven. 49 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 21:41:55,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:55,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1350 states and 1611 transitions. [2024-11-13 21:41:55,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1611 transitions. [2024-11-13 21:41:55,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-13 21:41:55,376 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:55,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:55,661 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 146 proven. 49 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 21:41:56,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:56,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1359 states and 1620 transitions. [2024-11-13 21:41:56,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 1620 transitions. [2024-11-13 21:41:56,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 21:41:56,334 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:56,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:56,599 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 127 proven. 44 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 21:41:57,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:41:57,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1368 states and 1630 transitions. [2024-11-13 21:41:57,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 1630 transitions. [2024-11-13 21:41:57,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 21:41:57,109 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:41:57,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:41:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:41:57,445 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:42:00,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:00,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1442 states and 1718 transitions. [2024-11-13 21:42:00,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1442 states and 1718 transitions. [2024-11-13 21:42:00,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 21:42:00,751 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:00,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:01,011 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:42:01,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:01,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1445 states and 1721 transitions. [2024-11-13 21:42:01,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1721 transitions. [2024-11-13 21:42:01,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-13 21:42:01,554 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:01,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:02,345 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:42:05,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:05,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1489 states and 1777 transitions. [2024-11-13 21:42:05,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 1777 transitions. [2024-11-13 21:42:05,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-13 21:42:05,232 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:05,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:05,497 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 21:42:06,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:06,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1496 states and 1785 transitions. [2024-11-13 21:42:06,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 1785 transitions. [2024-11-13 21:42:06,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 21:42:06,437 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:06,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:06,759 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 134 proven. 51 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 21:42:06,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:06,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1503 states and 1792 transitions. [2024-11-13 21:42:06,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1792 transitions. [2024-11-13 21:42:06,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 21:42:06,943 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:06,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:07,379 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 21:42:10,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:10,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1542 states and 1839 transitions. [2024-11-13 21:42:10,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 1839 transitions. [2024-11-13 21:42:10,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 21:42:10,299 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:10,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:10,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:10,755 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 21:42:11,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:11,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1553 states and 1848 transitions. [2024-11-13 21:42:11,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 1848 transitions. [2024-11-13 21:42:11,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-13 21:42:11,619 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:11,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:11,879 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 176 proven. 65 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-13 21:42:14,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:14,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1883 states to 1576 states and 1883 transitions. [2024-11-13 21:42:14,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1883 transitions. [2024-11-13 21:42:14,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-13 21:42:14,747 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:14,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:14,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:15,051 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 176 proven. 65 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-13 21:42:16,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:16,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1598 states and 1910 transitions. [2024-11-13 21:42:16,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 1910 transitions. [2024-11-13 21:42:16,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-13 21:42:16,629 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:16,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:16,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:17,009 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 176 proven. 65 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-13 21:42:17,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:17,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1600 states and 1911 transitions. [2024-11-13 21:42:17,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 1911 transitions. [2024-11-13 21:42:17,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-13 21:42:17,626 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:17,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:17,871 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 176 proven. 65 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-13 21:42:18,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:18,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1602 states and 1913 transitions. [2024-11-13 21:42:18,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 1913 transitions. [2024-11-13 21:42:18,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 21:42:18,368 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:18,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:18,657 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 137 proven. 54 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 21:42:18,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:18,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1917 states to 1605 states and 1917 transitions. [2024-11-13 21:42:18,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 1917 transitions. [2024-11-13 21:42:18,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 21:42:18,799 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:18,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:19,205 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 21:42:22,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:22,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1656 states and 1978 transitions. [2024-11-13 21:42:22,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 1978 transitions. [2024-11-13 21:42:22,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 21:42:22,388 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:22,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:22,678 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 21:42:23,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:23,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1981 states to 1659 states and 1981 transitions. [2024-11-13 21:42:23,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 1981 transitions. [2024-11-13 21:42:23,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-13 21:42:23,327 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:23,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:23,446 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 171 proven. 76 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-13 21:42:23,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:23,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 1674 states and 2001 transitions. [2024-11-13 21:42:23,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2001 transitions. [2024-11-13 21:42:23,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 21:42:23,730 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:23,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:24,350 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 21:42:26,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:26,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 1709 states and 2044 transitions. [2024-11-13 21:42:26,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 2044 transitions. [2024-11-13 21:42:26,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 21:42:26,904 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:26,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:27,162 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 21:42:27,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:27,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 1718 states and 2053 transitions. [2024-11-13 21:42:27,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2053 transitions. [2024-11-13 21:42:27,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 21:42:27,921 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:27,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:28,433 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 21:42:29,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:29,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2060 states to 1726 states and 2060 transitions. [2024-11-13 21:42:29,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2060 transitions. [2024-11-13 21:42:29,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 21:42:29,720 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:29,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:29,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:29,992 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 140 proven. 71 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-13 21:42:30,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:30,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 1729 states and 2063 transitions. [2024-11-13 21:42:30,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 2063 transitions. [2024-11-13 21:42:30,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 21:42:30,570 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:30,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:31,067 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 190 proven. 58 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-13 21:42:32,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:32,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 1735 states and 2074 transitions. [2024-11-13 21:42:32,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2074 transitions. [2024-11-13 21:42:32,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-13 21:42:32,480 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:32,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:32,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:32,592 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-13 21:42:33,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:33,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2087 states to 1748 states and 2087 transitions. [2024-11-13 21:42:33,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2087 transitions. [2024-11-13 21:42:33,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-13 21:42:33,824 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:33,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:33,936 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-13 21:42:34,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:34,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 1762 states and 2101 transitions. [2024-11-13 21:42:34,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 2101 transitions. [2024-11-13 21:42:34,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-13 21:42:34,516 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:34,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:35,599 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 119 proven. 137 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 21:42:41,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:41,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 1896 states and 2256 transitions. [2024-11-13 21:42:41,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2256 transitions. [2024-11-13 21:42:41,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-13 21:42:41,129 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:41,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:41,449 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 58 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 21:42:41,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:41,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 1902 states and 2262 transitions. [2024-11-13 21:42:41,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 2262 transitions. [2024-11-13 21:42:41,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-13 21:42:41,898 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:41,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:42,041 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 181 proven. 81 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-13 21:42:43,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:43,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2285 states to 1922 states and 2285 transitions. [2024-11-13 21:42:43,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 2285 transitions. [2024-11-13 21:42:43,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-13 21:42:43,259 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:43,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:43,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:43,724 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:42:44,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:44,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2298 states to 1935 states and 2298 transitions. [2024-11-13 21:42:44,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2298 transitions. [2024-11-13 21:42:44,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-13 21:42:44,567 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:44,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:45,263 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 129 proven. 142 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 21:42:46,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:46,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2376 states to 2009 states and 2376 transitions. [2024-11-13 21:42:46,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 2376 transitions. [2024-11-13 21:42:46,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-13 21:42:46,843 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:46,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:46,917 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-13 21:42:47,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:47,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2378 states to 2010 states and 2378 transitions. [2024-11-13 21:42:47,376 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 2378 transitions. [2024-11-13 21:42:47,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-13 21:42:47,378 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:47,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:47,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:47,451 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-13 21:42:47,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:47,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 2025 states and 2393 transitions. [2024-11-13 21:42:47,971 INFO L276 IsEmpty]: Start isEmpty. Operand 2025 states and 2393 transitions. [2024-11-13 21:42:47,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-13 21:42:47,972 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:47,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:47,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:48,315 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 152 proven. 83 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-13 21:42:49,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:49,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2037 states and 2405 transitions. [2024-11-13 21:42:49,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 2405 transitions. [2024-11-13 21:42:49,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-13 21:42:49,277 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:49,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:49,892 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:42:51,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:51,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2424 states to 2048 states and 2424 transitions. [2024-11-13 21:42:51,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 2424 transitions. [2024-11-13 21:42:51,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-13 21:42:51,250 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:51,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:51,801 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:42:52,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:52,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2429 states to 2053 states and 2429 transitions. [2024-11-13 21:42:52,554 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 2429 transitions. [2024-11-13 21:42:52,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-13 21:42:52,555 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:52,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:52,673 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-13 21:42:53,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:53,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2064 states and 2447 transitions. [2024-11-13 21:42:53,714 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 2447 transitions. [2024-11-13 21:42:53,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-13 21:42:53,717 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:53,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:54,069 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:42:54,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:54,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2453 states to 2069 states and 2453 transitions. [2024-11-13 21:42:54,734 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states and 2453 transitions. [2024-11-13 21:42:54,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-13 21:42:54,735 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:54,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:54,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:54,910 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-13 21:42:55,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:55,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2455 states to 2070 states and 2455 transitions. [2024-11-13 21:42:55,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 2455 transitions. [2024-11-13 21:42:55,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-13 21:42:55,414 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:55,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:55,497 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-13 21:42:56,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:56,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2471 states to 2085 states and 2471 transitions. [2024-11-13 21:42:56,073 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 2471 transitions. [2024-11-13 21:42:56,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-13 21:42:56,074 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:56,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:56,348 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 155 proven. 86 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-13 21:42:58,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:58,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2122 states and 2518 transitions. [2024-11-13 21:42:58,721 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 2518 transitions. [2024-11-13 21:42:58,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-13 21:42:58,723 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:58,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:58,849 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-13 21:42:59,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:59,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2522 states to 2125 states and 2522 transitions. [2024-11-13 21:42:59,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 2522 transitions. [2024-11-13 21:42:59,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-13 21:42:59,556 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:59,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:59,764 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-13 21:42:59,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:59,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2524 states to 2127 states and 2524 transitions. [2024-11-13 21:42:59,965 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 2524 transitions. [2024-11-13 21:42:59,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-13 21:42:59,966 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:59,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:59,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:00,046 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-13 21:43:00,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:00,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2540 states to 2143 states and 2540 transitions. [2024-11-13 21:43:00,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2143 states and 2540 transitions. [2024-11-13 21:43:00,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-13 21:43:00,680 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:00,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:00,764 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-13 21:43:01,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:01,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2540 states to 2144 states and 2540 transitions. [2024-11-13 21:43:01,271 INFO L276 IsEmpty]: Start isEmpty. Operand 2144 states and 2540 transitions. [2024-11-13 21:43:01,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-13 21:43:01,273 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:01,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:01,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:01,712 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 174 proven. 28 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 21:43:02,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:02,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2155 states and 2552 transitions. [2024-11-13 21:43:02,638 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 2552 transitions. [2024-11-13 21:43:02,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-13 21:43:02,639 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:02,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:03,079 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 21:43:03,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:03,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2556 states to 2158 states and 2556 transitions. [2024-11-13 21:43:03,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2158 states and 2556 transitions. [2024-11-13 21:43:03,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-13 21:43:03,503 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:03,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:03,762 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 186 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 21:43:04,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:04,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2559 states to 2161 states and 2559 transitions. [2024-11-13 21:43:04,480 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 2559 transitions. [2024-11-13 21:43:04,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-13 21:43:04,481 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:04,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:04,854 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 192 proven. 59 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-13 21:43:05,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:05,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2162 states and 2560 transitions. [2024-11-13 21:43:05,618 INFO L276 IsEmpty]: Start isEmpty. Operand 2162 states and 2560 transitions. [2024-11-13 21:43:05,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 21:43:05,619 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:05,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:05,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:06,012 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 166 proven. 97 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-13 21:43:07,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:07,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2576 states to 2176 states and 2576 transitions. [2024-11-13 21:43:07,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 2576 transitions. [2024-11-13 21:43:07,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 21:43:07,235 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:07,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:07,436 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:43:08,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:08,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2591 states to 2190 states and 2591 transitions. [2024-11-13 21:43:08,256 INFO L276 IsEmpty]: Start isEmpty. Operand 2190 states and 2591 transitions. [2024-11-13 21:43:08,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-13 21:43:08,257 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:08,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:08,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:08,382 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 229 proven. 105 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-13 21:43:09,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:09,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2631 states to 2219 states and 2631 transitions. [2024-11-13 21:43:09,330 INFO L276 IsEmpty]: Start isEmpty. Operand 2219 states and 2631 transitions. [2024-11-13 21:43:09,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 21:43:09,331 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:09,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:09,638 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 169 proven. 100 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-13 21:43:10,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:10,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2233 states and 2645 transitions. [2024-11-13 21:43:10,346 INFO L276 IsEmpty]: Start isEmpty. Operand 2233 states and 2645 transitions. [2024-11-13 21:43:10,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 21:43:10,347 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:10,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:10,790 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 169 proven. 100 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-13 21:43:11,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:11,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2649 states to 2236 states and 2649 transitions. [2024-11-13 21:43:11,015 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 2649 transitions. [2024-11-13 21:43:11,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 21:43:11,017 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:11,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:11,278 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 200 proven. 63 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-13 21:43:11,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:11,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2653 states to 2239 states and 2653 transitions. [2024-11-13 21:43:11,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2239 states and 2653 transitions. [2024-11-13 21:43:11,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-13 21:43:11,904 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:11,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:12,027 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-13 21:43:12,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:12,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2681 states to 2268 states and 2681 transitions. [2024-11-13 21:43:12,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2268 states and 2681 transitions. [2024-11-13 21:43:12,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-13 21:43:12,750 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:12,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:13,291 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 65 proven. 278 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 21:43:15,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:15,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2753 states to 2338 states and 2753 transitions. [2024-11-13 21:43:15,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2338 states and 2753 transitions. [2024-11-13 21:43:15,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 21:43:15,082 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:15,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:15,375 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-13 21:43:15,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:15,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2757 states to 2341 states and 2757 transitions. [2024-11-13 21:43:15,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2341 states and 2757 transitions. [2024-11-13 21:43:15,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 21:43:15,673 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:15,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:16,124 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 21:43:22,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:22,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2838 states to 2408 states and 2838 transitions. [2024-11-13 21:43:22,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2408 states and 2838 transitions. [2024-11-13 21:43:22,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 21:43:22,809 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:22,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:23,008 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 21:43:23,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:23,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2847 states to 2417 states and 2847 transitions. [2024-11-13 21:43:23,871 INFO L276 IsEmpty]: Start isEmpty. Operand 2417 states and 2847 transitions. [2024-11-13 21:43:23,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 21:43:23,872 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:23,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:24,275 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 21:43:30,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:30,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2907 states to 2469 states and 2907 transitions. [2024-11-13 21:43:30,002 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 2907 transitions. [2024-11-13 21:43:30,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 21:43:30,004 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:30,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:30,241 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 21:43:31,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:31,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2477 states and 2916 transitions. [2024-11-13 21:43:31,580 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 2916 transitions. [2024-11-13 21:43:31,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 21:43:31,581 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:31,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:31,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:31,978 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-13 21:43:33,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:33,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2480 states and 2919 transitions. [2024-11-13 21:43:33,160 INFO L276 IsEmpty]: Start isEmpty. Operand 2480 states and 2919 transitions. [2024-11-13 21:43:33,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-13 21:43:33,162 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:33,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:33,461 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 179 proven. 104 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 21:43:34,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:34,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2489 states and 2928 transitions. [2024-11-13 21:43:34,335 INFO L276 IsEmpty]: Start isEmpty. Operand 2489 states and 2928 transitions. [2024-11-13 21:43:34,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-13 21:43:34,337 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:34,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:34,638 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 173 proven. 104 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-11-13 21:43:36,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:36,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2955 states to 2513 states and 2955 transitions. [2024-11-13 21:43:36,836 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 2955 transitions. [2024-11-13 21:43:36,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-13 21:43:36,838 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:36,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:37,322 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 21:43:42,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:42,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3021 states to 2568 states and 3021 transitions. [2024-11-13 21:43:42,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3021 transitions. [2024-11-13 21:43:42,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-13 21:43:42,776 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:42,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:43,044 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 21:43:45,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:45,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3044 states to 2591 states and 3044 transitions. [2024-11-13 21:43:45,256 INFO L276 IsEmpty]: Start isEmpty. Operand 2591 states and 3044 transitions. [2024-11-13 21:43:45,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-13 21:43:45,258 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:45,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:45,553 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 175 proven. 106 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-13 21:43:46,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:46,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3047 states to 2594 states and 3047 transitions. [2024-11-13 21:43:46,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2594 states and 3047 transitions. [2024-11-13 21:43:46,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 21:43:46,506 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:46,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:46,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:47,564 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 228 proven. 38 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 21:43:50,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:50,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3075 states to 2619 states and 3075 transitions. [2024-11-13 21:43:50,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2619 states and 3075 transitions. [2024-11-13 21:43:50,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 21:43:50,647 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:50,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:51,580 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:43:58,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:58,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3152 states to 2690 states and 3152 transitions. [2024-11-13 21:43:58,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2690 states and 3152 transitions. [2024-11-13 21:43:58,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-13 21:43:58,415 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:58,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:58,734 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 186 proven. 111 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 21:43:59,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:43:59,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3159 states to 2697 states and 3159 transitions. [2024-11-13 21:43:59,155 INFO L276 IsEmpty]: Start isEmpty. Operand 2697 states and 3159 transitions. [2024-11-13 21:43:59,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-13 21:43:59,157 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:43:59,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:43:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:43:59,281 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 251 proven. 64 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 21:44:01,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:44:01,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3171 states to 2705 states and 3171 transitions. [2024-11-13 21:44:01,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2705 states and 3171 transitions. [2024-11-13 21:44:01,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-13 21:44:01,052 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:44:01,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:44:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:44:01,356 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 185 proven. 152 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 21:44:03,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:44:03,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3204 states to 2736 states and 3204 transitions. [2024-11-13 21:44:03,948 INFO L276 IsEmpty]: Start isEmpty. Operand 2736 states and 3204 transitions. [2024-11-13 21:44:03,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 21:44:03,950 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:44:03,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:44:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:44:04,255 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 189 proven. 114 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 21:44:04,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:44:04,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 2739 states and 3208 transitions. [2024-11-13 21:44:04,544 INFO L276 IsEmpty]: Start isEmpty. Operand 2739 states and 3208 transitions. [2024-11-13 21:44:04,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 21:44:04,546 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:44:04,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:44:04,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:44:04,577 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 21:44:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:44:04,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:44:04,843 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 21:44:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:44:05,053 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 134 iterations. [2024-11-13 21:44:05,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 09:44:05 ImpRootNode [2024-11-13 21:44:05,399 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 21:44:05,400 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 21:44:05,400 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 21:44:05,400 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 21:44:05,401 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:41:02" (3/4) ... [2024-11-13 21:44:05,402 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 21:44:05,611 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d9d50f5-d05c-4181-a5f8-1e7bb95d5b46/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 21:44:05,611 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 21:44:05,614 INFO L158 Benchmark]: Toolchain (without parser) took 185968.97ms. Allocated memory was 117.4MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 90.2MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 188.6MB. Max. memory is 16.1GB. [2024-11-13 21:44:05,615 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 83.9MB. Free memory is still 41.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:44:05,616 INFO L158 Benchmark]: CACSL2BoogieTranslator took 643.96ms. Allocated memory is still 117.4MB. Free memory was 90.2MB in the beginning and 62.9MB in the end (delta: 27.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 21:44:05,616 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.59ms. Allocated memory is still 117.4MB. Free memory was 62.9MB in the beginning and 57.3MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 21:44:05,617 INFO L158 Benchmark]: Boogie Preprocessor took 59.06ms. Allocated memory is still 117.4MB. Free memory was 57.3MB in the beginning and 53.3MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 21:44:05,617 INFO L158 Benchmark]: RCFGBuilder took 2122.38ms. Allocated memory is still 117.4MB. Free memory was 53.3MB in the beginning and 68.9MB in the end (delta: -15.7MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2024-11-13 21:44:05,618 INFO L158 Benchmark]: CodeCheck took 182831.54ms. Allocated memory was 117.4MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 68.9MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-11-13 21:44:05,618 INFO L158 Benchmark]: Witness Printer took 211.32ms. Allocated memory is still 2.4GB. Free memory was 2.2GB in the beginning and 2.1GB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 21:44:05,621 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: 182.4s, OverallIterations: 134, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 386333 SdHoareTripleChecker+Valid, 1105.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 385276 mSDsluCounter, 66661 SdHoareTripleChecker+Invalid, 947.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 57694 mSDsCounter, 95175 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 830781 IncrementalHoareTripleChecker+Invalid, 925956 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 95175 mSolverCounterUnsat, 8967 mSDtfsCounter, 830781 mSolverCounterSat, 11.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 161276 GetRequests, 153401 SyntacticMatches, 6821 SemanticMatches, 1054 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833709 ImplicationChecksByTransitivity, 124.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.9s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 33.5s InterpolantComputationTime, 24833 NumberOfCodeBlocks, 24833 NumberOfCodeBlocksAsserted, 134 NumberOfCheckSat, 24445 ConstructedInterpolants, 0 QuantifiedInterpolants, 149961 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 133 InterpolantComputations, 56 PerfectInterpolantSequences, 21968/26909 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 435]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int d= 4; [L19] int e= 5; [L20] int f= 6; [L21] int c= 3; [L22] int b= 2; [L25] int u = 21; [L26] int v = 22; [L27] int w = 23; [L28] int x = 24; [L29] int y = 25; [L30] int z = 26; [L32] int a17 = 1; [L33] int a7 = 0; [L34] int a20 = 1; [L35] int a8 = 15; [L36] int a12 = 8; [L37] int a16 = 5; [L38] int a21 = 1; [L590] int output = -1; VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L344] a17 = 0 [L345] a16 = 4 [L346] return 21; VAL [\result=21, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L279] a20 = 0 [L280] a17 = 1 [L281] a16 = 6 [L282] return 21; VAL [\result=21, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L73] a17 = 0 [L74] return 26; VAL [\result=26, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND TRUE ((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13))))))) [L393] a20 = 0 [L394] a21 = 1 [L395] a8 = 14 [L396] a17 = 0 [L397] a16 = 5 [L398] a7 = 1 [L399] return -1; VAL [\result=-1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L410] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L413] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L416] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L419] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L422] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L425] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L428] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L431] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L434] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1)) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L435] reach_error() VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.44ms. Allocated memory is still 83.9MB. Free memory is still 41.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 643.96ms. Allocated memory is still 117.4MB. Free memory was 90.2MB in the beginning and 62.9MB in the end (delta: 27.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.59ms. Allocated memory is still 117.4MB. Free memory was 62.9MB in the beginning and 57.3MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.06ms. Allocated memory is still 117.4MB. Free memory was 57.3MB in the beginning and 53.3MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2122.38ms. Allocated memory is still 117.4MB. Free memory was 53.3MB in the beginning and 68.9MB in the end (delta: -15.7MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. * CodeCheck took 182831.54ms. Allocated memory was 117.4MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 68.9MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 211.32ms. Allocated memory is still 2.4GB. Free memory was 2.2GB in the beginning and 2.1GB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-13 21:44:05,667 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d9d50f5-d05c-4181-a5f8-1e7bb95d5b46/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE