./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label57.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_442cebfd-1f2d-4484-9cee-22c171dfa2b1/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_442cebfd-1f2d-4484-9cee-22c171dfa2b1/bin/ukojak-verify-ENZ3QT5qd3/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_442cebfd-1f2d-4484-9cee-22c171dfa2b1/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_442cebfd-1f2d-4484-9cee-22c171dfa2b1/bin/ukojak-verify-ENZ3QT5qd3/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label57.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_442cebfd-1f2d-4484-9cee-22c171dfa2b1/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_442cebfd-1f2d-4484-9cee-22c171dfa2b1/bin/ukojak-verify-ENZ3QT5qd3 --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 0128e00bf508dfedd424bfda3d692f75ea10f378731858e87047f02277f2ca04 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-25 03:51:52,840 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-25 03:51:52,902 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_442cebfd-1f2d-4484-9cee-22c171dfa2b1/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-25 03:51:52,907 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-25 03:51:52,907 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-25 03:51:52,947 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-25 03:51:52,948 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-25 03:51:52,948 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-25 03:51:52,948 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-25 03:51:52,948 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-25 03:51:52,949 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-25 03:51:52,949 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-25 03:51:52,949 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-25 03:51:52,949 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-25 03:51:52,949 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-25 03:51:52,949 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-25 03:51:52,949 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-25 03:51:52,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-25 03:51:52,949 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-25 03:51:52,949 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-25 03:51:52,950 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-25 03:51:52,950 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-25 03:51:52,950 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-25 03:51:52,950 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-25 03:51:52,950 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-25 03:51:52,950 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-25 03:51:52,950 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-25 03:51:52,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 03:51:52,950 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-25 03:51:52,951 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-25 03:51:52,951 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-25 03:51:52,951 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-25 03:51:52,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-25 03:51:52,951 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_442cebfd-1f2d-4484-9cee-22c171dfa2b1/bin/ukojak-verify-ENZ3QT5qd3 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 -> 0128e00bf508dfedd424bfda3d692f75ea10f378731858e87047f02277f2ca04 [2024-11-25 03:51:53,253 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-25 03:51:53,265 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-25 03:51:53,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-25 03:51:53,269 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-25 03:51:53,269 INFO L274 PluginConnector]: CDTParser initialized [2024-11-25 03:51:53,271 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_442cebfd-1f2d-4484-9cee-22c171dfa2b1/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/eca-rers2012/Problem01_label57.c [2024-11-25 03:51:56,354 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_442cebfd-1f2d-4484-9cee-22c171dfa2b1/bin/ukojak-verify-ENZ3QT5qd3/data/ad812b261/aa85bf4d66a5404498e4fc3759847693/FLAG1d585d215 [2024-11-25 03:51:56,705 INFO L384 CDTParser]: Found 1 translation units. [2024-11-25 03:51:56,705 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_442cebfd-1f2d-4484-9cee-22c171dfa2b1/sv-benchmarks/c/eca-rers2012/Problem01_label57.c [2024-11-25 03:51:56,717 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_442cebfd-1f2d-4484-9cee-22c171dfa2b1/bin/ukojak-verify-ENZ3QT5qd3/data/ad812b261/aa85bf4d66a5404498e4fc3759847693/FLAG1d585d215 [2024-11-25 03:51:56,733 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_442cebfd-1f2d-4484-9cee-22c171dfa2b1/bin/ukojak-verify-ENZ3QT5qd3/data/ad812b261/aa85bf4d66a5404498e4fc3759847693 [2024-11-25 03:51:56,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-25 03:51:56,737 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-25 03:51:56,738 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-25 03:51:56,738 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-25 03:51:56,742 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-25 03:51:56,742 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:51:56" (1/1) ... [2024-11-25 03:51:56,743 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b4f361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:56, skipping insertion in model container [2024-11-25 03:51:56,743 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:51:56" (1/1) ... [2024-11-25 03:51:56,783 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-25 03:51:57,095 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_442cebfd-1f2d-4484-9cee-22c171dfa2b1/sv-benchmarks/c/eca-rers2012/Problem01_label57.c[15253,15266] [2024-11-25 03:51:57,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 03:51:57,152 INFO L200 MainTranslator]: Completed pre-run [2024-11-25 03:51:57,232 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_442cebfd-1f2d-4484-9cee-22c171dfa2b1/sv-benchmarks/c/eca-rers2012/Problem01_label57.c[15253,15266] [2024-11-25 03:51:57,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 03:51:57,275 INFO L204 MainTranslator]: Completed translation [2024-11-25 03:51:57,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:57 WrapperNode [2024-11-25 03:51:57,276 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-25 03:51:57,277 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-25 03:51:57,277 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-25 03:51:57,277 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-25 03:51:57,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:57" (1/1) ... [2024-11-25 03:51:57,312 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:57" (1/1) ... [2024-11-25 03:51:57,368 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-25 03:51:57,368 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-25 03:51:57,369 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-25 03:51:57,369 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-25 03:51:57,369 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-25 03:51:57,376 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:57" (1/1) ... [2024-11-25 03:51:57,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:57" (1/1) ... [2024-11-25 03:51:57,381 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:57" (1/1) ... [2024-11-25 03:51:57,381 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:57" (1/1) ... [2024-11-25 03:51:57,398 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:57" (1/1) ... [2024-11-25 03:51:57,405 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:57" (1/1) ... [2024-11-25 03:51:57,416 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:57" (1/1) ... [2024-11-25 03:51:57,427 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:57" (1/1) ... [2024-11-25 03:51:57,434 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:57" (1/1) ... [2024-11-25 03:51:57,443 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-25 03:51:57,444 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-25 03:51:57,444 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-25 03:51:57,444 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-25 03:51:57,449 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:57" (1/1) ... [2024-11-25 03:51:57,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 03:51:57,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_442cebfd-1f2d-4484-9cee-22c171dfa2b1/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-25 03:51:57,489 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_442cebfd-1f2d-4484-9cee-22c171dfa2b1/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-25 03:51:57,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_442cebfd-1f2d-4484-9cee-22c171dfa2b1/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-25 03:51:57,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-25 03:51:57,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-25 03:51:57,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-25 03:51:57,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-25 03:51:57,598 INFO L234 CfgBuilder]: Building ICFG [2024-11-25 03:51:57,600 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-25 03:51:58,878 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-25 03:51:58,879 INFO L283 CfgBuilder]: Performing block encoding [2024-11-25 03:51:59,256 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-25 03:51:59,256 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-25 03:51:59,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:51:59 BoogieIcfgContainer [2024-11-25 03:51:59,258 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-25 03:51:59,258 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-25 03:51:59,258 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-25 03:51:59,269 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-25 03:51:59,269 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:51:59" (1/1) ... [2024-11-25 03:51:59,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-25 03:51:59,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:51:59,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-25 03:51:59,329 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-25 03:51:59,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-25 03:51:59,333 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:51:59,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:51:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:51:59,901 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-25 03:52:00,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:00,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 145 states and 237 transitions. [2024-11-25 03:52:00,581 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 237 transitions. [2024-11-25 03:52:00,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-25 03:52:00,584 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:00,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:00,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 03:52:01,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:01,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 146 states and 238 transitions. [2024-11-25 03:52:01,142 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 238 transitions. [2024-11-25 03:52:01,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-25 03:52:01,145 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:01,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:01,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:01,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:01,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 150 states and 244 transitions. [2024-11-25 03:52:01,430 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 244 transitions. [2024-11-25 03:52:01,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-25 03:52:01,431 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:01,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:01,603 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 03:52:01,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:01,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 151 states and 245 transitions. [2024-11-25 03:52:01,798 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 245 transitions. [2024-11-25 03:52:01,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-25 03:52:01,800 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:01,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:01,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:01,966 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:02,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:02,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 159 states and 258 transitions. [2024-11-25 03:52:02,177 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 258 transitions. [2024-11-25 03:52:02,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-25 03:52:02,178 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:02,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:02,324 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-25 03:52:02,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:02,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 160 states and 259 transitions. [2024-11-25 03:52:02,487 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 259 transitions. [2024-11-25 03:52:02,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-25 03:52:02,491 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:02,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:02,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:02,705 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:02,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:02,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 168 states and 268 transitions. [2024-11-25 03:52:02,858 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 268 transitions. [2024-11-25 03:52:02,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-25 03:52:02,859 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:02,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:03,093 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:03,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:03,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 182 states and 286 transitions. [2024-11-25 03:52:03,457 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 286 transitions. [2024-11-25 03:52:03,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-25 03:52:03,459 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:03,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:03,655 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-25 03:52:04,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:04,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 197 states and 306 transitions. [2024-11-25 03:52:04,196 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 306 transitions. [2024-11-25 03:52:04,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-25 03:52:04,197 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:04,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:04,458 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:05,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:05,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 212 states and 327 transitions. [2024-11-25 03:52:05,197 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 327 transitions. [2024-11-25 03:52:05,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-25 03:52:05,198 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:05,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:05,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:05,348 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:06,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:06,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 230 states and 356 transitions. [2024-11-25 03:52:06,251 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2024-11-25 03:52:06,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-25 03:52:06,252 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:06,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:06,419 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-25 03:52:06,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:06,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 232 states and 359 transitions. [2024-11-25 03:52:06,660 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 359 transitions. [2024-11-25 03:52:06,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-25 03:52:06,662 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:06,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:06,755 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-25 03:52:06,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:06,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 237 states and 365 transitions. [2024-11-25 03:52:06,890 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 365 transitions. [2024-11-25 03:52:06,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-25 03:52:06,891 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:06,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:07,020 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 03:52:07,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:07,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 238 states and 366 transitions. [2024-11-25 03:52:07,213 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 366 transitions. [2024-11-25 03:52:07,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-25 03:52:07,214 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:07,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:07,340 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:08,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:08,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 257 states and 395 transitions. [2024-11-25 03:52:08,286 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 395 transitions. [2024-11-25 03:52:08,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-25 03:52:08,287 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:08,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:08,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:08,363 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:08,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:08,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 258 states and 396 transitions. [2024-11-25 03:52:08,542 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 396 transitions. [2024-11-25 03:52:08,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-25 03:52:08,544 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:08,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:08,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:08,662 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-25 03:52:09,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:09,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 273 states and 415 transitions. [2024-11-25 03:52:09,194 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 415 transitions. [2024-11-25 03:52:09,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-25 03:52:09,195 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:09,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:09,321 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 03:52:10,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:10,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 291 states and 435 transitions. [2024-11-25 03:52:10,172 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 435 transitions. [2024-11-25 03:52:10,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-25 03:52:10,173 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:10,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:10,261 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:10,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:10,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 295 states and 439 transitions. [2024-11-25 03:52:10,319 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 439 transitions. [2024-11-25 03:52:10,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-25 03:52:10,320 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:10,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:10,432 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 03:52:10,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:10,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 299 states and 444 transitions. [2024-11-25 03:52:10,818 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 444 transitions. [2024-11-25 03:52:10,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-25 03:52:10,820 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:10,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:10,883 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-25 03:52:11,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:11,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 307 states and 459 transitions. [2024-11-25 03:52:11,418 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 459 transitions. [2024-11-25 03:52:11,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-25 03:52:11,419 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:11,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:11,494 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-25 03:52:11,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:11,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 313 states and 467 transitions. [2024-11-25 03:52:11,955 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 467 transitions. [2024-11-25 03:52:11,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-25 03:52:11,956 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:11,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:11,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:12,016 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-25 03:52:12,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:12,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 316 states and 471 transitions. [2024-11-25 03:52:12,254 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 471 transitions. [2024-11-25 03:52:12,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-25 03:52:12,255 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:12,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:12,336 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:12,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:12,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 331 states and 491 transitions. [2024-11-25 03:52:12,869 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 491 transitions. [2024-11-25 03:52:12,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-25 03:52:12,870 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:12,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:12,987 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-25 03:52:13,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:13,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 345 states and 508 transitions. [2024-11-25 03:52:13,304 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 508 transitions. [2024-11-25 03:52:13,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-25 03:52:13,305 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:13,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:13,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:13,504 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:13,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:13,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 347 states and 510 transitions. [2024-11-25 03:52:13,808 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 510 transitions. [2024-11-25 03:52:13,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-25 03:52:13,810 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:13,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:13,875 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 03:52:14,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:14,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 353 states and 516 transitions. [2024-11-25 03:52:14,220 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 516 transitions. [2024-11-25 03:52:14,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-25 03:52:14,222 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:14,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:14,286 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 03:52:14,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:14,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 357 states and 519 transitions. [2024-11-25 03:52:14,332 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 519 transitions. [2024-11-25 03:52:14,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-25 03:52:14,333 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:14,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:14,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:14,460 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:14,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:14,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 359 states and 522 transitions. [2024-11-25 03:52:14,511 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 522 transitions. [2024-11-25 03:52:14,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-25 03:52:14,513 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:14,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:14,695 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:15,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:15,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 373 states and 540 transitions. [2024-11-25 03:52:15,285 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 540 transitions. [2024-11-25 03:52:15,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-25 03:52:15,287 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:15,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:15,414 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:15,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:15,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 377 states and 545 transitions. [2024-11-25 03:52:15,708 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 545 transitions. [2024-11-25 03:52:15,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-25 03:52:15,709 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:15,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:15,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:15,813 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 03:52:16,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:16,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 379 states and 548 transitions. [2024-11-25 03:52:16,053 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 548 transitions. [2024-11-25 03:52:16,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-25 03:52:16,055 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:16,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:16,399 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 35 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:16,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:16,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 386 states and 555 transitions. [2024-11-25 03:52:16,898 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 555 transitions. [2024-11-25 03:52:16,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-25 03:52:16,900 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:16,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:17,037 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 03:52:17,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:17,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 395 states and 564 transitions. [2024-11-25 03:52:17,455 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 564 transitions. [2024-11-25 03:52:17,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-25 03:52:17,457 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:17,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:17,576 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 03:52:17,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:17,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 399 states and 567 transitions. [2024-11-25 03:52:17,885 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 567 transitions. [2024-11-25 03:52:17,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-25 03:52:17,886 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:17,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:18,045 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 03:52:18,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:18,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 402 states and 569 transitions. [2024-11-25 03:52:18,328 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 569 transitions. [2024-11-25 03:52:18,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-25 03:52:18,329 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:18,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:18,431 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:19,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:19,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 472 states and 647 transitions. [2024-11-25 03:52:19,104 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 647 transitions. [2024-11-25 03:52:19,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-25 03:52:19,105 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:19,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:19,181 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:19,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:19,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 486 states and 664 transitions. [2024-11-25 03:52:19,294 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 664 transitions. [2024-11-25 03:52:19,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-25 03:52:19,295 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:19,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:19,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:19,357 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-25 03:52:19,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:19,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 497 states and 678 transitions. [2024-11-25 03:52:19,551 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 678 transitions. [2024-11-25 03:52:19,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-25 03:52:19,553 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:19,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:19,693 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 42 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:19,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:19,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 504 states and 686 transitions. [2024-11-25 03:52:19,763 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 686 transitions. [2024-11-25 03:52:19,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-25 03:52:19,764 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:19,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:19,827 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 03:52:19,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:19,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 506 states and 688 transitions. [2024-11-25 03:52:19,867 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 688 transitions. [2024-11-25 03:52:19,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-25 03:52:19,868 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:19,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:19,936 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 03:52:20,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:20,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 513 states and 695 transitions. [2024-11-25 03:52:20,096 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 695 transitions. [2024-11-25 03:52:20,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-25 03:52:20,097 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:20,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:20,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:20,175 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:21,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:21,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 551 states and 739 transitions. [2024-11-25 03:52:21,136 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 739 transitions. [2024-11-25 03:52:21,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-25 03:52:21,137 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:21,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:21,224 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:21,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:21,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 554 states and 741 transitions. [2024-11-25 03:52:21,520 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 741 transitions. [2024-11-25 03:52:21,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-25 03:52:21,521 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:21,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:21,602 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:21,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:21,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 557 states and 743 transitions. [2024-11-25 03:52:21,902 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 743 transitions. [2024-11-25 03:52:21,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-25 03:52:21,904 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:21,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:21,962 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:22,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:22,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 571 states and 758 transitions. [2024-11-25 03:52:22,078 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 758 transitions. [2024-11-25 03:52:22,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-25 03:52:22,080 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:22,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:22,146 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 03:52:22,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:22,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 580 states and 766 transitions. [2024-11-25 03:52:22,223 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 766 transitions. [2024-11-25 03:52:22,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-25 03:52:22,225 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:22,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:22,337 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:22,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:22,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 588 states and 775 transitions. [2024-11-25 03:52:22,574 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 775 transitions. [2024-11-25 03:52:22,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-25 03:52:22,575 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:22,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:22,743 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-25 03:52:23,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:23,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 672 states and 862 transitions. [2024-11-25 03:52:23,740 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 862 transitions. [2024-11-25 03:52:23,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-25 03:52:23,741 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:23,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:23,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:24,023 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 49 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:24,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:24,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 703 states and 897 transitions. [2024-11-25 03:52:24,739 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 897 transitions. [2024-11-25 03:52:24,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-25 03:52:24,741 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:24,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:24,859 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 03:52:25,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:25,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 708 states and 901 transitions. [2024-11-25 03:52:25,051 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 901 transitions. [2024-11-25 03:52:25,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-25 03:52:25,052 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:25,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:25,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:25,303 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 66 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-25 03:52:25,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:25,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 711 states and 904 transitions. [2024-11-25 03:52:25,458 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 904 transitions. [2024-11-25 03:52:25,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-25 03:52:25,460 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:25,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:25,535 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-25 03:52:25,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:25,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 725 states and 921 transitions. [2024-11-25 03:52:25,977 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 921 transitions. [2024-11-25 03:52:25,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-25 03:52:25,978 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:25,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:26,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:26,076 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:26,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:26,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 752 states and 949 transitions. [2024-11-25 03:52:26,261 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 949 transitions. [2024-11-25 03:52:26,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-25 03:52:26,262 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:26,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:26,449 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:26,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:26,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 769 states and 967 transitions. [2024-11-25 03:52:26,708 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 967 transitions. [2024-11-25 03:52:26,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-25 03:52:26,708 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:26,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:26,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:26,829 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-25 03:52:27,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:27,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 792 states and 991 transitions. [2024-11-25 03:52:27,187 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 991 transitions. [2024-11-25 03:52:27,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-25 03:52:27,188 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:27,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:27,274 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-25 03:52:27,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:27,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 793 states and 991 transitions. [2024-11-25 03:52:27,327 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 991 transitions. [2024-11-25 03:52:27,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-25 03:52:27,329 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:27,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:27,864 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-25 03:52:30,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:30,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 865 states and 1084 transitions. [2024-11-25 03:52:30,782 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1084 transitions. [2024-11-25 03:52:30,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-25 03:52:30,783 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:30,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:31,047 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-25 03:52:31,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:31,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 869 states and 1089 transitions. [2024-11-25 03:52:31,735 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1089 transitions. [2024-11-25 03:52:31,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-25 03:52:31,736 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:31,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:31,839 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:32,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:32,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 896 states and 1120 transitions. [2024-11-25 03:52:32,519 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1120 transitions. [2024-11-25 03:52:32,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-25 03:52:32,520 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:32,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:32,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:32,691 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-25 03:52:34,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:34,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 962 states and 1193 transitions. [2024-11-25 03:52:34,212 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1193 transitions. [2024-11-25 03:52:34,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-25 03:52:34,213 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:34,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:34,290 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-25 03:52:34,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:34,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 975 states and 1206 transitions. [2024-11-25 03:52:34,383 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1206 transitions. [2024-11-25 03:52:34,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-25 03:52:34,385 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:34,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:34,494 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-25 03:52:34,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:34,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 976 states and 1207 transitions. [2024-11-25 03:52:34,531 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1207 transitions. [2024-11-25 03:52:34,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-25 03:52:34,532 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:34,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:34,624 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-25 03:52:34,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:34,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 989 states and 1221 transitions. [2024-11-25 03:52:34,720 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1221 transitions. [2024-11-25 03:52:34,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-25 03:52:34,721 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:34,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:35,172 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 82 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:38,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:38,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1072 states and 1319 transitions. [2024-11-25 03:52:38,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1319 transitions. [2024-11-25 03:52:38,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-25 03:52:38,246 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:38,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:38,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:38,515 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:39,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:39,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1091 states and 1339 transitions. [2024-11-25 03:52:39,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1339 transitions. [2024-11-25 03:52:39,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-25 03:52:39,182 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:39,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:39,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:39,339 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 03:52:41,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:41,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1126 states and 1384 transitions. [2024-11-25 03:52:41,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1384 transitions. [2024-11-25 03:52:41,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-25 03:52:41,032 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:41,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:41,163 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 03:52:41,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:41,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1131 states and 1389 transitions. [2024-11-25 03:52:41,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1389 transitions. [2024-11-25 03:52:41,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-25 03:52:41,491 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:41,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:41,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:41,683 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 03:52:42,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:42,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1135 states and 1393 transitions. [2024-11-25 03:52:42,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1393 transitions. [2024-11-25 03:52:42,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-25 03:52:42,098 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:42,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:42,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:42,560 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 03:52:43,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:43,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1141 states and 1399 transitions. [2024-11-25 03:52:43,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1399 transitions. [2024-11-25 03:52:43,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-25 03:52:43,556 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:43,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:43,746 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 03:52:44,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:44,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1206 states and 1464 transitions. [2024-11-25 03:52:44,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1464 transitions. [2024-11-25 03:52:44,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-25 03:52:44,502 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:44,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:44,625 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-25 03:52:45,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:45,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1210 states and 1467 transitions. [2024-11-25 03:52:45,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1467 transitions. [2024-11-25 03:52:45,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-25 03:52:45,004 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:45,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:45,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:45,091 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-25 03:52:45,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:45,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1228 states and 1487 transitions. [2024-11-25 03:52:45,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1487 transitions. [2024-11-25 03:52:45,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-25 03:52:45,729 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:45,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:45,800 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-25 03:52:47,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:47,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1282 states and 1548 transitions. [2024-11-25 03:52:47,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1548 transitions. [2024-11-25 03:52:47,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-25 03:52:47,896 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:47,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:47,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:48,009 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-25 03:52:48,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:48,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1289 states and 1555 transitions. [2024-11-25 03:52:48,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1555 transitions. [2024-11-25 03:52:48,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-25 03:52:48,598 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:48,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:49,111 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 98 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:54,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:54,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1368 states and 1654 transitions. [2024-11-25 03:52:54,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 1654 transitions. [2024-11-25 03:52:54,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-25 03:52:54,728 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:54,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:54,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:55,021 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 98 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:55,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:55,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1373 states and 1660 transitions. [2024-11-25 03:52:55,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 1660 transitions. [2024-11-25 03:52:55,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-25 03:52:55,977 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:55,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:56,246 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-25 03:52:57,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:57,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1398 states and 1686 transitions. [2024-11-25 03:52:57,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 1686 transitions. [2024-11-25 03:52:57,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-25 03:52:57,139 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:57,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:57,266 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-25 03:52:57,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:57,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1402 states and 1689 transitions. [2024-11-25 03:52:57,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1689 transitions. [2024-11-25 03:52:57,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-25 03:52:57,643 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:57,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:57,957 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-25 03:52:58,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:58,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1472 states and 1767 transitions. [2024-11-25 03:52:58,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1472 states and 1767 transitions. [2024-11-25 03:52:58,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-25 03:52:58,744 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:58,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:59,092 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:53:00,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:00,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1477 states and 1779 transitions. [2024-11-25 03:53:00,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 1779 transitions. [2024-11-25 03:53:00,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-25 03:53:00,053 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:00,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:00,360 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:53:00,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:00,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1478 states and 1779 transitions. [2024-11-25 03:53:00,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 1779 transitions. [2024-11-25 03:53:00,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-25 03:53:00,819 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:00,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:01,062 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:53:01,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:01,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1479 states and 1779 transitions. [2024-11-25 03:53:01,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 1779 transitions. [2024-11-25 03:53:01,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-25 03:53:01,558 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:01,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:02,133 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-25 03:53:03,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:03,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1863 states to 1548 states and 1863 transitions. [2024-11-25 03:53:03,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 1863 transitions. [2024-11-25 03:53:03,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-25 03:53:03,621 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:03,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:03,760 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-25 03:53:03,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:03,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1863 states to 1549 states and 1863 transitions. [2024-11-25 03:53:03,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 1863 transitions. [2024-11-25 03:53:03,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-25 03:53:03,893 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:03,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:04,623 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 3 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:53:09,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:09,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2068 states to 1732 states and 2068 transitions. [2024-11-25 03:53:09,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2068 transitions. [2024-11-25 03:53:09,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-25 03:53:09,635 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:09,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:10,034 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 120 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-25 03:53:10,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:10,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2087 states to 1747 states and 2087 transitions. [2024-11-25 03:53:10,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1747 states and 2087 transitions. [2024-11-25 03:53:10,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-25 03:53:10,728 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:10,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:11,340 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 136 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:53:13,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:13,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 1812 states and 2170 transitions. [2024-11-25 03:53:13,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1812 states and 2170 transitions. [2024-11-25 03:53:13,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-25 03:53:13,852 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:13,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:14,058 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 03:53:15,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:15,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2198 states to 1831 states and 2198 transitions. [2024-11-25 03:53:15,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1831 states and 2198 transitions. [2024-11-25 03:53:15,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-25 03:53:15,909 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:15,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:16,274 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 136 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:53:16,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:16,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2198 states to 1832 states and 2198 transitions. [2024-11-25 03:53:16,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 2198 transitions. [2024-11-25 03:53:16,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-25 03:53:16,773 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:16,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:17,001 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 03:53:17,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:17,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 1839 states and 2213 transitions. [2024-11-25 03:53:17,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2213 transitions. [2024-11-25 03:53:17,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-25 03:53:17,787 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:17,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:18,247 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 136 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:53:18,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:18,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 1842 states and 2217 transitions. [2024-11-25 03:53:18,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2217 transitions. [2024-11-25 03:53:18,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-25 03:53:18,750 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:18,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:18,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:19,133 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 136 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:53:19,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:19,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 1843 states and 2217 transitions. [2024-11-25 03:53:19,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 2217 transitions. [2024-11-25 03:53:19,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-25 03:53:19,780 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:19,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:19,929 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 03:53:20,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:20,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 1847 states and 2224 transitions. [2024-11-25 03:53:20,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2224 transitions. [2024-11-25 03:53:20,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-25 03:53:20,386 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:20,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:20,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:20,767 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 135 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:53:24,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:24,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2300 states to 1908 states and 2300 transitions. [2024-11-25 03:53:24,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 2300 transitions. [2024-11-25 03:53:24,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-25 03:53:24,539 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:24,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:25,229 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 205 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-25 03:53:27,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:27,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 1987 states and 2395 transitions. [2024-11-25 03:53:27,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 2395 transitions. [2024-11-25 03:53:27,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-25 03:53:27,594 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:27,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:27,847 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 205 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-25 03:53:28,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:28,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2398 states to 1991 states and 2398 transitions. [2024-11-25 03:53:28,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1991 states and 2398 transitions. [2024-11-25 03:53:28,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-25 03:53:28,497 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:28,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:28,770 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 205 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-25 03:53:29,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:29,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 1995 states and 2401 transitions. [2024-11-25 03:53:29,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2401 transitions. [2024-11-25 03:53:29,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-25 03:53:29,370 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:29,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:29,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:29,534 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 136 proven. 65 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-25 03:53:30,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:30,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2421 states to 2015 states and 2421 transitions. [2024-11-25 03:53:30,214 INFO L276 IsEmpty]: Start isEmpty. Operand 2015 states and 2421 transitions. [2024-11-25 03:53:30,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-25 03:53:30,216 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:30,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:30,589 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 137 proven. 71 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-25 03:53:30,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:30,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2035 states and 2443 transitions. [2024-11-25 03:53:30,880 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 2443 transitions. [2024-11-25 03:53:30,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-25 03:53:30,883 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:30,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:30,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:31,033 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-11-25 03:53:31,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:31,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2451 states to 2040 states and 2451 transitions. [2024-11-25 03:53:31,466 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 2451 transitions. [2024-11-25 03:53:31,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-25 03:53:31,470 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:31,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:31,739 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-25 03:53:32,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:32,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2060 states and 2474 transitions. [2024-11-25 03:53:32,850 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states and 2474 transitions. [2024-11-25 03:53:32,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-25 03:53:32,851 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:32,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:32,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:33,125 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 139 proven. 55 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-25 03:53:36,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:36,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2107 states and 2536 transitions. [2024-11-25 03:53:36,904 INFO L276 IsEmpty]: Start isEmpty. Operand 2107 states and 2536 transitions. [2024-11-25 03:53:36,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-25 03:53:36,905 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:36,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:37,192 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-25 03:53:37,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:37,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2120 states and 2548 transitions. [2024-11-25 03:53:37,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 2548 transitions. [2024-11-25 03:53:37,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-25 03:53:37,679 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:37,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:37,754 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-11-25 03:53:38,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:38,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2620 states to 2190 states and 2620 transitions. [2024-11-25 03:53:38,473 INFO L276 IsEmpty]: Start isEmpty. Operand 2190 states and 2620 transitions. [2024-11-25 03:53:38,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-25 03:53:38,475 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:38,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:38,735 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 158 proven. 88 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-25 03:53:39,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:39,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2640 states to 2202 states and 2640 transitions. [2024-11-25 03:53:39,583 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 2640 transitions. [2024-11-25 03:53:39,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-25 03:53:39,585 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:39,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:39,941 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 175 proven. 42 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-25 03:53:41,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:41,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2217 states and 2658 transitions. [2024-11-25 03:53:41,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 2658 transitions. [2024-11-25 03:53:41,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-25 03:53:41,082 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:41,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:41,382 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-25 03:53:42,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:42,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2671 states to 2229 states and 2671 transitions. [2024-11-25 03:53:42,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2229 states and 2671 transitions. [2024-11-25 03:53:42,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-25 03:53:42,284 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:42,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:42,577 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-25 03:53:43,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:43,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2244 states and 2696 transitions. [2024-11-25 03:53:43,900 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 2696 transitions. [2024-11-25 03:53:43,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-25 03:53:43,901 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:43,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:44,006 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-25 03:53:45,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:45,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2721 states to 2266 states and 2721 transitions. [2024-11-25 03:53:45,408 INFO L276 IsEmpty]: Start isEmpty. Operand 2266 states and 2721 transitions. [2024-11-25 03:53:45,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-25 03:53:45,409 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:45,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:45,706 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-25 03:53:47,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:47,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2765 states to 2303 states and 2765 transitions. [2024-11-25 03:53:47,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 2765 transitions. [2024-11-25 03:53:47,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-25 03:53:47,234 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:47,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:47,298 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-25 03:53:48,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:48,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2791 states to 2325 states and 2791 transitions. [2024-11-25 03:53:48,781 INFO L276 IsEmpty]: Start isEmpty. Operand 2325 states and 2791 transitions. [2024-11-25 03:53:48,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-25 03:53:48,785 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:48,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:49,205 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 174 proven. 116 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-25 03:53:50,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:50,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2803 states to 2336 states and 2803 transitions. [2024-11-25 03:53:50,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2336 states and 2803 transitions. [2024-11-25 03:53:50,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-25 03:53:50,304 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:50,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:50,747 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 182 proven. 112 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-25 03:53:52,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:52,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2835 states to 2360 states and 2835 transitions. [2024-11-25 03:53:52,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 2835 transitions. [2024-11-25 03:53:52,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-25 03:53:52,662 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:52,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:52,757 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-25 03:53:53,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:53,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2838 states to 2362 states and 2838 transitions. [2024-11-25 03:53:53,242 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 2838 transitions. [2024-11-25 03:53:53,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-25 03:53:53,244 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:53,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:53,691 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 159 proven. 93 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-25 03:53:55,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:55,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2879 states to 2397 states and 2879 transitions. [2024-11-25 03:53:55,433 INFO L276 IsEmpty]: Start isEmpty. Operand 2397 states and 2879 transitions. [2024-11-25 03:53:55,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-25 03:53:55,434 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:55,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:55,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:55,502 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-25 03:53:56,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:56,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2883 states to 2398 states and 2883 transitions. [2024-11-25 03:53:56,146 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 2883 transitions. [2024-11-25 03:53:56,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-25 03:53:56,148 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:56,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:56,244 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-25 03:53:56,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:56,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2885 states to 2400 states and 2885 transitions. [2024-11-25 03:53:56,614 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 2885 transitions. [2024-11-25 03:53:56,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-25 03:53:56,615 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:56,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:56,680 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 231 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-25 03:53:57,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:57,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2886 states to 2401 states and 2886 transitions. [2024-11-25 03:53:57,259 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 2886 transitions. [2024-11-25 03:53:57,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-25 03:53:57,261 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:57,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:57,855 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-25 03:54:01,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:01,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2903 states to 2410 states and 2903 transitions. [2024-11-25 03:54:01,002 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 2903 transitions. [2024-11-25 03:54:01,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-25 03:54:01,004 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:01,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:01,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:01,509 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 200 proven. 63 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-25 03:54:04,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:04,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2925 states to 2423 states and 2925 transitions. [2024-11-25 03:54:04,640 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 2925 transitions. [2024-11-25 03:54:04,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-25 03:54:04,641 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:04,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:05,013 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 200 proven. 63 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-25 03:54:05,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:05,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2927 states to 2425 states and 2927 transitions. [2024-11-25 03:54:05,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2425 states and 2927 transitions. [2024-11-25 03:54:05,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-25 03:54:05,739 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:05,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:06,000 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 196 proven. 61 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-25 03:54:06,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:06,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2427 states and 2929 transitions. [2024-11-25 03:54:06,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 2929 transitions. [2024-11-25 03:54:06,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-25 03:54:06,763 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:06,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:07,227 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 198 proven. 61 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-25 03:54:09,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:09,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2964 states to 2455 states and 2964 transitions. [2024-11-25 03:54:09,509 INFO L276 IsEmpty]: Start isEmpty. Operand 2455 states and 2964 transitions. [2024-11-25 03:54:09,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-25 03:54:09,511 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:09,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:09,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:09,890 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 198 proven. 61 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-25 03:54:10,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:10,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2964 states to 2456 states and 2964 transitions. [2024-11-25 03:54:10,412 INFO L276 IsEmpty]: Start isEmpty. Operand 2456 states and 2964 transitions. [2024-11-25 03:54:10,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-25 03:54:10,414 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:10,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:10,704 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 169 proven. 103 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-25 03:54:12,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:12,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2985 states to 2470 states and 2985 transitions. [2024-11-25 03:54:12,939 INFO L276 IsEmpty]: Start isEmpty. Operand 2470 states and 2985 transitions. [2024-11-25 03:54:12,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-25 03:54:12,941 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:12,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:13,218 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 169 proven. 103 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-25 03:54:13,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:13,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2986 states to 2472 states and 2986 transitions. [2024-11-25 03:54:13,844 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 2986 transitions. [2024-11-25 03:54:13,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-25 03:54:13,846 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:13,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:14,038 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-25 03:54:16,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:16,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2998 states to 2482 states and 2998 transitions. [2024-11-25 03:54:16,035 INFO L276 IsEmpty]: Start isEmpty. Operand 2482 states and 2998 transitions. [2024-11-25 03:54:16,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-25 03:54:16,036 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:16,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:16,496 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 171 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 03:54:18,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:18,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3031 states to 2508 states and 3031 transitions. [2024-11-25 03:54:18,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2508 states and 3031 transitions. [2024-11-25 03:54:18,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-25 03:54:18,146 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:18,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:18,423 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 172 proven. 106 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-25 03:54:19,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:19,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3048 states to 2524 states and 3048 transitions. [2024-11-25 03:54:19,706 INFO L276 IsEmpty]: Start isEmpty. Operand 2524 states and 3048 transitions. [2024-11-25 03:54:19,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-25 03:54:19,709 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:19,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:19,990 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-25 03:54:21,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:21,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3074 states to 2548 states and 3074 transitions. [2024-11-25 03:54:21,348 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 3074 transitions. [2024-11-25 03:54:21,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-25 03:54:21,349 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:21,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:22,294 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 230 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:54:23,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:23,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3145 states to 2618 states and 3145 transitions. [2024-11-25 03:54:23,948 INFO L276 IsEmpty]: Start isEmpty. Operand 2618 states and 3145 transitions. [2024-11-25 03:54:23,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-25 03:54:23,950 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:23,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:24,385 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-25 03:54:27,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:27,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3173 states to 2643 states and 3173 transitions. [2024-11-25 03:54:27,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2643 states and 3173 transitions. [2024-11-25 03:54:27,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-25 03:54:27,184 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:27,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:27,479 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-25 03:54:29,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:29,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3177 states to 2647 states and 3177 transitions. [2024-11-25 03:54:29,002 INFO L276 IsEmpty]: Start isEmpty. Operand 2647 states and 3177 transitions. [2024-11-25 03:54:29,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-25 03:54:29,003 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:29,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:29,689 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-25 03:54:33,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:33,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3250 states to 2718 states and 3250 transitions. [2024-11-25 03:54:33,390 INFO L276 IsEmpty]: Start isEmpty. Operand 2718 states and 3250 transitions. [2024-11-25 03:54:33,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-11-25 03:54:33,391 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:33,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:33,673 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 224 proven. 65 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-25 03:54:35,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:35,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3269 states to 2736 states and 3269 transitions. [2024-11-25 03:54:35,614 INFO L276 IsEmpty]: Start isEmpty. Operand 2736 states and 3269 transitions. [2024-11-25 03:54:35,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-11-25 03:54:35,617 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:35,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:35,908 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 190 proven. 132 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-25 03:54:36,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:36,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3274 states to 2742 states and 3274 transitions. [2024-11-25 03:54:36,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2742 states and 3274 transitions. [2024-11-25 03:54:36,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-25 03:54:36,680 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:36,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:36,765 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2024-11-25 03:54:37,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:37,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3346 states to 2812 states and 3346 transitions. [2024-11-25 03:54:37,613 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 3346 transitions. [2024-11-25 03:54:37,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-25 03:54:37,615 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:37,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:37,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:37,689 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-11-25 03:54:39,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:39,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3376 states to 2837 states and 3376 transitions. [2024-11-25 03:54:39,814 INFO L276 IsEmpty]: Start isEmpty. Operand 2837 states and 3376 transitions. [2024-11-25 03:54:39,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-11-25 03:54:39,816 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:39,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:40,247 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 288 proven. 59 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-25 03:54:42,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:42,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3387 states to 2845 states and 3387 transitions. [2024-11-25 03:54:42,768 INFO L276 IsEmpty]: Start isEmpty. Operand 2845 states and 3387 transitions. [2024-11-25 03:54:42,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-11-25 03:54:42,769 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:42,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:43,257 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 288 proven. 59 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-25 03:54:45,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:45,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3398 states to 2852 states and 3398 transitions. [2024-11-25 03:54:45,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3398 transitions. [2024-11-25 03:54:45,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-11-25 03:54:45,053 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:45,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:45,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:45,132 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2024-11-25 03:54:46,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:46,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3414 states to 2867 states and 3414 transitions. [2024-11-25 03:54:46,654 INFO L276 IsEmpty]: Start isEmpty. Operand 2867 states and 3414 transitions. [2024-11-25 03:54:46,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-11-25 03:54:46,656 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:46,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:46,890 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-25 03:54:48,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:48,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3438 states to 2888 states and 3438 transitions. [2024-11-25 03:54:48,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 3438 transitions. [2024-11-25 03:54:48,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-11-25 03:54:48,510 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:48,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:48,916 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-25 03:54:51,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:51,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3456 states to 2904 states and 3456 transitions. [2024-11-25 03:54:51,446 INFO L276 IsEmpty]: Start isEmpty. Operand 2904 states and 3456 transitions. [2024-11-25 03:54:51,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-11-25 03:54:51,449 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:51,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:51,714 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-25 03:54:52,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:52,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3460 states to 2906 states and 3460 transitions. [2024-11-25 03:54:52,503 INFO L276 IsEmpty]: Start isEmpty. Operand 2906 states and 3460 transitions. [2024-11-25 03:54:52,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-25 03:54:52,506 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:52,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:52,971 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 3 proven. 287 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-25 03:54:54,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:54,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3531 states to 2976 states and 3531 transitions. [2024-11-25 03:54:54,487 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 3531 transitions. [2024-11-25 03:54:54,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-25 03:54:54,489 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:54,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:54,813 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 3 proven. 287 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-25 03:54:55,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:55,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3536 states to 2981 states and 3536 transitions. [2024-11-25 03:54:55,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2981 states and 3536 transitions. [2024-11-25 03:54:55,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-25 03:54:55,557 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:55,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 03:54:55,591 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-25 03:54:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 03:54:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 03:54:55,889 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-25 03:54:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 03:54:56,023 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 148 iterations. [2024-11-25 03:54:56,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 25.11 03:54:56 ImpRootNode [2024-11-25 03:54:56,178 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-25 03:54:56,179 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-25 03:54:56,179 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-25 03:54:56,179 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-25 03:54:56,180 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:51:59" (3/4) ... [2024-11-25 03:54:56,182 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-25 03:54:56,424 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 268. [2024-11-25 03:54:56,623 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_442cebfd-1f2d-4484-9cee-22c171dfa2b1/bin/ukojak-verify-ENZ3QT5qd3/witness.graphml [2024-11-25 03:54:56,628 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_442cebfd-1f2d-4484-9cee-22c171dfa2b1/bin/ukojak-verify-ENZ3QT5qd3/witness.yml [2024-11-25 03:54:56,628 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-25 03:54:56,629 INFO L158 Benchmark]: Toolchain (without parser) took 179892.04ms. Allocated memory was 142.6MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 117.0MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-25 03:54:56,629 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 142.6MB. Free memory is still 80.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 03:54:56,629 INFO L158 Benchmark]: CACSL2BoogieTranslator took 538.06ms. Allocated memory is still 142.6MB. Free memory was 116.8MB in the beginning and 90.0MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-25 03:54:56,630 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.51ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 84.7MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 03:54:56,630 INFO L158 Benchmark]: Boogie Preprocessor took 74.70ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 80.7MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 03:54:56,630 INFO L158 Benchmark]: RCFGBuilder took 1813.79ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 80.4MB in the beginning and 350.1MB in the end (delta: -269.7MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. [2024-11-25 03:54:56,631 INFO L158 Benchmark]: CodeCheck took 176920.05ms. Allocated memory was 427.8MB in the beginning and 2.7GB in the end (delta: 2.3GB). Free memory was 350.1MB in the beginning and 1.4GB in the end (delta: -1.0GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-11-25 03:54:56,631 INFO L158 Benchmark]: Witness Printer took 448.94ms. Allocated memory is still 2.7GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-25 03:54:56,633 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: 176.7s, OverallIterations: 148, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 416016 SdHoareTripleChecker+Valid, 1134.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 411341 mSDsluCounter, 57811 SdHoareTripleChecker+Invalid, 970.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49032 mSDsCounter, 104811 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 913464 IncrementalHoareTripleChecker+Invalid, 1018275 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 104811 mSolverCounterUnsat, 8779 mSDtfsCounter, 913464 mSolverCounterSat, 10.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 167895 GetRequests, 160311 SyntacticMatches, 6456 SemanticMatches, 1128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879095 ImplicationChecksByTransitivity, 121.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.9s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 30.2s InterpolantComputationTime, 25094 NumberOfCodeBlocks, 25094 NumberOfCodeBlocksAsserted, 148 NumberOfCheckSat, 24684 ConstructedInterpolants, 0 QuantifiedInterpolants, 136784 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 147 InterpolantComputations, 86 PerfectInterpolantSequences, 20718/24862 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, ConComCheckerStatistics: No data available - CounterExampleResult [Line: 420]: 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] [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) [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) [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) [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L83] a7 = 1 [L84] a17 = 1 [L85] a21 = 0 [L86] a20 = 1 [L87] a8 = 13 [L88] a16 = 5 [L89] return 26; VAL [\result=26, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 TRUE ((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5)) [L376] a21 = 1 [L377] a7 = 0 [L378] a17 = 0 [L379] a8 = 14 [L380] a20 = 0 [L381] return -1; VAL [\result=-1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, 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) [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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, 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] [L419] 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=0, 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] [L420] reach_error() VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, 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.37ms. Allocated memory is still 142.6MB. Free memory is still 80.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 538.06ms. Allocated memory is still 142.6MB. Free memory was 116.8MB in the beginning and 90.0MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.51ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 84.7MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.70ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 80.7MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1813.79ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 80.4MB in the beginning and 350.1MB in the end (delta: -269.7MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. * CodeCheck took 176920.05ms. Allocated memory was 427.8MB in the beginning and 2.7GB in the end (delta: 2.3GB). Free memory was 350.1MB in the beginning and 1.4GB in the end (delta: -1.0GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 448.94ms. Allocated memory is still 2.7GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-25 03:54:56,663 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_442cebfd-1f2d-4484-9cee-22c171dfa2b1/bin/ukojak-verify-ENZ3QT5qd3/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